Publication View

Processes on Unimodular Random Networks (2007)

Abstract
We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning random walks, percolation, spanning forests, and amenability from the known context of unimodular quasi-transitive graphs to the more general context of unimodular random networks. We give properties of a trace associated to unimodular random networks with applications to stochastic comparison of continuous-time random walk.

Publication details
Download http://www.math.washington.edu/~ejpecp/viewarticle.php?id=1754
Publisher Institute of Mathematical Statistics
Contributors NSF
Repository Electronic Journal of Probability (United States)
Keywords 60C05; 60K99; 05C80; Amenability, equivalence relations, infinite graphs, percolation, quasi-transitive, random walks, transitivity, weak convergence, reversibility, trace, stochastic comparison, spanning forests, sofic groups.
Coverage ; ;