The asynchronous DeGroot dynamics

DOI10.1002/RSA.21248MaRDI QIDQ6641069zbMATH OpenFDO

Authors Dor Elboim, Yuval Peres, Ron Peretz

Publication date 20 November 2024

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/RSA.21248

zbMATH Keywords

random walksfragmentation processDeGroot dynamics

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Infinite graphs (05C63) Random walks on graphs (05C81)

Recommendations

• Brief announcement: Rapid asynchronous plurality consensus
• Convergence rate of the asymmetric Deffuant-Weisbuch dynamics
• Bounds on the Voter Model in Dynamic Networks
• Consensus of interacting particle systems on Erdős-Rényi graphs
• Discordant voting processes on finite graphs

Cites work

• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• scientific article; zbMATH DE number 1069282 (Why is no real title available?)
• A Sharp Bound on the s-Energy and Its Applications to Averaging Systems
• A survey of gossiping and broadcasting in communication networks
• Asymptotic Enumeration of Spanning Trees
• Brownian motion, martingales, and stochastic calculus
• Diffusive clustering in the two dimensional voter model
• Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
• Ergodic theorems for weakly interacting infinite systems and the voter model
• Exponential inequalities for martingales, with application to maximum likelihood estimation for counting processes
• Local asymptotics for controlled martingales
• Localization for controlled random walks and martingales
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Probability on trees and networks
• Reaching a Consensus
• Sensitivity of mixing times in Eulerian digraphs
• Sharp bounds on random walk eigenvalues via spectral embedding
• Towards consensus: some convergence theorems on repeated averaging

Cited in

(1)

• The averaging process on infinite graphs

This page was built for publication: The asynchronous DeGroot dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641069)