Pair connectedness and shortest-path scaling in critical percolation
From MaRDI portal
Publication:4947762
Abstract: We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For they clearly disprove a recent conjecture by M. Porto et al., Phys. Rev. {�f E 58}, R5205 (1998). Our data also provide upper bounds on the probability that two near-by points are on different infinite clusters.
Recommendations
- Scaling of the distribution of shortest paths in percolation
- Exact critical exponent for the shortest-path scaling function in percolation
- scientific article; zbMATH DE number 4026521
- On three-point connectivity in two-dimensional percolation
- A critical exponent for shortest-path scaling in continuum percolation
Cited in
(10)- An estimate for the radial chemical distance in \(2d\) critical percolation clusters
- Distribution of backbone mass between non-parallel lines
- Scaling of cluster mass between two lines in 3d percolation
- Connectivity patterns in loop percolation. I: The rationality phenomenon and constant term identities
- Scaling of the distribution of shortest paths in percolation
- Point to point continuum percolation in two dimensions
- scientific article; zbMATH DE number 1559063 (Why is no real title available?)
- Exact critical exponent for the shortest-path scaling function in percolation
- A critical exponent for shortest-path scaling in continuum percolation
- Analysis of a more realistic well representation during secondary recovery in 3-D continuum models
This page was built for publication: Pair connectedness and shortest-path scaling in critical percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4947762)