The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
type: Item
instance of: scholarly article
title: The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
DOI: 10.1214/22-AOP1581
author: Gábor Pete
author: Ádám Timár
published in: The Annals of Probability
publication date: 2022-10-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/2006.06387
Mathematics Subject Classification ID: 60K35
Mathematics Subject Classification ID: 60B99
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 20P05
Mathematics Subject Classification ID: 37A20
Mathematics Subject Classification ID: 82B27
zbMATH DE Number: 7608250
zbMATH Keywords: Free Uniform Spanning Forest
zbMATH Keywords: nonunimodular transitive graphs
zbMATH Keywords: nonuniversality at criticality
zbMATH Keywords: virtually free groups
zbMATH Keywords: Wilson's algorithm
MaRDI profile type: Publication
cites work: Processes on unimodular random networks
cites work: Connectedness of the free uniform spanning forest as a function of edge weights
cites work: Hyperbolic and parabolic unimodular random maps
cites work: Group cohomology, harmonic functions and the first \(L^ 2\)-Betti number
cites work: Instability of the Liouville property for quasi-isometric graphs and manifolds of polynomial volume growth
cites work: Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
cites work: Loop-erased random walk on a torus in dimensions 4 and above
cites work: Uniform spanning forests
cites work: Cover times, blanket times, and majorizing measures
cites work: Probability
cites work: Gaussian and non-Gaussian random fields associated with Markov processes
cites work: \(\ell^2\) invariants of equivalence relations and groups
cites work: Interlacements and the wired uniform spanning forest
cites work: Indistinguishability of trees in uniform spanning forests
cites work: UNIFORM SPANNING FORESTS OF PLANAR GRAPHS
cites work: Kazhdan groups have cost 1
cites work: Q4595047
cites work: From loop clusters and random interlacements to the free field
cites work: Asymptotic Enumeration of Spanning Trees
cites work: Probability on trees and networks
cites work: Minimal spanning forests
cites work: The components of the wired spanning forest are recurrent
cites work: Evolving sets, mixing and heat kernel bounds
cites work: On non-uniqueness of percolation on nonamenable Cayley graphs
cites work: Nonamenable products are not treeable
cites work: Rough Isometries and Dirichlet Finite Harmonic Functions on Graphs
cites work: Weights of uniform spanning forests on nonunimodular transitive graphs
cites work: A Remark About the Spectral Radius
cites work: Neighboring clusters in Bernoulli percolation
cites work: Indistinguishability of the components of random spanning forests
cites work: Q4228482
cites work: Exponential concentration of cover times
description: scientific article; zbMATH DE number 7608250