Shortest paths in percolation

Barma, M. (1985) Shortest paths in percolation Journal of Physics A: Mathematical and General, 18 (6). L277-L283. ISSN 0305-4470

Full text not available from this repository.

Official URL:

Related URL:


The separation of two points on a percolation network is characterised not only by the distance between them, but also by the length of a path on the network which connects them. The wetting velocity nu provides a measure of the lengths of the shortest connecting paths on the network above the percolation concentration pc. Along the easy axes, nu is expected to vanish as (p-pc)theta near pc, while (1- nu ) is expected to vary as (pd-p)theta' near the directed percolation concentration pd. The exponent theta is related to an exponent nu which characterises the shortest paths precisely at pc, and which has recently been determined numerically. The wetting velocity is calculated analytically on a randomly diluted Bethe lattice, and the values theta =½ and theta'=1 (with logarithmic corrections) are found. The direction dependence of nu is also investigated.

Item Type:Article
Source:Copyright of this article belongs to Institute of Physics.
ID Code:90235
Deposited On:08 May 2012 14:21
Last Modified:08 May 2012 14:21

Repository Staff Only: item control page