The number of ends in the uniform spanning tree for recurrent unimodular random graphs
type: Item
instance of: scholarly article
title: The number of ends in the uniform spanning tree for recurrent unimodular random graphs
author: Diederik van Engelenburg
author: Tom Hutchcroft
published in: The Annals of Probability
publication date: 2024-11-07T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 60D05
Mathematics Subject Classification ID: 60J45
zbMATH DE Number: 7940221
zbMATH Keywords: reversible random graphs
zbMATH Keywords: uniform spanning tree
zbMATH Keywords: unimodular random graphs
MaRDI profile type: Publication
cites work: Processes on unimodular random networks
cites work: Scaling limits of the three-dimensional uniform spanning tree and associated random walk
cites work: Hyperbolic and parabolic unimodular random maps
cites work: Ergodic theory on stationary random graphs
cites work: Large, lengthy graphs look locally like lines
cites work: Uniform spanning forests
cites work: Recurrence of distributional limits of finite planar graphs
cites work: Harnack inequality and one-endedness of UST on reversible random graphs
cites work: Density and uniqueness in percolation
cites work: BOUNDARY THEORY OF MARKOV PROCESSES (THE DISCRETE CASE)
cites work: On the range of a two-dimensional conditioned simple random walk
cites work: Wired cycle-breaking dynamics for uniform spanning forests
cites work: Interlacements and the wired uniform spanning forest
cites work: Universality of high-dimensional spanning forests and sandpiles
cites work: Indistinguishability of trees in uniform spanning forests
cites work: UNIFORM SPANNING FORESTS OF PLANAR GRAPHS
cites work: Logarithmic corrections to scaling in the four-dimensional uniform spanning tree
cites work: Mean-field avalanche size exponent for sandpiles on Galton-Watson trees
cites work: Q4118602
cites work: Ends in uniform spanning forests
cites work: Probability on trees and networks
cites work: Markov chain intersections and the loop-erased walk
cites work: Choosing a spanning tree for the integer lattice uniformly
cites work: The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
cites work: Transience of conditioned walks on the plane: encounters and speed of escape
cites work: Weights of uniform spanning forests on nonunimodular transitive graphs
cites work: Indistinguishability of the components of random spanning forests
cites work: One-ended spanning trees in amenable unimodular graphs
cites work: Q4228482
cites work: Random Walks on Infinite Graphs and Groups
DOI: 10.1214/24-AOP1682
description: scientific article; zbMATH DE number 7940221