Pair connectedness and shortest-path scaling in critical percolation

From MaRDI portal
Publication:4947762

DOI10.1088/0305-4470/32/35/301zbMATH Open0938.82024arXivcond-mat/9906309OpenAlexW3104068875WikidataQ56004009 ScholiaQ56004009MaRDI QIDQ4947762FDOQ4947762

P. Grassberger

Publication date: 25 April 2000

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

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 d=2 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.


Full work available at URL: https://arxiv.org/abs/cond-mat/9906309






Cited In (7)


   Recommendations





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)