The Asynchronous DeGroot Dynamics

. We analyze the asynchronous version of the DeGroot dynamics: In a connected graph G with n nodes, each node has an initial opinions in [0 , 1] and an independent Poisson clock. When a clock at a node v rings, the opinion at v is replaced by the average opinion of its neighbors. It is well known that the opinions converge to a consensus. We show that the expected time E ( τ ε ) to reach ε -consensus is poly( n ) in undirected graphs and in Eulerian digraphs, but for some digraphs of bounded degree it is exponential. Our main result is that in undirected graphs and Eulerian digraphs, if the degrees are uniformly bounded and the initial opinions are i.i.d., then E ( τ ε ) = polylog( n ) for every fixed ε > 0. We give sharp estimates for the variance of the limiting consensus opinion, which measures the ability to aggregate information (“wisdom of the crowd”). We also prove generalizations to non-reversible Markov chains and infinite graphs. New results of independent interest on fragmentation processes and coupled random walks are crucial to our analysis.

[1]  Itai Arieli,et al.  Granular DeGroot Dynamics -- a Model for Robust Naive Learning in Social Networks , 2022, EC.

[2]  Bernard Chazelle,et al.  A Sharp Bound on the $s$-Energy and Its Applications to Averaging Systems , 2018, IEEE Transactions on Automatic Control.

[3]  Yuval Peres,et al.  Sensitivity of Mixing Times in Eulerian Digraphs , 2016, SIAM J. Discret. Math..

[4]  Y. Peres,et al.  Probability on Trees and Networks , 2017 .

[5]  J. L. Gall,et al.  Brownian Motion, Martingales, and Stochastic Calculus , 2016 .

[6]  Local asymptotics for controlled martingales , 2014, 1402.2402.

[7]  Imogen Cara Halstead,et al.  Learning in social networks , 2014 .

[8]  Y. Peres,et al.  Localization for controlled random walks and martingales , 2013, 1309.4512.

[9]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[10]  Russell Lyons,et al.  Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding , 2012, ArXiv.

[11]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[12]  S. Redner,et al.  Voter model on heterogeneous graphs. , 2004, Physical review letters.

[13]  R. Lyons.  Asymptotic Enumeration of Spanning Trees , 2002, Combinatorics, Probability and Computing.

[14]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[15]  Alessandro Vespignani,et al.  Incomplete ordering of the voter model on small-world networks , 2002, cond-mat/0210465.

[16]  Jon M. Kleinberg,et al.  Protocols and impossibility results for gossip-based communication mechanisms , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[17]  Guillaume Deffuant,et al.  Mixing beliefs among interacting agents , 2000, Adv. Complex Syst..

[18]  L. Saloff-Coste,et al.  Lectures on finite Markov chains , 1997 .

[19]  S. Geer.  Exponential Inequalities for Martingales, with Application to Maximum Likelihood Estimation for Counting Processes , 1995 .

[20]  J. A. Fill.  Eigenvalue bounds on convergence to stationarity for nonreversible markov chains , 1991 .

[21]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[22]  J. T. Cox,et al.  Diffusive Clustering in the Two Dimensional Voter Model , 1986 .

[23]  E. Seneta,et al.  Towards consensus: some convergence theorems on repeated averaging , 1977, Journal of Applied Probability.

[24]  R. Holley,et al.  Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model , 1975 .

[25]  M. Degroot.  Reaching a Consensus , 1974 .