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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of applied probability Ročník 58; číslo 2; s. 394 - 410
Hlavní autori:	Mocquard, Yves, Robin, Frédérique, Séricola, Bruno, Anceaume, Emmanuelle
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.06.2021 Applied Probability Trust Cambridge University press
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!