Published September 2015
| Submitted + Published
Journal Article
Open
Collisions of random walks in reversible random graphs
- Creators
-
Hutchcroft, Tom
-
Peres, Yuval
Abstract
We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the Uniform Infinite Planar Triangulation and Quadrangulation and to the Incipient Infinite Cluster in Z².
Additional Information
© 2015 The Author(s). Creative Commons Attribution 3.0 License. Submitted to ECP on May 26, 2015, final version accepted on September 15, 2015. First available in Project Euclid: 7 June 2016. This work was carried out while TH was an intern at Microsoft Research. We thank Itai Benjamini for suggesting this problem, and also thank Lewis Bowen, Perla Sousi and Omer Tamuz for helpful discussions.Attached Files
Published - ECP.v20-4330.pdf
Submitted - 1505.02484.pdf
Files
1505.02484.pdf
Files
(305.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:e6bc52c988489fcc1d97fa617d20d6c9
|
126.5 kB | Preview Download |
|
md5:25363d9ec6f8a2588683fa7f9bed0f59
|
178.9 kB | Preview Download |
Additional details
- Eprint ID
- 111021
- Resolver ID
- CaltechAUTHORS:20210923-215831853
- Microsoft Research
- Created
-
2021-09-27Created from EPrint's datestamp field
- Updated
-
2021-09-27Created from EPrint's last_modified field