Stochastic analysis of average-based distributed algorithms

We analyze 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 ea...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of applied probability Vol. 58; no. 2; pp. 394 - 410
Main Authors:	Mocquard, Yves, Robin, Frédérique, Séricola, Bruno, Anceaume, Emmanuelle
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.06.2021 Applied Probability Trust Cambridge University press
Subjects:	Algorithms Computer Science Convergence Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Integers Internet of Things Original Article Population Research Papers Stochastic models Markov chain 60J10 coupling Averaging stochastic process distributed algorithms interacting particle systems 60K35 Coupling Distributed algorithms Interacting particle systems
ISSN:	0021-9002, 1475-6072
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!