Coalescing-branching random walks on graphs-Reference-Cited by-同舟云学术

Coalescing-branching random walks on graphs

Published:2013-07-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
language:
Short-container-title:

Author:

Dutta Chinmoy¹,Pandurangan Gopal²,Rajaraman Rajmohan³,Roche Scott³

Affiliation:

1. Twitter, San Francisco, CA, USA

2. Nanyang Technological University, Singapore, Singapore & Brown University, Providence, RI, USA

3. Northeastern University, Boston, MA, USA

Publisher

ACM

Link

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

Reference44 articles.

1. A stochastic process on the hypercube with applications to peer-to-peer networks

2. Many random walks are faster than one

3. S. R. Arthreya and J. M. Swart. Branching-coalescing particle systems. Probability theory and related fields 131(3):376--414 2005. S. R. Arthreya and J. M. Swart. Branching-coalescing particle systems. Probability theory and related fields 131(3):376--414 2005.

4. I. Benjamini and S. Müller. On the trace of branching random walks. arXiv preprint arXiv:1002.2781 2010. I. Benjamini and S. Müller. On the trace of branching random walks. arXiv preprint arXiv:1002.2781 2010.

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

1. New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs;ACM Transactions on Parallel Computing;2019-12-05

2. Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs;Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures;2017-07-24

3. Theory and Practice of Discrete Interacting Agents Models;Emergent Computation;2016-11-05

4. The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process;Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing;2016-07-25