Indistinguishability of the components of random spanning forests

DOI10.1214/17-AOP1225zbMath1430.60020arXiv1506.01370MaRDI QIDQ1660632

Ádám Timár

Publication date: 16 August 2018

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

indistinguishabilityuniform spanning forestspanning forestsinsertion toleranceminimal spanning forest

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Percolation (82B43)

Related Items (8)

Indistinguishability of trees in uniform spanning forests ⋮ Indistinguishability of collections of trees in the uniform spanning forest ⋮ Heavy Bernoulli-percolation clusters are indistinguishable ⋮ Interlacements and the wired uniform spanning forest ⋮ The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\) ⋮ Weights of uniform spanning forests on nonunimodular transitive graphs ⋮ The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set ⋮ Connectedness of the free uniform spanning forest as a function of edge weights

Cites Work

• A measurable-group-theoretic solution to von Neumann's problem
• Minimal spanning forests
• Neighboring clusters in Bernoulli percolation
• Ergodic subequivalence relations induced by a Bernoulli action
• Choosing a spanning tree for the integer lattice uniformly
• Group-invariant percolation on graphs
• Stationary measures for random walks in a random environment with random scenery
• Indistinguishability of percolation clusters
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Uniform spanning forests
• Indistinguishability of trees in uniform spanning forests
• Processes on unimodular random networks
• Ends in free minimal spanning forests
• Probability on Trees and Networks

This page was built for publication: Indistinguishability of the components of random spanning forests