Ends in free minimal spanning forests
Ádám Timár
Abstract
We show that for a transitive unimodular graph, the number of ends is the same for every tree of the free minimal spanning forest. This answers a question of Lyons, Peres and Schramm.
Create a lesson
Related papers
Distribution-constrained optimal multiple stopping: the Root-type solution
Shuoqing Deng, Daxin Huang
Universality and sharp thresholds for ellipsoid fitting
Frederic Koehler, Youngtak Sohn
Local Laws and Edge Universality for Noncentral Sample Covariance Matrices
Can Hu, Jiang Hu, Zhidong Bai
Well-posedness and regularity of stochastic heat equations on moving domains
Chongyang Ren, Tusheng Zhang
Traveling Waves in Equity Markets with Rank-Based Entry and Exit
Graeme Baker, Caroline Smyth
An approximate zero bias transformation for random sums: Applications to sampling with outliers, auto insurance, and generative AI
Wasamon Jantai, Nathakhun Wiroonsri