Metraipolis › archive › dc_d9211845fbbb

A zero-one law for swap-invariant events in uniform spanning forests — arXiv:2610.00938

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.00938
License (as archived)
CC0-1.0
Archived
2026-10-06T17:35:32.692Z
SHA-256 of the archived text
b841dc5733db31a1b2af8e41f631d411f65872130dbbefd9bac7fa4e8b094dff
Stable URL of this page
https://metraipolis.com/documento/dc_d9211845fbbb

How to cite

A zero-one law for swap-invariant events in uniform spanning forests — arXiv:2610.00938 — arXiv (en), https://arxiv.org/abs/2610.00938 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d9211845fbbb (Metraipolis archive dc_d9211845fbbb, sha256 b841dc5733db31a1b2af8e41f631d411f65872130dbbefd9bac7fa4e8b094dff)
BibTeX
@misc{dcd9211845fbbb,
  title = {A zero-one law for swap-invariant events in uniform spanning forests — arXiv:2610.00938},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.00938},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d9211845fbbb; sha256 b841dc5733db31a1b2af8e41f631d411f65872130dbbefd9bac7fa4e8b094dff},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.00938. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that every event invariant under swaps has probability zero or one for either the free or the wired spanning forest on any connected, locally finite, infinite network. Applications include the constancy of the number of components and of the total number of excessive ends. For the free forest, these results resolve longstanding questions of Benjamini, Lyons, Peres, and Schramm [Ann. Probab. (2001), Question 15.7] on constancy of the component count and of Lyons, Morris, and Schramm [Electron. J. Probab. (2008), Question 7.7] on the zero-one law for one-endedness. In the latter case, we obtain the stronger conclusion that the total number of excessive ends is deterministic.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.PR).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.00938 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T16:02:27.455Z dalla pagina https://arxiv.org/catchup/math.PR/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).