Theory of minimum spanning trees. II. Exact graphical methods and perturbation expansion at the percolation threshold

T. S. Jackson and N. Read
Phys. Rev. E 81, 021131 – Published 25 February 2010

Abstract

Continuing the program begun by the authors in a previous paper, we develop an exact low-density expansion for the random minimum spanning tree (MST) on a finite graph and use it to develop a continuum perturbation expansion for the MST on critical percolation clusters in space dimension d. The perturbation expansion is proved to be renormalizable in d=6 dimensions. We consider the fractal dimension Dp of paths on the latter MST; our previous results lead us to predict that Dp=2 for d>dc=6. Using a renormalization-group approach, we confirm the result for d>6 and calculate Dp to first order in ε=6d for d<6 using the connection with critical percolation, with the result Dp=2ε7+O(ε2).

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 29 September 2009

DOI:https://doi.org/10.1103/PhysRevE.81.021131

©2010 American Physical Society

Authors & Affiliations

T. S. Jackson* and N. Read

  • Department of Physics, Yale University, P.O. Box 208120, New Haven, Connecticut 06520-8120, USA

  • *thomas.s.jackson@yale.edu
  • nicholas.read@yale.edu

See Also

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 81, Iss. 2 — February 2010

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×