La lecture en ligne est gratuite
Le téléchargement nécessite un accès à la bibliothèque YouScribe
Tout savoir sur nos offres
Télécharger Lire

What is . . .Percolation?

2 pages
WHAT IS...?Percolation?Harry Kesten2Percolation is a simple probabilistic model which v∈Z as the collection of points connected to vexhibits a phase transition (as we explain below). by an open path. The clusters C(v) are the maxi-2The simplest version takes place on Z , which we mal connected components of the collection of2view as a graph with edges between neighboring open edges of Z , and θ(p) is the probability that2vertices. All edges of Z are, independently of eachC(0) is infinite. If pp, then θ(p)> 0 and there is acists an open path, i.e., a path all of whose edges are strictly positive probability that C(0) is, from the origin to the exterior of the square An application of Kolmogorov’s zero-one law shows2S := [−n,n] ?” This question was raised by Broad-n that there is then with probability 1 some infinitebent in 1954 at a symposium on Monte Carlo meth- cluster. In fact, it turns out that there is a uniqueods. It was then taken up by Broadbent and Ham- infinite cluster. Thus, the global behavior of the sys-mersley, who regarded percolation as a model for tem is quite different for p

p.c ca random medium. They interpreted the edges of ...

Voir plus Voir moins

Vous aimerez aussi

? W H A T
I S. . .
Harry Kesten is emeritus professor of mathematics at Cor-nell University. His e-mail address iskesten@math.
site percolation, in contrast to the version we con-sidered so far, and which is calledbond percolation. Initially research concentrated on finding the pre-cise value ofpcfor various graphs. This has not been very successful; one knowspconly for a few planar lattices (e.g.,pc= 1/2for bond percolation 2 onZand for site percolation on the triangular lat-tice). The value ofpcdepends strongly on geo-metric properties ofG. Attention has therefore shifted to questions about the distribution of the number of vertices inC(0)and geometric proper-ties of the open clusters whenpis close topc. It is believed that a number of these properties are universal, that is, they depend only on the dimen-sion ofG, and not on details of its structure. In particular, one wants to study the behavior of various functions aspapproachespc, or as some other parameter tends to infinity, whilepis kept atpc. It is believed that many functions obey so-calledpower laws. For instance, it is believed that the expected number of vertices inC(0), denoted γ byχ(p), behaves like(pcp)asppc, in the sense thatlogχ(p)/log(pcp)γfor a suit-able constantγ. Similarly one believes thatθ(p)be-β haves like(ppc)for someβasppc, or that the probability that there is an open path from0 1to the exterior ofSnforp=pcbehaves liken for someρ. Even though such power laws have been proven only for site percolation on the triangular lattice or on high-dimensional lattices, it is be-lieved that the exponentsβ, γ, ρ, etc. (usually called critical exponents), exist, and in accordance with the universality hypothesis mentioned above depend only on the dimension ofG. For instance, bond and 2 site percolation onZor on the triangular lattice should all have the same exponents. Physicists in-vented the renormalization group to explain and/or prove such power laws and universality, but this has not been made mathematically rigorous for per-colation. d Zfor largedbehaves in many respects like a regular tree, and for percolation on a regular tree one can easily prove power laws and compute the relevant critical exponents. For bond percolation d onZwithd19Hara and Slade succeeded in proving power laws and in showing that the expo-nents agree with those for a regular tree. They have even shown that their theory applies down to d d >6when one adds edges toZbetween any two sites within distanceL0of each other for some L0=L0(d). Due to this theory we have a reasonable under-standing of high-dimensional percolation. In the last few years Lawler, Schramm, Smirnov, and Werner have proven power laws for site percolation on the triangular lattice and confirmed most of the val-ues for the critical exponents conjectured by physi-cists. Their proof rests on Schramm’s invention of the Stochastic Loewner Evolutions or Schramm
Loewner Evolutions (SLE) and(p) .(1,1) on Smirnov’s beautiful proof of the existence and confor-mal invariance properties of certain crossing probabilities. Roughly speaking this says the following: LetDbe a “nice” 2 domain inRand letAandB be two arcs in the boundary. p p O c Forλ >0, letPλ(D, A, B)be the probability forp=pcthat there exists an open path of Figure 1. Graph ofθ. Many aspects site percolation on the trian-of this graph are still conjectural. gular lattice inλDfromλAto λB. In fact it is neater to take Pλ(D, A, B)as the probability at nection inDfromAtoBon( angular lattice. Conformal in Q(D, A, B) :=limλ→∞Pλ(D, A, B) Q(D, A, B) =QΦ(D),Φ(A),Φ(B) mal mapΦfromDontoΦ(D). gredients are characterizatio Werner of some SLE process on of properties of its evolution boundary. Conformal invarian conjectured by physicists, and formula forQ(D, A, B). Smirno orous proof of Cardy’s formula the triangular lattice. Further w Newman (2005)) also has led to limit (in a suitable sense) asλ tern of the random configurati criticality, i.e., forp=pc. Since t processes have led to exciting n ory in their own right, for insta for the intersection probabilitie ian motions (see Lawler (2005)) So far conformal invariance achieved only for site percolat lar lattice. It is perhaps the prin of the subject to prove conforma colation on other two-dimens other related major problem is l a w sa n du n i v e r s a l i t yf o r d-dimensional lattices with2 unsolved problem of fifteen whether there is an infinite op d cal percolation onZ, d3. I thank Geoffrey Grimmett suggestions.
Further Reading [1] FEDERICOCAMIAand CHARLESM. ing limit of two-dimensional arXiv:math.PR/0504036. [2] GEOFFREYGRIMMETT,Percolation, se 1999. [3] GREGORYF. LAWLER,Conformally I the Plane, Amer. Math. Soc., 20
Un pour Un
Permettre à tous d'accéder à la lecture
Pour chaque accès à la bibliothèque, YouScribe donne un accès à une personne dans le besoin