Random Walks on the finite Components of random Partial Graphs of Transitive Graphs
نویسنده
چکیده
The expected n-step return-probability EμP [X̂n = o] of a random walk X̂n with symmetric transition probabilities on a random partial graph of a regular graph G of degree δ with transitive automorphism group Aut(G) is considered. The law μ of the random edge-set is assumed to be stationary with respect to some transitive, unimodular subgroup Γ of Aut(G). By the spectral theory of finite random walks, using interlacing techniques, bounds in terms of functionals of the cluster size are obtained:
منابع مشابه
Hitting times for random walks on vertex-transitive graphs
For random walks on finite graphs, we record some equalities, inequalities and limit theorems (as the size of graph tends to infinity) which hold for vertex-transitive graphs but not for general regular graphs. The main result is a sharp condition for asymptotic exponentiality of the hitting time to a single vertex. Another result is a lower bound for the coefficient of variation of hitting tim...
متن کاملRandom Walks on Diestel-leader Graphs
We investigate various features of a quite new family of graphs, introduced as a possible example of vertex-transitive graph not roughly isometric with a Cayley graph of some finitely generated group. We exhibit a natural compactification and study a large class of random walks, proving theorems concerning almost sure convergence to the boundary, a strong law of large numbers and a central limi...
متن کاملHarmonic analysis of finite lamplighter random walks
Recently, several papers have been devoted to the analysis of lamplighter random walks, in particular when the underlying graph is the infinite path Z. In the present paper, we develop a spectral analysis for lamplighter random walks on finite graphs. In the general case, we use the C2-symmetry to reduce the spectral computations to a series of eigenvalue problems on the underlying graph. In th...
متن کاملProcesses on Unimodular Random Networks
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 unimodu...
متن کاملAn interlacing technique for spectra of random walks and its application to finite percolation clusters
A comparison technique for random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the transition matrix other than just the principal eigenvalue. As an application, an upper bound of the expected return probability of a random walk with symmetric transition...
متن کامل