Published September 13, 2018
| Published + Accepted Version
Journal Article
Open
Coalescing random walk on unimodular graphs
- Creators
- Foxall, Eric
- Hutchcroft, Tom
- Junge, Matthew
Abstract
Coalescing random walk on a unimodular random rooted graph for which the root has finite expected degree visits each site infinitely often almost surely. A corollary is that an opinion in the voter model on such graphs has infinite expected lifetime. Additionally, we deduce an adaptation of our main theorem that holds uniformly for coalescing random walk on finite random unimodular graphs with degree distribution stochastically dominated by a probability measure with finite mean.
Additional Information
© 2018 The Author(s). Creative Commons Attribution 4.0 International License. Received: 6 April 2018; Accepted: 2 May 2018; Published: 2018. First available in Project Euclid: 13 September 2018.Attached Files
Published - 18-ECP136.pdf
Accepted Version - 1701.02653.pdf
Files
18-ECP136.pdf
Files
(395.0 kB)
Name | Size | Download all |
---|---|---|
md5:88da58ce70d25984921356edeeffcc15
|
246.0 kB | Preview Download |
md5:a11f301a5593ea9ad5d67639ffdf80c5
|
149.0 kB | Preview Download |
Additional details
- Alternative title
- Site recurrence for coalescing random walk on unimodular graphs
- Eprint ID
- 111019
- Resolver ID
- CaltechAUTHORS:20210923-184021815
- Created
-
2021-09-23Created from EPrint's datestamp field
- Updated
-
2021-09-23Created from EPrint's last_modified field