The Asynchronous DeGroot Dynamics (2209.05764v3)
Abstract: We analyze the asynchronous version of the DeGroot dynamics: In a connected graph $G$ with $n$ nodes, each node has an initial opinion 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 $\mathbb E(\tau_\varepsilon)$ to reach $\varepsilon$-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 $\mathbb E(\tau_\varepsilon)=\text{polylog}(n)$ for every fixed $\varepsilon>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.
- Granular degroot dynamics – a model for robust naive learning in social networks. Available at SSRN 3791413, 2021.
- Local asymptotics for controlled martingales. The Annals of Applied Probability, 26(3):1467–1494, 2016.
- Sensitivity of mixing times in Eulerian digraphs. SIAM J. Discrete Math., 32(1):624–655, 2018.
- Randomized gossip algorithms. IEEE transactions on information theory, 52(6):2508–2530, 2006.
- Incomplete ordering of the voter model on small-world networks. EPL (Europhysics Letters), 63(1):153, 2003.
- Towards consensus: Some convergence theorems on repeated averaging. Journal of Applied Probability, 14(1):89–97, 1977.
- Bernard Chazelle. A sharp bound on the s𝑠sitalic_s-energy and its applications to averaging systems. IEEE Transactions on Automatic Control, 64(10):4385–4390, 2019.
- Diffusive clustering in the two dimensional voter model. The Annals of Probability, pages 347–370, 1986.
- Mixing beliefs among interacting agents. Advances in Complex Systems, 3(01n04):87–98, 2000.
- Morris H DeGroot. Reaching a consensus. Journal of the American Statistical Association, 69(345):118–121, 1974.
- James Allen Fill. Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab., 1(1):62–87, 1991.
- Learning in social networks. In Yann Bramoullé, Andrea Galeotti, and Brian W. Rogers, editors, The Oxford Handbook of the Economics of Networks. Oxford University Press, 2016.
- Localization for controlled random walks and martingales. Electronic Communications in Probability, 19:1–8, 2014.
- A survey of gossiping and broadcasting in communication networks. Networks, 18(4):319–349, 1988.
- Ergodic theorems for weakly interacting infinite systems and the voter model. The annals of probability, pages 643–663, 1975.
- Gossip-based computation of aggregate information. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pages 482–491. IEEE, 2003.
- Protocols and impossibility results for gossip-based communication mechanisms. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pages 471–480. IEEE, 2002.
- Jean-François Le Gall. Brownian motion, martingales, and stochastic calculus, volume 274 of Graduate Texts in Mathematics. Springer, [Cham], french edition, 2016.
- Markov chains and mixing times. American Mathematical Society, Providence, RI, 2017. Second edition of [ MR2466937], With contributions by Elizabeth L. Wilmer, With a chapter on “Coupling from the past” by James G. Propp and David B. Wilson.
- Russell Lyons. Asymptotic enumeration of spanning trees. Combinatorics, Probability and Computing, 14(4):491–522, 2005.
- Sharp bounds on random walk eigenvalues via spectral embedding. Int. Math. Res. Not. IMRN, (24):7555–7605, 2018.
- Probability on trees and networks, volume 42 of Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, New York, 2016.
- Laurent Saloff-Coste. Lectures on finite Markov chains. In Lectures on probability theory and statistics (Saint-Flour, 1996), volume 1665 of Lecture Notes in Math., pages 301–413. Springer, Berlin, 1997.
- Voter model on heterogeneous graphs. Physical review letters, 94(17):178701, 2005.
- Sara van de Geer. Exponential inequalities for martingales, with application to maximum likelihood estimation for counting processes. The Annals of Statistics, pages 1779–1801, 1995.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.