Stochastic analysis of average-based distributed algorithms

DOI10.1017/JPR.2020.97zbMath1476.60120OpenAlexW3023278982MaRDI QIDQ4997195

Yves Mocquard, Frédérique Robin, Emmanuelle Anceaume, Bruno Sericola

Publication date: 28 June 2021

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://hal-cnrs.archives-ouvertes.fr/hal-02473856/document

zbMATH Keywords

Markov chaincouplingdistributed algorithmsinteracting particle systemsaveraging stochastic process

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Unnamed Item
• A lecture on the averaging process
• A dynamic network population model with strategic link formation governed by individual preferences
• Computation in networks of passively mobile finite-state sensors
• The compulsive gambler process
• The iPod model
• Fast and Exact Majority in Population Protocols
• Reaching consensus on a connected graph
• Space-Optimal Proportion Consensus with Population Protocols
• Probabilistic Analysis of Rumor-Spreading Time

This page was built for publication: Stochastic analysis of average-based distributed algorithms