Recurrence of Markov chain traces

DOI10.1214/19-AIHP979zbMath1434.60172arXiv1711.03479MaRDI QIDQ2179256

Itai Benjamini, Jonathan Hermon

Publication date: 12 May 2020

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.03479

zbMATH Keywords

capacitytracerecurrence

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Discrete-time Markov processes on general state spaces (60J05)

Related Items (max. 100)

Metastable Markov chains ⋮ Most transient random walks have infinitely many cut times ⋮ A spectral characterization for concentration of the cover time ⋮ Some percolations involving the Gaussian free fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the trace of branching random walks
• Recurrence of the \(\mathbb{Z}^d\)-valued infinite snake via unimodularity
• Cutpoints and resistance of random walk paths
• Cut times for simple random walk
• The components of the wired spanning forest are recurrent
• Crossing estimates and convergence of Dirichlet functions along random walk and diffusion paths
• Recurrence of distributional limits of finite planar graphs
• Recurrence of random walk traces
• A Dirichlet principle for non reversible Markov chains and some recurrence theorems
• Probability on Trees and Networks
• Transient Markov Chains with Stationary Measures
• A transient Markov chain with finitely many cutpoints
• Cutpoints and Exchangeable Events for Random Walks
• An Electric Network for Nonreversible Markov Chains

This page was built for publication: Recurrence of Markov chain traces