arXiv (All)
open access
A zero-one law for swap-invariant events in uniform spanning forests
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 fore
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Capacity of a Mixed Multiple-Access Channel with Causal Observation#1037074
- Resilient forest universality in percolated dense graphs#1064471
- Randomized Tree-Intersection Leader Election#441758
- A note on efficient k-limited broadcast domination in graphs#659009
- A note on efficient k-limited broadcast domination in graphs#656873
Record · ID 1155873
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive