Scaling of the distribution of shortest paths in percolation
arXiv:cond-mat/9908435 · doi:10.1023/B:JOSS.0000033244.13545.da
Abstract
We present a scaling hypothesis for the distribution function of the shortest paths connecting any two points on a percolating cluster which accounts for {\it (i)} the effect of the finite size of the system, and {\it (ii)} the dependence of this distribution on the site occupancy probability . We test the hypothesis for the case of two-dimensional percolation.
arXiv comment7 pages, 3 figures
Cited by in corpus (10)
- Flow Between Two Sites on a Percolation Cluster
- Traveling length and minimal traveling time for flow through percolation networks with long-range spatial correlations
- Pair Connectedness and Shortest Path Scaling in Critical Percolation
- Exact critical exponent for the shortest-path scaling function in percolation
- Tomographic-like reconstruction of the percolation cluster as a phase transition
- Possible Connection between the Optimal Path and Flow in Percolation Clusters
- Dependence of Conductance on Percolation Backbone Mass
- Stochastic Renormalization Group in Percolation: I. Fluctuations and Crossover
- Fractal Behavior of the Shortest Path Between Two Lines in Percolation Systems
- Filled Colloidal Gel Rheology: Strengthening, Stiffening, and Tunability