 |
|
|
| | | | | |
|
|
|
|
|
Critical Exponents in Percolation via Lattice Animals
|
Alan Hammond, U.C. Berkeley, USA
|
Abstract
We examine the percolation model on $mathbb{Z}^d$ by an approach
involving lattice animals and their surface-area-to-volume ratio.
For $beta in [0,2(d-1))$, let
$f(beta)$ be the asymptotic exponential rate in the number
of edges of the number of lattice animals containing the origin which
have surface-area-to-volume ratio $beta$. The function $f$ is bounded
above by a function which may be written in an explicit form. For low
values of $beta$ (mbox{$beta leq 1/p_c - 1$}), equality holds, as
originally demonstrated by F.Delyon. For higher values ($beta > 1/p_c
- 1$), the inequality is strict.
We introduce two critical exponents, one of which describes how
quickly $f$ falls away from the explicit form as $beta$ rises from
$1/p_c - 1$, and the second of which describes how large clusters
appear in the marginally subcritical regime of the percolation model.
We demonstrate that the pair of exponents must satisfy certain
inequalities. Other such inequalities yield sufficient
conditions for the absence of an infinite cluster at the critical
value (c.f. cite{techrep}).
The first exponent is related to one of a more conventional nature in
the scaling theory of percolation, that of correlation size. In
deriving this relation, we find that there are two possible
behaviours, depending on the value of the first exponent, for the
typical surface-area-to-volume ratio of an unusually large cluster in
the marginally subcritical regime.
|
Full text: PDF
Pages: 45-59
Published on: March 4, 2005
|
Bibliography
-
Michael Aizenman and Charles M. Newman. Tree graph
inequalities and critical behavior in percolation models.
J. Statist. Phys 36(1-2):107-143, 1984.
Math. Review 86h:82045
-
F. Delyon. Taille, forme et nombre des amas dans les
problemes de percolation. These de 3eme cycle, Universite Pierre et
Marie Curie, Paris, 1980.
-
A. Telcs.
Random walks on graphs, electric networks and fractals.
Prob. Th. Rel. Fields 82 (1989), 435-451.
Math. Review 90h:60065
-
S. Flesia, D.S. Gaunt, C.E. Soteros and
S.G.Whittington. Statistics of collapsing lattice animals.
J. Phys. A 27(17): 5831-5846, 1991.
Math. Review unavailable.
-
Alan Hammond. A lattice animal approach to percolation.
J. Phys. A 27(17): 5831-5846, 1991.
Math. Review unavailable.
-
Harry Kesten and Yu Zhang. The probability of a large
finite cluster in supercritical Bernoulli percolation.
Ann. Probab. 18 (2): 537-555, 1990 .
Math. Review unavailable.
-
Neal Madras. A rigorous bound on the critical exponent for
the number of lattice tress, animals, and polygons.
J. Statist. Phys. 78(3-4): 681-699, 1995..
Math. Review 95m:82076
|
|
|
|
|
|
|
|
| | | | |
Electronic Communications in Probability. ISSN: 1083-589X |
|
Context