Peter Grassberger 1999 J. Phys. A: Math. Gen. 32 6233 doi:10.1088/0305-4470/32/35/301
Peter Grassberger
Show affiliationsWe 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 1998 Phys. Rev. E 58 R5205. Our data also provide upper bounds on the probability that two near-by points are on different infinite clusters.
Issue 35 (3 September 1999)
Received 24 June 1999
Peter Grassberger 1999 J. Phys. A: Math. Gen. 32 6233
V H Tran et al 2009 J. Phys.: Condens. Matter 21 485701
P Flesch and M Neiger 2004 J. Phys. D: Appl. Phys. 37 2848
K H Hoffmann and P Salamon 1990 J. Phys. A: Math. Gen. 23 3511
R Fulton et al 2006 J. Phys. B: At. Mol. Opt. Phys. 39 S1097
Michael Pustilnik and Leonid Glazman 2004 J. Phys.: Condens. Matter 16 R513
Marc Pachoud et al 2004 Phys. Med. Biol. 49 5267
Juan J Pérez et al 2004 Phys. Med. Biol. 49 4383
Tat-Leung Yee and Robert Conte 2004 J. Phys. A: Math. Gen. 37 L113
D Haranath et al 2006 J. Phys. D: Appl. Phys. 39 4956