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 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.









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)