The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process

DOI10.1145/2933057.2933119zbMath1376.68105arXiv1602.05768OpenAlexW2963680590MaRDI QIDQ5361970

Nicolás Rivera, Tomasz Radzik, Colin Cooper

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.05768

zbMATH Keywords

cover timeepidemic processesrandom processes on graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Network protocols (68M12) Random walks on graphs (05C81) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Phase transition of the 2-choices dynamics on core-periphery networks ⋮ The zealot voter model

This page was built for publication: The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process