The Dispersion Time of Random Walks on Finite Graphs-Reference-Cited by-同舟云学术

The Dispersion Time of Random Walks on Finite Graphs

Published:2019-06-17 Issue: Volume: Page:
ISSN:
Container-title:The 31st ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Rivera Nicolás¹,Sauerwald Thomas¹,Stauffer Alexandre²,Sylvester John¹

Affiliation:

1. University of Cambridge, Cambridge, United Kingdom

2. University of Bath, Bath, United Kingdom

Funder

Engineering and Physical Sciences Research Council

European Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3323165.3323204

Reference43 articles.

1. Distributed algorithms for QoS load balancing

2. Parallel rotor walks on finite graphs and applications in discrete load balancing

3. David Aldous and James Allen Fill. 2002. Reversible Markov Chains and Random Walks on Graphs. Unfinished monograph recompiled 2014. David Aldous and James Allen Fill. 2002. Reversible Markov Chains and Random Walks on Graphs. Unfinished monograph recompiled 2014.

4. Many Random Walks Are Faster Than One

5. Steve Alpern and Diane J Reyniers. 2002. Spatial dispersion as a dynamic coordination problem. Theory and decision Vol. 53 1 (2002) 29--59. Steve Alpern and Diane J Reyniers. 2002. Spatial dispersion as a dynamic coordination problem. Theory and decision Vol. 53 1 (2002) 29--59.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd;Proceedings of the 25th International Conference on Distributed Computing and Networking;2024-01-04

2. Particle density in diffusion-limited annihilating systems;The Annals of Probability;2023-11-01

3. Diffusion-limited annihilating systems and the increasing convex order;Electronic Journal of Probability;2022-01-01