Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
From MaRDI portal
Publication:2447331
DOI10.1214/12-AOP822zbMath1316.60064arXiv1103.4402OpenAlexW3100120030MaRDI QIDQ2447331
Publication date: 25 April 2014
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.4402
bounded degree graphstreessimple random walkcover timesGaussian free fieldsisomorphism theoremsprinkling method
Random fields (60G60) Gaussian processes (60G15) Trees (05C05) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)
Related Items
Maxima of branching random walks with piecewise constant variance, Exceptional points of two-dimensional random walks at multiples of the cover time, Chemical distances for percolation of planar Gaussian free fields and critical random walk loop soups, Tightness for the cover time of the two dimensional sphere, On the Cover Time of the Emerging Giant, Extreme values for two-dimensional discrete Gaussian free field, A limit law for the most favorite point of simple random walk on a regular tree, A sharp estimate for cover times on binary trees, A spectral characterization for concentration of the cover time, Cut-off for lamplighter chains on tori: dimension interpolation and phase transition, A scaling limit for the cover time of the binary tree, The subleading order of two dimensional cover times, Exponential concentration of cover times, Extremes of local times for simple random walks on symmetric trees, Geometric structures of late points of a two-dimensional simple random walk, Geometry of the Gibbs measure for the discrete 2D Gaussian free field with scale-dependent variance, Exponents for the number of pairs of \(\alpha \)-favorite points of a simple random walk in \(\mathbb{Z}^2\), Limit law for the cover time of a random walk on a binary tree, Isomorphism Theorems: Markov Processes, Gaussian Processes and Beyond, On the Cover Time of Dense Graphs, A polynomial time approximation scheme for computing the supremum of Gaussian processes, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
- A sharp estimate for cover times on binary trees
- Cover times, blanket times, and majorizing measures
- Recursions and tightness for the maximum of the discrete, two dimensional Gaussian free field
- Is the critical percolation probability local?
- Regularity of Gaussian processes
- Gaussian and non-Gaussian random fields associated with Markov processes
- Random walk covering of some special trees
- Tightness for a family of recursion equations
- Largest random component of a k-cube
- Sample path properties of the local times of strongly symmetric Markov processes via Gaussian processes
- The electrical resistance of a graph captures its commute and cover times
- Cover times for Brownian motion and random walks in two dimensions
- A Ray-Knight theorem for symmetric Markov processes.
- Entropic repulsion and the maximum of the two-dimensional harmonic crystal.
- Percolation on finite graphs and isoperimetric inequalities.
- Linear cover time is exponentially unlikely
- Minima in branching random walks
- Sojourn times of diffusion processes
- Threshold limits for cover times
- Tightness of the recentered maximum of the two-dimensional discrete Gaussian free field
- Markov processes and random fields
- Maximal displacement of branching brownian motion
- Gaussian Hilbert Spaces
- The Generic Chaining
- Markov Processes, Gaussian Processes, and Local Times
- Random Walks and A Sojourn Density Process of Brownian Motion
- On Unicursal Paths in a Network of Degree 4
- Probability
