Minimal spanning trees at the percolation threshold: a numerical calculation

Abstract

The fractal dimension of minimal spanning trees on percolation clusters is estimated for dimensions $d$ up to $d=5$. 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 $d_s$ 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 (2)

• Winding angle variance of Fortuin-Kasteleyn contours
• 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