Most transient random walks have infinitely many cut times
From MaRDI portal
Publication:6142953
DOI10.1214/23-aop1636arXiv2203.01540OpenAlexW4386745459MaRDI QIDQ6142953
Noah Halberstam, Tom Hutchcroft
Publication date: 23 January 2024
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.01540
Discrete-time Markov processes on general state spaces (60J05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Exchangeability for stochastic processes (60G09) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random walks on disordered media and their scaling limits. École d'Été de Probabilités de Saint-Flour XL -- 2010
- Cutpoints and resistance of random walk paths
- From loop clusters and random interlacements to the free field
- On the number of cutpoints of the transient nearest neighbor random walk on the line
- Random walks on discrete groups: Boundary and entropy
- Intersections of random walks. A direct renormalization approach
- De Finetti's theorem for Markov chains
- Cut times for simple random walk
- Intersections of random walks
- Hausdorff dimension of cut points for Brownian motion
- Poisson boundaries of lamplighter groups: proof of the Kaimanovich-Vershik conjecture
- Recurrence of Markov chain traces
- Recurrence of random walk traces
- Asymptotic entropy and Green speed for random walks on countable groups
- Localization for linearly edge reinforced random walks
- Nonintersection exponents for Brownian paths. II: Estimates and applications to a random fractal
- Probability on Trees and Networks
- Some intersection properties of random walk paths
- The ‘magic formula’ for linearly edge‐reinforced random walks
- A transient Markov chain with finitely many cutpoints
- A counterpart of the Borel-Cantelli lemma
- Cutpoints and Exchangeable Events for Random Walks
- Simulating a diffusion on a graph. Application to reservoir engineering
- Cutpoints of non-homogeneous random walks
- Volume growth and stochastic completeness of graphs
This page was built for publication: Most transient random walks have infinitely many cut times
