CLT for the Weight of the Minimum Spanning Arborescence on the Complete Directed Graph
math.PR, math.CO
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- Oriented Minimum spanning tree looks like the Uniform spanning tree on the complete graph (at least locally)
- Minimal spanning arborescence
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Repeated averaging on random d-regular graphs
- Precise cover times for branching random walks on Hamming graphs: (iterated) logarithmic corrections
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves