arXiv (All)
open access
On the intersection of pairs of trees
We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson distribution with expected value $2$. This is applied to show a Poisso
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
- Counting tangles in coverings of closed 2-orbifolds via ribbon categories#1049389
- Convergence and compactness of discrete aggregation trees#1070568
- Analysis of push-type epidemic data dissemination in fully connected networks#954728
- Random walk on the small-world network model in 3 or more dimensions#1000029
- Limit Laws of the Iterated Logarithm Under Sub-linear Expectations#926224
Record · ID 987405
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