Stochastic analysis of average-based distributed algorithms

DOI10.1017/JPR.2020.97MaRDI QIDQ4997195zbMATH OpenOpenAlexFDO

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

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

averaging stochastic processcouplingdistributed algorithmsinteracting particle systemsMarkov chain

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic analysis of some distributed algorithms
• scientific article; zbMATH DE number 125893
• Average and Randomized Complexity of Distributed Problems
• Distributed randomized algorithms for probabilistic performance analysis
• Performance of a Distributed Stochastic Approximation Algorithm
• Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
• Large deviations analysis for distributed algorithms in an ergodic Markovian environment
• Validation of Stochastic Systems
• On Distributed Averaging Algorithms and Quantization Effects
• Distributed algorithms in an ergodic Markovian environment

Cites work

• A dynamic network population model with strategic link formation governed by individual preferences
• A lecture on the averaging process
• Computation in networks of passively mobile finite-state sensors
• Fast and exact majority in population protocols
• scientific article; zbMATH DE number 3892344 (Why is no real title available?)
• Probabilistic Analysis of Rumor-Spreading Time
• Reaching consensus on a connected graph
• Space-optimal proportion consensus with population protocols
• The compulsive gambler process
• The iPod model

Cited in

(7)

• Explicit and tight bounds of the convergence time of average-based population protocols
• Probabilistic analysis of some distributed algorithms
• Distributed Averaging With Random Network Graphs and Noises
• Distributed Averaging Via Lifted Markov Chains
• Noidy conmunixatipn: on the convergence of the averaging population protocol
• Stochastic coalescence in logarithmic time
• Large deviations analysis for distributed algorithms in an ergodic Markovian environment

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

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