Minimal spanning trees at the percolation threshold: a numerical calculation
arXiv:1307.0043 · doi:10.1103/PhysRevE.88.032129
Abstract
The fractal dimension of minimal spanning trees on percolation clusters is estimated for dimensions up to . A robust analysis technique is developed for correlated data, as seen in such trees. This should be a robust method suitable for analyzing a wide array of randomly generated fractal structures. The trees analyzed using these techniques are built using a combination of Prim's and Kruskal's algorithms for finding minimal spanning trees. This combination reduces memory usage and allows for simulation of larger systems than would otherwise be possible. The path length fractal dimension of MSTs on critical percolation clusters is found to be compatible with the predictions of the perturbation expansion developed by T.S.Jackson and N.Read [T.S.Jackson and N.Read, Phys.\ Rev.\ E \textbf{81}, 021131 (2010)].
References in corpus (16)
- On the Number of Incipient Spanning Clusters
- Critical Percolation in High Dimensions
- Aspect-Ratio Scaling and The Stiffness Exponent for Ising Spin Glasses
- Invaded cluster algorithm for equilibrium critical points
- Hysteresis Loop Critical Exponents in 6-Epsilon Dimensions
- Percolation Threshold, Fisher Exponent, and Shortest Path Exponent for 4 and 5 Dimensions
- Winding angle variance of Fortuin-Kasteleyn contours
- Theory of minimum spanning trees I: Mean-field theory and strongly disordered spin-glass model
- Relations between invasion percolation and critical percolation in two dimensions
- Scaling Relations for Watersheds
- Theory of minimum spanning trees II: exact graphical methods and perturbation expansion at the percolation threshold
- Disorder-Induced Topological Defects in a d=2 Elastic Medium at Zero Temperature
- Short-time Dynamic Behaviour of Critical XY Systems
- Limit theorems for 2D invasion percolation
- Exponential growth of ponds in invasion percolation on regular trees
- Elastic lines on splayed columnar defects studied numerically
Cited by in corpus (4)
- Fractal dimension of interfaces in Edwards-Anderson spin glasses for up to six space dimensions
- The Fractal Dimension of Interfaces in Edwards-Anderson and Long-range Ising Spin Glasses: Determining the Applicability of Different Theoretical Descriptions
- Loop erased random walk on percolation cluster: Crossover from Euclidean to fractal geometry
- Large Deviation Properties of Minimum Spanning Trees for Random Graphs