Related Experiment Video
Updated: Jun 14, 2026

Fabrication and Visualization of Capillary Bridges in Slit Pore Geometry
Published on: January 9, 2014
Theory of minimum spanning trees. II. Exact graphical methods and perturbation expansion at the percolation threshold
1Department of Physics, Yale University, PO Box 208120, New Haven, Connecticut 06520-8120, USA. thomas.s.jackson@yale.edu
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 D(p) of paths on the latter MST; our previous results lead us to predict that D(p)=2 for d>d(c)=6 . Using a renormalization-group approach, we confirm the result for d>6 and calculate D(p) to first order in epsilon=6-d for d<6 using the connection with critical percolation, with the result D(p)=2-epsilon/7+O(epsilon(2)) .
Related Concept Videos
Extended Versions of Green’s Theorem
Theorem of Pappus
The Squeeze Theorem
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Divergence and Stokes' Theorems
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
