Related Experiment Video
Updated: Sep 23, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain
Published on: October 13, 2023
Large deviation properties of minimum spanning trees for random graphs
Mahdi Sarikhani1, Alexander K Hartmann2
1Shiraz University, Department of Physics, College of Science, Shiraz, Iran.
Abstract:
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with N nodes. First, we consider complete graphs. Second, we study Erdős-Rényi (ER) random graphs with edge probability p=c/N conditioned on being connected. By using large-deviation Markov-chain sampling, we can obtain the distribution P(W) of the spanning-tree weight W down to probability densities as small as 10^{-300}. For the complete graph, we confirm analytical predictions with respect to the expectation value. For both ensembles, the large-deviation principle is fulfilled. For the connected ER graphs, we observe a remarkable change of the distributions at the value of c=1, which is the percolation threshold for the original ER ensemble.
Related Concept Videos
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Chebyshev's Theorem to Interpret Standard Deviation
Local Maximum and Minimum Values
Variation: Normal Distribution, Range, and Standard Deviation
Estimating Population Mean with Unknown Standard Deviation
William S. Gosset (1876–1937) of the Guinness...
Range Rule of Thumb to Interpret Standard Deviation
For instance, the range rule of thumb can be used to find the tallest and the shortest student in a class, given the mean student height and standard deviation. If the mean student height is 1.6 m and the standard deviation, s is 0.05 m, the height of...