 |
HAL-CNRSCNRS scientific publications |
 |
STOCHASTIC ANALYSIS OF AVERAGE BASED DISTRIBUTED ALGORITHMS
Abstract : We analyse average-based distributed algorithms relying on simple and pairwise random interactions among a large and unknown number of anonymous agents. This allows the characterization of global properties emerging from these local interactions. Agents start with an initial integer value, and at each interaction keep the average integer part of both values as their new value. The convergence occurs when, with high probability, all the agents possess the same value which means that they all know a property of the global system. Using a well chosen stochastic coupling, we improve upon existing results by providing explicit and tight bounds of the convergence time. We apply these general results to both the proportion problem and the system size problem.
Cited literature [10 references]
https://hal-cnrs.archives-ouvertes.fr/hal-02473856
Contributor : Emmanuelle Anceaume <>
Submitted on : Tuesday, February 11, 2020 - 9:00:29 AM
Last modification on : Tuesday, February 25, 2020 - 8:08:10 AM
Contributor : Emmanuelle Anceaume <>
Submitted on : Tuesday, February 11, 2020 - 9:00:29 AM
Last modification on : Tuesday, February 25, 2020 - 8:08:10 AM
File
main_JAP.pdf
Files produced by the author(s)
