Minimal spanning trees at the percolation threshold: A numerical calculation

Sean M. Sweeney, Arthur Alan Middleton

Research output: Contribution to journalArticle

5 Citations (Scopus)

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.

Original languageEnglish (US)
Article number032129
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume88
Issue number3
DOIs
StatePublished - Sep 19 2013

Fingerprint

Minimal Spanning Tree
Percolation Threshold
Fractal Dimension
Numerical Calculation
fractals
Correlated Data
Fractal Structure
thresholds
Perturbation Expansion
Minimum Spanning Tree
Robust Methods
Path Length
Prediction
Simulation
perturbation
expansion
predictions
simulation

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Statistics and Probability

Cite this

Minimal spanning trees at the percolation threshold : A numerical calculation. / Sweeney, Sean M.; Middleton, Arthur Alan.

In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, Vol. 88, No. 3, 032129, 19.09.2013.

Research output: Contribution to journalArticle

@article{0eab7b463333400581655f186f81ad27,
title = "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.",
author = "Sweeney, {Sean M.} and Middleton, {Arthur Alan}",
year = "2013",
month = "9",
day = "19",
doi = "10.1103/PhysRevE.88.032129",
language = "English (US)",
volume = "88",
journal = "Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics",
issn = "1063-651X",
publisher = "American Physical Society",
number = "3",

}

TY - JOUR

T1 - Minimal spanning trees at the percolation threshold

T2 - A numerical calculation

AU - Sweeney, Sean M.

AU - Middleton, Arthur Alan

PY - 2013/9/19

Y1 - 2013/9/19

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84885107191&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885107191&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.88.032129

DO - 10.1103/PhysRevE.88.032129

M3 - Article

AN - SCOPUS:84885107191

VL - 88

JO - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

JF - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

SN - 1063-651X

IS - 3

M1 - 032129

ER -