Pith. sign in

REVIEW

Probability Distribution of the Shortest Path on the Percolation Cluster, its Backbone and Skeleton

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cond-mat/9904177 v1 pith:K74CCWNE submitted 1999-04-13 cond-mat.stat-mech

classification cond-mat.stat-mech
keywords clusterdistributionpathpercolationproportionalshortestbackbonedmin
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We consider the mean distribution functions Phi(r|l), Phi(B)(r|l), and Phi(S)(r|l), giving the probability that two sites on the incipient percolation cluster, on its backbone and on its skeleton, respectively, connected by a shortest path of length l are separated by an Euclidean distance r. Following a scaling argument due to de Gennes for self-avoiding walks, we derive analytical expressions for the exponents g1=df+dmin-d and g1B=g1S-3dmin-d, which determine the scaling behavior of the distribution functions in the limit x=r/l^(nu) much less than 1, i.e., Phi(r|l) proportional to l^(-(nu)d)x^(g1), Phi(B)(r|l) proportional to l^(-(nu)d)x^(g1B), and Phi(S)(r|l) proportional to l^(-(nu)d)x^(g1S), with nu=1/dmin, where df and dmin are the fractal dimensions of the percolation cluster and the shortest path, respectively. The theoretical predictions for g1, g1B, and g1S are in very good agreement with our numerical results.

Discussion (0). Continue with ORCID to comment.

Pith tools