Papers
Topics
Authors
Recent
Search
2000 character limit reached

ββ-Skewed Maximal Spanning Forests

Published 10 Sep 2026 in math.PR | (2609.11845v1)

Abstract: The Free w\mathbf{w}-Maximal Spanning Forest (FMaxSF) is a weighted generalization of the classical Free Minimal Spanning Forest (FMSF) that is able to detect nonhyperfiniteness in percolation on nonunimodular graphs. We introduce a parameterized family of invariant random spanning forests that interpolates between these models. For every finite positive value of the parameter ββ, the construction retains many of the desired properties of FMaxSF while also admitting the finite-subtree forcing property of FMSF. We study local limits of these forests and, in particular, show that the small-ββ limit of the wired variant coincides with FMSF if and only if ph=pup_h=p_u, where php_h is the threshold for the existence of heavy clusters and pup_u is the uniqueness threshold for Bernoulli(p)(p) percolation. Finally, we show that the Free and the Wired w\mathbf{w}-Maximal Spanning Forests may coincide even if $p_h<p_u$, providing a negative answer to a question of Terlov and Timár.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.