Diffusive estimates for random walks on stationary random graphs of polynomial growth
From MaRDI portal
Publication:2364140
DOI10.1007/s00039-017-0411-1zbMath1371.60074arXiv1609.04040OpenAlexW2521274963MaRDI QIDQ2364140
Yuval Peres, James R. Lee, Shirshendu Ganguly
Publication date: 18 July 2017
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.04040
Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Random walks on graphs (05C81)
Related Items
Spectral dimension, Euclidean embeddings, and the metric growth exponent, Chemical subdiffusivity of critical 2D percolation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov type and threshold embeddings
- Ergodic theory on stationary random graphs
- A finitary version of Gromov's polynomial growth theorem.
- Gaussian estimates for Markov chains and random walks on groups
- Disorder, entropy and harmonic functions
- Subdiffusive behavior of random walk on a random cluster
- Symmetric Markov chains in \({\mathbb{Z}}^ 4:\) How fast can they move?
- Markov chains, Riesz transforms and Lipschitz maps
- Decomposition of Dirichlet processes and its applications
- Recurrence of distributional limits of finite planar graphs
- A short proof that a subquadratic isoperimetric inequality implies a linear one
- Optimum bounds for the distributions of martingales in Banach spaces
- Processes on unimodular random networks
- Markov chains in smooth Banach spaces and Gromov-hyperbolic metric spaces
- Measured descent: A new embedding method for finite metrics
- Probability on Trees and Networks
- Symmetric Random Walks on Groups
- A new proof of Gromov’s theorem on groups of polynomial growth
- Random Walks on Infinite Graphs and Groups
- Random walks on random trees
