Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We present an algorithm for nonlinear consensus in complex networks. Our motivation draws from analysis on the algorithm based on a weighted linear update protocol. Comparison of the asymptotic with early convergence rate encourages an alternative algorithm which exploits both stages.
Basil Duval, Timothy Goodman, Olivier Sauter, Stefano Coda, Laurie Porte, Benoît Labit, Federico Alberto Alfredo Felici, Antoine Pierre Emmanuel Alexis Merle, Umar Sheikh, Mengdi Kong, Simon Van Mulders, Cristian Sommariva, Alessandro Pau