This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
0 is observed. The numerical error has the effect of a noise and allows us to observe only the four first bifurcations. The associated periodic attractors are labeled from their element nearest to 0, alternatively positive (0 and Bo) and negative (A0 and Co). We construct d1= A0 A1, d2= B0B2, d3= C0C4 and generally dri= 2:0(P0-5 2n - 1(pri); this distance is algebraic and has the sign (-1r Its asymptotic behavior is given by limn ,,,„ d n id n _1=z.(1)= —0, 3995 ... The self-similarity of the bifurcation scheme is expressed on the subtrees [MNP] relating the vertex M to the points N and P: [A0 C2 C6] — A i x [0.130 .132] and [B0C0C4] ,--, .A2 X [A0B2)0B2] where .
160
Dynamical systems and chaos
— If p < pc , then fo has a stable cycle whose period T(fi,), which is equal to 2n if pri_ i < p< p,,„ satisfies the scaling law T(f) (p e — fer" with v= log 2/ log S. Above pc , the attractor of ft, is chaotic for infinitely many values of it, at which it has a structure of T(fti ) bands, We observe an inverse cascade, associated to a sequence (A,,), >no which decreases towards pc , such that at fi n an attractor with 2m -1 bands (for p>11,•,) becomes an attractor with 2' bands. Using the relations L(R f0 )=2444 ) and T(R4 4 ) = P(44 )/2, we can show that ran converges towards pc at the rate 6; we can also analytically prove the validity of the scaling laws L(p.) ,.., (p p c )' and (p — p e r and compute v' = log 2/ log 6 = v. —
<> DETAILS AND COMPLEMENTS: PROPERTIES' " OF THE FIXED POINT ic" OF
R
so is the only non-trivial analytic map whose graph and the graphs of whose iterates (ç0 2n ) n).0 are exactly self-similar near so = 0, with 9(0) = 1; this expresses the invariance Rso= 9o. Using (R90) k = sok with k = r_1, we can show by induction that 4„o2n (0) = An where A = 2 (0)=9(1)< 0. The fixed-point equation R'9o=9:7 can thus be explicitly written c)2f1 (..\ 11 .z)= A" so(x) for all n > 1; it ensures that the graph of SO2n , with abscissa restricted in each direction, coincides with the graph to [HAI", IA11 and dilated by a factor of A of 9p. We do not know the exact expression for 40 but only the first terms of its analytic expansion at s = 0 which, plugged into DR(,), allow us to compute the unstable eigenvalue > 1 and the associated eigenvector, giving the tangent at ça to the unstable manifold V' of R at so. This is how we compute the value 6 = 4,66920 ... The trajectory [so k (0)]k>0 presents remarkable properties of similarity, deduced from the identities (F09a) k = 9o k , from lies in the fact that which we see that 92nk (0) = sok (0). The importance of this function the asymptotic properties of every element f E V ((p) are similar to those of ça due to its convergence towards ça under the action of R.
5.2.2
Self-similarity of the critical attractor
Figure 5.8 explains the symbolic construction of the attractor A, of fpc at the onset of chaos; it displays the structure of a Cantor set, universal since it is identical for all of the stable manifold V (so). Its lacunary structure means that A c the elements has Lebesgue measure zero. The ergodic invariant measure tn, of support A, is thus singular with respect to the Lebesgue measure. A, is not chaotic since the Lyapunov exponent L(f) is zero.
0.
DETAILS AND COMPLEMENTS: CONSTRUCTION OF THE ATTRACTOR
A,
The two numerical methods used to construct the attractor A, are presented in supplement 5A (figures 5A.1 and 5A.2); we give here the analytic proof of its fractal structure. By definition, A c is invariant, closed and indecomposable, it is thus a union of dense trajectories. By passing to the limit p. pc in a subfamily [fp ,ji >0 whose elements have the orbit of so = 0 as their limit cycle, we show that A, contains so = 0, so it also contains its trajectory (sk)k>0 under the action of fpc . A, is constructed by taking the 104 See
Campanino and Epstein [1981], Epstein and Lascoux [1981] and Epstein [1986 ] .
5.2
The period-doubling scenario
161
closure of this trajectory. In particular, it contains the endpoints 5 1 = 1 and s2 = ..1 1,„ of the image f,([ -1 , l])=24 0„ 1]. lf x > 0 denotes its fixed point, foc exchanges [x* , 1 ] and [A, x*], so the iterates of even label are smaller than s * and those of odd label are greater than z * . The critical function foc (at the onset of chaos) belongs to the stable manifold of the renormalization operator R, and it is in the domain of definition of all the iterates and so also in that of [Rn fil ](1) < 0. Consequently, 52 r has the same sign as (-1) 1 . The step-by-step construction of A, is sketched in figure 5.8.
n=
1
2
zo
4
x• 3
4
x* 3
1
thl
n=2
2
6
8 zo
2 10 14
6
8 zo 1612 4
7
5
1
n=3
Figure
x °3 11 16 7
5 13 9
1
5.8 - Symbolic construction of the critical attractor A,
The attractor A, of fp, c and the associated ergodic invariant measure m c are constructed by recursion. The critical point 50 = 0 and thus its trajectory [5k = ft, c (x0)]k>0 belong to A c• At the step n, we construct (in boldface)
r disjoint intervals
1(1»=(erk,x k+2.). They are exchanged by the evolution
4n) ,
since foc [4.°) ] = 421 and f?2,:[.4n) ] = so they are visited with the sa.me frequency by the trajectories and thus they must have the same measure
rn, (4,n) ) = 2—n . the limit A
=
.4n) is replaced by ri(cri+1) U Iin++2 1). A,
At the next step,
is
Un i /In) of this recursive procedure.
=
In figure 5.8 we perceive the lacunary and self-similar structure of A, analogous to the shape of a Cantor set. The analytic determination of the ergodic invariant measure m, describing the asymptotic dynamics of foç is based on a corollary of Birkhoff's ergodic theorem: the measure m(B) of a subset B is equal to the visiting frequency of a trajectory in B. The different intervals [4(n) ] 1
,
and valid for every element of the stable manifold V (9o).
162
Dynamical systems and chaos
5.2.3 R,enormalization analysis
renormalization procedure presented in §2.2.4 is not the only possible one. A first variant 105 uses the operator Ro acting on the elements f of the same space T via [Roflis) = a[f o Asia)] where a = —1/9o(1). This operator Ro has the same fixed points f(x) E- 0, f(x) s and so as R. Its disadvantage is that it depends on the
The
—
unknown coefficient a: a preliminary step must be to prove that there exists a solution of the equation ça= R(p, i.e. a fixed point, and to determine the value = —1/a. The advantage of Rg is that its action on f is simpler, which facilitates its linear analysis and makes it better adapted to the study of the self-similarity properties of the bifurcation scheme. A second variant 106 is based on the similarity of the branches of the bifurcation scheme located closest to x=1. It introduces the operator (Tf)(x)=a7 2 [f o f(a.2f x b1 ) — b 1] where bf >0 is the positive pre-image of 0 (f(bf)= 0) and a3 =1 — b1 . The operator T has fixed points,f(s)E 1, f(X)E x and a hyperbolic fixed point 7,b (different from 0). As above, we could also consider an operator T o where a and b have the (fixed) values associated to the fixed point t,b of T. This renormalization depends on two coefficients a and b, making, it technically more difficult, which is why it was not pursued.
Other universality classes A transition towards chaos by accumulation of period-doublings can also be observed for families which do not satisfy the same regularity properties at x = 0. It is possible to apply the previous analysis by letting the same operator R act in other classes [F,],>0 defined as follows:
{f(x)
F(t) where t =12:11 +' , (f, F) satisfies (i), (ii) and (iii)}
(i) fa 1,1D C [ Li.] with f(0) = I -
—
and 1(1)
E—
(ii) 0 is the only critical point f in [-1, 1] (such that r(0) = 0) ; (iii) f has a negative Schwartzian derivative in [-1,1] — 0. These three properties ensure that, generically speaking, the one-parameter families follow the period-doubling scenario. A typical family of .7; is as 1 plx1 1+ED1
-= 0 where >- is the average 149 over the statistical distribution of the random function qa,r ; this condition expresses the fact that the disorder is statistically isotropic around every point and that it does not induce any favored direction for the diffusion;
(y) q e,,,(.i ,
-
149 We shall also write >- for the average over the statistical distribution of 14,, induced by the distribution of qa,7.
Stochastic diffusion
240
(vii) the condition -<exp[eq„,,, 9,7)]>- < exp [92 ] for every real number 0 implies that -< [qa ,r(i, , 7)] 2 >- < 1 and ensures that the hypothesis of weak disorder is actually
measured by e <eo < 1, since the variance of the random variable p (aOf, 7 kx,-y, r) is uniformly bounded by ( 2 a -21 ; the relevant perturbative parameter is thus E. The random nature of pa(',), does not mean that pa(c),, fluctuates: once the realization T) is chosen, the configuration obtained is fixed throughout the duration of the diffusion of the particle. This implies that we can obtain only statistical information on it; one of the motivations for studying the diffusion in a disordered medium is actually to find out how to relate the observed characteristics of the trajectory of the particle to the unknown statistical characteristics of the disorder present in the medium. The realizations 0,E,?,. are elementary probabilities of transition (t, 9) 1--, 7.i,9,7) in the usual sense, belonging to the function space .11 4,-r) defined by the constraints (ii), (iii) and (iv). The probability distribution of p(a€, ),. is that of the realizations in .TI ci . If (1) is a real functional defined on (e) \ -x(p)›.- is the statistical average of the real random variable Okp-) Fa,r, a,?) the quantity --<(Ys with respect to this distribution. A realization 7-46,), E ..F4,6;- is in general inhomogeneous, so that a trajectory of the particle coming out of = 0 and its translation coming out of = io - are not equiprobable. The meansquare displacement in a given reali2ation Ito.) thus depends on the starting point. However, if the constitution of the material is a priori homogeneous 15° and if the boundary effects can be neglected, the statistics of the disorder can be assumed to be homogeneous. In particular, the elements [(., g- ) 1—, ptc, ), (i , 9, TA and [(a., 9) ---. j4. ),-(.i -I- ao, 9 + 1:1, r)] of .F,V, ,) are equally distributed realizations of p(ac, ),, so that the statistical average --C » recovers the homogeneity of the motion: nr, 0) >-
-e -‹ ad Eue(az)d y 2p(:, )T (0,9,n7)>-
= -=
< /31 (p(at, ), ,
-
nr) .io)>-
/3(p(a% nr)
The "doubly averaged" mean-square displacement (over the steps with probability i, r) and then over the realizations pt. of the disorder) is thus defined without ambiguity since it is no longer random and no longer depends on the starting point.
(>
The analysis via renorrnalization Determining via renormalization which diffusions in an e-disordered medium have normal asymptotic behavior amounts to specifying a set P(f, D0) of random functions, containing the discrete models /-42E, ), whose values a and r are relaied by a2 = Dor , and Markov processes obtained in the continuous limit T --> 0, such that:
FM E P(e, Do)
klirn Rkp ( c) = PD,
almost sure L2 convergence
'In the sense that the inhomogeneities creating the disorder are introduced without bias, and so are homogeneously distributed.
6.2
241
Space time renorrnalization -
oo[ such that for almost every realization i.e. if p(c) E P(c, D0 ), there exists D, fi(f) of p( 0 , the sequence of Markov processes [54(t)1 k >t generated by the families [RkiPlk> i of elementary probabilities of transition, converges in the quadratic mean to the Wiener process with distribution PD,. Taking the limit k oo in the identity D(RkgE), t)=k -2D ( p),k 2 t) gives
lim t -I 73(p(e) ,t)= D(PDe , t = 1) = D E JO, oo[ for almost every realization fP) of 1)( 0 , since the convergence takes place in the quadratic mean. The strength of the renormalization arguments is that they show that the diffusion coeffi cient D,, already identical for almost all the realizations /5(') of p(€), does not even depend on the random function p() belonging to P(E, Do ), but depends only on the degree of the disorder measured by the parameter c and on the (unperturbed) Brownian diffusion coefficient Do. The set 2(e, Do) thus appears as the universality class of the Wiener process PD,. The proof takes up the arguments already used in the construction of the universality class of PD, in the set of deterministic and homogeneous probabilities of transition. We emphasize here the new difficulties related to the a priori inhomogeneous and random character of the elements of P(E, Do ); the main one is the possible presence of "traps", which must be evaluated and whose influence must be restricted by additional hypotheses on 'P(c, Do).
Traps In the case of a diffusion on a lattice (aZ)d, a trap is defined to be a domain A of the lattice which the particle has a finite probability 0(1) of entering during a given time step 7, and a very low probability, bounded by I] < 1, of ever corning out. The existence of traps follows from the asymmetry of the probabilities of transition r) Pa,r (17, r), so indirectly from the inhomogeneity of the medium. Figure 6.1 below shows a trap consisting of two nearest-neighbor sites. The intensity of the trap A can be measured by computing the average number of steps T(A) during which the particle remains trapped in A, knowing that it is there at the initial instant. For the trap of figure 6.1, one shows that:
71 (A) = (1 -
ri if ri < 1
whereas
T(À) = 0(1) if rl = 0(1)
One checks that this order of magnitude T(A) = 0(1 / 77) remains valid for every trap A having no sites in its interior and such that the probabilities of transition associated to the outgoing steps lie between two values on the order of ri < 1. The order of magnitude becomes T(A)= 0( -1 ) if A has interior sites which the particle can only leave by taking at least J steps each having a probability of realization on the order of q<1. To control the slowing induced by the traps and to avoid its certainly destroying the diffusive behavior conjectured in P(c, Do), we must restrict the probability of the trapping realizations of p. by adding the following condition (H):
> 1 large enough I51, p(ae, )i E P(e, Do) -
kin> 0, Prob[p,(, 9, r) < ] <
A
The detailed renormalization computations, based on a perturbative procedure in e, prove a posteriori to be valid when taking A 1/c (Bricmont and Kupiainen [1991]). 151
Stochastic diffusion
242
for every pair 9) of nearest neighbor sites in (aZ) 41 . This condition ensures that the 9) are rare, and the more intense is the trap realizations of p- presenting a trap (i.e. the longer it holds the particle), the rarer they become, so that altogether, the net influence of the traps does not modify the diffusion law.
Trap (asymmetric diffusion) is a The nearest-neighbor pair of points (•) A = , trap if the probabilities of transition satisfy for example (in dimension d): • , y) = M,X) =1– rj , with n < 1 Figure 6.1
Li rt.
7f--7 •
•
p(.i ,
)
-
= i1/(2d— 1), p(g,) = ri/(2d— 1),
• , = pi =
V) = = 0(4 the average number of steps
Starting from t = 0 in A, taken without leaving A is T (A) = (1 – n )/ 1
1/77.
DETAILS AND COMPLEMENTS: INFLUENCE OF THE TRAPS ON THE DIFFUSION
T(A)r during which the diffusing particle remains in a domain A knowing that it is there at t = 0 does not depend on its previous history since its evolution (of elementary time step r) is Markovian. The quantity T(A) is thus a relevant characteristic for measuring the slowing of the diffusion due to the trapping of the particle in A. In order to estimate the influence of traps, we must relate T (A) to the bounds on the probabilities associated to the oriented bonds coming out of the trap A. Let us introduce the conditional probability Qk(A) that the particle has not yet left A after k steps, knowing that it is in A at the initial instant; the probability of leaving the trap in one step at the step k k 1 is Qk(A) – Qk+1(A), so that: 71(.4) = Ek >i k [Q k(A) – Qk+L(A)] = Ek>i Q (A). — The exact computation of Qk (A) is easy for the trap in figure 6.1: since the particle is one of the two sites of A, it has a probability 1 — n of staying there for one more step, so we have Qk(A) = (1 — 77) k and consequently: T (A) -= (1 – .77)/71 vn 1. — If none of the sites of A is internal, i.e. at each of them the particle has a (weak but non-zero) probability bounded below by 1)> 0 and above by n i < 1 of leaving the trap, we The average time
have:
(A) <(1 – 71)k and so 1/171 (1 — n ')/f < T(A) < (1 — TI )/71 1/77. Thus it is not the size of A but the bounds on the barriers of probability delimiting A which determine the average time T(A)r spent in the trap .4. — If A has internal sites, a particle on any one of them has a probability 1 of still being (1 — 7f) k
Qk
A at the next
step, which of course increases the time it passes there. To explicitly estimate this effect of the internal sites and give an upper bound for T(A), the idea is to separate A into concentric layers A = LJ=0A , such that the particle has: a. probability bounded below by 0
—
6.2
243
Space—time renorrnalization
less internal layer .A1-1, —zero probability of passing in one step from A.7 to a layer Ai_k if k> 2, —a. probability greater than no >0 of leaving the external layer Ao, —probabilities 0(1) of taking the inverse path (towards the interior of A). Averaging if necessary the different probabilities of transition over all the sites of their starting layer to obtain uniform values in each layer, we get a linear recursive formula which can be written with matrices as: [C2k+i] -= M[Qd
with
[Qk] =
where Q (kn) is the probability of being in An at the instant k without having left A, (tot) oo, we have Q = knowing that the particle is in A at i = O. Asymptotically as k is the maximal eigenvalue of the matrix M, given by — )? where (1 — n=0 Q k det(M rd + aid)=0 and A<1. If we only want an estimate of A<1, it suffices to solve the relation linearized in A=0. The explicit computation gives: det(M
Id)
= (-0jorion, _11, 1 and
[d(det(M — Id+ Ard))IdA](A=0) =0(1)
which proves the general result T(A) = °([non]. ...m,„_11 -1 ) if A has jo layers. We recover the fact that the average time spent in the trap does not depend on the size of the trap but only on the various lower bounds on the probabilities of sliding along the outgoing paths. Do). Let us This estimate of T(A) justi fi es the hypothesis (H) imposed on p( e) E consider a trajectory generated by a random function p(oe?,- E P(6- , Do) satisfying (H). For every value of 77, each of its N>1. steps has, according to (H), a probability bounded above by 71A of entering into a trap of "intensity" > O. The realizations of the probabilities of transition of different starting sites are independent by (v), so the probability that the particle re-enters a trap of intensity n > 0 is bounded above by Nn A (neglecting the possible correction due to the correlations between the probabilities of the steps coming out of a site visited several times). If the trap has J < Jr. levels of internal sites, it stays there for a number of steps 0(n —J ) during which its displacement is negligible, whereas this duration corresponds in the case of an ideal walk to a mean-square displacement D(rn—J )--, T.Dn —J . This "catching up" must be subtracted from the mean-square displacement of the real walk after being weighted by the probability of entering into a trap: D reai(Nr) DN7 - (1
—
77A—Jmax )
We deduce from this that trapping of the particle does not affect its normal diffusive behavior when A > Jrnaz (here A is the fixed constant in the condition (11)).
Linear analysis of the renorrnalization In the procedure presented above, the fixed point PDE of Rk, selected by the iterated renormalization of the realizations of p(e ) EP(€,D0), depends on an unknown parameter DE , which it is actually one of the goals of this analysis to compute, once the normality of the diffusion is proved. To avoid this unknown quantity appearing in the equations, it is more convenient, in order to obtain conclusions about the
Stochastic diffusion
244
renormalization flow, to linearize Rk around the ideal random walk p(2),. rather than around the continuous fixed point P,51:
= R k p(2),
where p(:),, =
DRk(PV).qa,T ± • •
This linearization coincides with the perturbative analysis with respect to c and is justified by the hypothesis of weak disorder c < co ‹< 1. Since the random walk is Markovian, R k p is entirely specified by its action on the elementary probabilities of transition: Rie p(c,, 7)
k dp(ki,k9,k 2 7)
= kd
E
E (aZ/k) d , 9 E (aZ/k) d
where
—
adue2+1)6( 4 _ki)8(ik 2
II i<j
where ad EÏE(aZ)d
f(i)6(i — 4) = f(o). The linearized operator can be written:
[DRk(p (a°, r) ).q](i, y1 7 ) = = kda2d E
E
, k, (k 2 — n Or)
nr)
q(i, if, 7) pki,
0
a
n steps
ci.\./k 2 k2
—
n
n —
—
1
1 steps
• k9-
The summation is reduced to pairs of nearest neighbors (i, ii) E (aZ) d x (aZ) d , The asymptotic behavior of the linearized flow generated by the renormalization is obtained in the limit as k ---+ 00 (since R7, = Ric .). Since the random function Rkp is defined on (aZ/k) d x (aZ/k)d, the limit k oc if it exists, must be a continuous "doubly" stochastic distribution P: each of its realizations P is the global distribution of probability (i, 9, i) , g, t) of a continuous and stationary spatio—temporal process with values in Rd. ,
6.2
Space-time renorrnalization
245
Convergence results The quadratic mean convergence (as k tends to oo) of the deterministic term Rkp a(c,,) of order 0 to the distribution PD,, of the Wiener process with diffusion coe ffi cient Do = a2 /7 ensures that: hm D(R k p(23.,t k ) = Do = a2 /7
k —*op
where 1 G t k =
< 1 + rk -2
Since the mean-square displacement D is linear with respect to the probability distribution, we can write for each realization it,), of p:
D(Rk115V-r )tk) -= D(Rkie),,tk)+D([Rkft?,
—
RkP (2, ,) ],tk)
Taking the average -< Y over the realizations p-lie,)r and using tk = 1 (since E [1, 1 rildp, it suffices to prove that converges tk to a D([Rkp () Rkp (°) ], t k) ›finite real number 6, to obtain the convergence: urn 131 (1)(at, )T
n co —
nr
nr)
Ern [5(RkPVT
= DE
DID + 6'
We then show that if d> 2 and if c G c o < 1, it does converge and leads to a diffusion coefficient D E = Do+O(c2 ) which is identical for all the random functions p(E) of the set P (c , D0). Under the same conditions, one can show that the sequence RkiP) converges weakly to PD, for almost all realizations j3(E) of any random function p(E) E P(c, D 0 ). In this sense, the limit PD, and the associated asymptotic behavior are universal, of
universality class "P(E, Do). REMARKS AND BIBLIOGRAPHICAL NOTES Historical works on Brownian motion are due to Einstein [1905] [1926] and Perrin [1916] for its physical aspects, and to Levy [1948] and Wiener [1976] for its mathematical formalization . Further important articles on this subject are collected in Wax [1954 ] . For more recent surveys, see Hida [1980] and Knight [1981], Fractional Brownian motion was introduced by Mandelbrot and Van Ness [1968] and by Mandelbrot and Wallis [1968], [1969]. About selfsimilar processes, and more specifically about stable laws and the associated asymptotic properties and limit theorems, we refer to the monograph of Gnedenko and Kolmogorov [1954], to the article by Sinai [1976b] and to the review by Bouchaud and Georges [1990]. Fractal properties of stochastic processes are approached from a mathematical view point in Falconer [1990], On the problems of stochastic diffusion, we cite for example the very complete survey of Havlin and Ben Avraham (1987], or the more accessible one by Bouchaud and Georges [1990 ] ; Gouyet [1992] give a more physical presentation, detailing the fractal characteristics observed. On the more specific question of diffusion in a disordered medium, important results were obtained successively by Sinai [1982], Marinari et al. [1983], Fisher [1984], Dnrett [1986], Bramson and Durett [1988] and Bricmont (1991], The renormalization procedure presented in P.2.5 is drawn from the work of Bricmont and Kupiainen [1990], [1991]; alternative approaches can be found in Shlesinger and Hugues [1981], Luck [1983) or Derrida and Luck [1983].
Supplement 6A Polymer physics The physical study of a polymer charz is closely related to the theory of stochastic processes (chapter 6) if it is described as the trajectory of a random walk, and to statistical mechanics (chapter 4) if it is considered as a set of interacting monomers. The first approach is based on the notions of ideal chains and of self-avoiding (random) walks (§ 6A.2); these latter walks reproduce the critical properties of real chains and renormalization methods can be designed to describe the statistical properties of their configurations (§ 6A.3). In the second approach, the renormalization methods elaborated in statistical mechanics are applied to a phenomenological Hamiltonian of the polymer
(§ 6A.4).
BA..1
Polymer physics
A polymer is a complex molecule made up of identical molecular "patterns" called monomers assembled together. If a monomer establishes chemical bonds only with its two nearest neighbors, the polymer is modeled from a physical point of view by a linear chain whose links are the monomers; moreover, choosing the minimal scale of the description to be greater than the length ao of the monomers, these appear as one-dimensional constituents whose internal structure is imperceptible. Regrouping, if necessary, 'several basic patterns in each elementary link (we still call these elementary links monomers), we can assume that ao is greater than the persistence length of the polymer, Le. the minimal length which two neighboring sections must have in order for there to be no restrictions on their relative orientations, so that any angle can occur between two successive monomers. The number N of monomers considered is always very large, even in this general sense of the Word "monomer" (of the order of 105 for polystyrene). Physicists are first interested in the statistical properties of a chain after it has reached its statistical equilibrium in which the distribution of its configurations no longer depends on time. We shall restrict ourselves here to the situation observed at thermal equilibrium in a solution of polymers which is sufficiently dilute for the mutual influences of chains on each other to be negligible. The search for statistical laws describing the entire chain in the limit N oo means that microscopic details without macroscopic consequences can be ignored, the main emphasis being laid on the universal properties. We can represent flexible polymer chains as trajectories of random walks, and this relates their study to that of diffusion processes; conversely, this modelization gives a physical interpretation to the results obtained for "abstract" random walks. We can also describe these chains as families of interacting subsystems, in thermal equilibrium
Polymer physics
248
at a temperature imposed from outside, so that the statistical formalism of the canonical ensemble is well-suited. This double aspect of polymers means that they lie at a crossing point of various methods, in particular of various renormalization methods, namely those designed to study stochastic processes (§6.2) and those introduced in the framework of statistical mechanics and field theory (§4.3).
8A.2
Polymer chains and random walks
To study of polymers within the formalism of random walks presented in §6.1.3, we label the N monomers i = 1...N in order of succession on the chain. The chain is described' as a broken line whose successive angular points [M o 0 with values in Rd ; the rectilinear realization of a discrete stochastic process segments kij =ii Ti —']i' form the trajectory of the random walk with the successive steps [Ai = Xi — Xi >1 corresponding to the elementary increments of the process [nix). We define two distances between the monomers i and j: their Euclidean distance 1±j in Rd and their chemical distance lj 4, measured along the chain. By hypothesis on the solvent, the distribution of the configurations is homogeneous and isotropic, reflecting the statistical invariance of the polymer under global translations and rotations in Rd . Thus we can fix 5C0 0 almost surely. Since the monomers are identical, it is legitimate in the limit as N co to ignore the particular status of the endpoints and to assume that the distribution of the configurations ]). E Z (where [] €z) is invariant under shifting of the indices j—+ j+ jo , i.e. by translation along the chain. The steps [A]i > 1 are then identically distributed centered random variables, and the correlationdepends only on the chemical distance lj — i. Note that this limit N — > oo appears as a thermodynamic limit (§1.3.3). A study via renormalization of the finite-size corrections, depending on N and due to the presence of these endpoints, is proposed at the end of § 6A.3. We simplify the model by inscribing the chain in a hypercubic lattice (a0Z)d, which restricts the orientations of the steps to the 2d directions of the lattice (figure 6A.1).
The ideal chain model In the above framework, this model assumes that the random variables [AA >1 are independent, i.e. it assimilates the configurations of the polymer to the realizations of a Brownian random walk with values in Rd (see §6.1.1). It is exactly solvable and thus gives a reference analytic description, which we use, for example, as the zero order of perturbative approaches (§6A.4). This model is moreover exact if d > 4 or if the solution of polymers is very concentrated (a "melt" of polymers). We write ao for the root-mean-square length of each of the N steps and we take :?0 a 0 almost surely. The hypothesis of independence of the successive steps is reflected in a remarkable way on the statistical characteristics of the polymer: is2T7 p u to a small ambiguity, since we can associate a monomer to a segment (so a chain
consists of N monomers) or to an angular point (in which case the chain consists of N 1 monomers). The latter point of view is actually better suited for describing the interaction of two monomers via a potential h(ilij (§ 6A.4). The first point of view is better suited to the description of their correlations.
6A.2
249
Polymer chains and random walks
— the mean elongation
<XN> is zero: <XN > = 0;
— the end-to-end distance R(N) =< IPCNi12 >1/2 is given by the relation R(N) = acriff, which is exact for all N;
— the central limit theorem applies to the sequence (111)j >1 and shows that converges almost surely to 0 as N tends to infinity, and its fluctuations around /N gN 0 are Gaussian, of order 0(1/V7V). It follows that the density of probability Piv(f) of the elongation X N of the ideal chain is asymptotically Gaussian, with variance o(2) N; remark that PN(f) is exactly Gaussian (for every N) if the elementary steps already obey Gaussian statistics; since the configurations of the ideal chain are equiprobable, an "inverse microcanonical hypothesis" leads us to take a constant reduced (dimensionless) energy N Le, independent of the configuration; —
— generally speaking, the density of probability PN (f) can be written NN ( ) /MN where Hiv(f)d 4 F- is the number of configurations of endpoints 0 and f' (up to Al among the ArN configurations of N steps. The statistical entropy is defined by SN(f) = log ATN (0 and is related to the thermodynamic entropy by SN(f) = kB SN (F) • The explicit formula SN() = :57 N (0) ± log[PN()1 PN (0 )] , applied to the ideal chain, gives the asymptotic value of its entropy:
5---,N(r) _
SN k (f.
)
d
N (0)
d r2
"N(n\
2R2 (N)
24N
(N oo)
the reduced free energy FN = UN - SN can be deduced from it as follows:
FN (r)
PAT
(0)
dr2 2R2(N)
fIN(0)-F
dr2 2a2N 0
(N --+ oo)
f (f < k E,Tia o ) applied to the endpoints of a chain satisfies the relation: f = [VFN](f = <X N >), which leads in the ideal case to an average elongation given by: < ( N > = fR 2 (N)IkTd, which is linear in f and in N; A weak tension
— the (Euclidean) correlation function gr(i) is defined in the general case to be the probability that there is a monomer at knowing that there is one at = 0; it depends on the modulus r only, by isotropy. Its computation in the ideal case gives gN(r) r2-4 if r < a 0 /V. Its Fourier transform N(q), called the structure factor, then behaves like ip(q) q -2 if qao/i » 1. Note that - 7(4) is proportional to the scattering cross section (for light or neutrons) where _-_- kf - k describes the deviation of the incident ray with wave vector k, , if emerging with wave vector kJ . -
<>
DETAILS AND COMPLEMENTS: THE VALIDITY OF THE IDEAL CHAIN MODEL
The ideal chain is a rather rudimentary model of a single polymer since it neglects the impenetrability of monomers. Overlapping trajectories are present in the model but not in reality, and they bias the results unless their statistical weight is weak enough, in which
Polymer physics
250
case the global statistical properties are not sensitively modified by taking into account the constraint that a monomer should not overlap another. This is the case in the limit oc if the dimension of the space is large enough (d > d, = 4). It is also the case for as N a solution which is very concentrated or for a polymer melt (a "solution" consisting purely of polymers), since then the intertwining of the different polymers causes a screening of the repulsive interactions of a polymer with itself, which thus play only a. negligible role.
••••••• 1011•11••• IMMUNE
111111....11 ER COMM ao
Figure 6A.1 - Self-avoiding random walk
ao is the resolution (i.e. the minimum scale of the description), chosen to be greater than the persistence length of the polymer. (1) the polymer is considered as a broken line made up of N identical segments, identified with the steps of a random walk. (2) it can also be described as an ordered sequence of N+1 points [j]o112 is the root-mean-square distance between the two R =< MN of the endpoints chain; it obeys a scaling law R(N) ao Nu in the limit co. Flory's theory gives N = 3/(d + 2) if d < 4 and recovers the value ii = 1/2 of the ideal chain (Brownian random walk) if d > 4.
The model of the self-avoiding random walk
The hypothesis of independence of the monomers of the ideal chain is often too strong. Taking into account the couplings between the monomers without entering into their detailed modeling, the model of the self-avoiding random walk corresponds to a Brownian walk in which the trajectory is forbidden to pass through a site already
6A.2 Polymer chains and random walks
251
visited. This model is supported by the very short range of the couplings, whose only consequence is to prevent two monomers from being in the same place.
The excluded-volume parameter The preceding model must be supplemented with a quantitative estimation of the impenetrability of the monomers. The classical description, due to Flory and corresponding to a mean-field approach, introduces an internal parameter 14, called the excluded-volume parameter it measures the importance of the repulsive interaction assumed to be identically distributed between all the pairs of monomers sufficiently close to each other in the space Rd . The parameter u has the dimension of a volume and is a statistical characteristic of the polymer; it is given explicitly by u = 2 Eint [cIv Rd(N)] -1 where Éin t is the (dimensionless) total repulsive energy, cN is the quadratic average of the local density of monomers in the ball of radius R(N) and d is the dimension of the space. In a "good solvent", i.e. one which is neutral with respect to the monomers, the monomers feel only their mutual repulsion, and u is maximal (for a given polymer). If a repulsive interaction appears between the monomers and the molecules of the solvent, u decreases until it actually becomes negative in a "bad solvent", where this repulsion is stronger than the repulsion between the monomers. This influence of the solvent can be modeled by an effective interaction, attractive between the monomers whose distance is r E [ro, rib zero if r > r1 and (infinitely) repulsive if r < ro. The passage of u through the value 0, observed for example when thé temperature varies, is called the 6 point of the polymer in solution; starting from this transition point, u is negative and the polymer can fold over onto itself entirely (De Gennes [1975], De Queiroz [1989]). Consequently, we consider only the case where u is strictly positive.
<> DETAILS AND COMPLEMENTS: FLORY'S SCALING RELATION R(N) N' In Flory's theory, the reduced free energy 1.- 4N of a chain of N monomers is obtained by adding to the free energy of the ideal chain the total reduced repulsive energy Zti n t taking into account the average effect of the couplings. This quantity is given by ki n t = WagC 2 Rd 12 as a function of the reduced (dimensionless) excluded volume parameter w au and of the still unknown end-to-end distance R. The main approximation (of mean-field type) is the identi fication of c2N with the square of the mean density of monomers in the sphere of radius R, i.e. -
cls 30c (F) >
laN
A
.;
oc()R —d dd 17,
<
> 2 = R -2d N 2
r
r
J r
The free energy of the ideal chain is approximated by Fr dR2 /2N4, up to an additive constant. Minimizing the sum FN = R2 iNc1/42) wagN 2 R—d with respect to R (for fixed N and Iv) leads for d < 4 to the result:
R N (
)
ao tv
Il(d+ 2 )Nv —
where
v
3 d+2
(d < 4)
If d > 4, this value R(N) maximizes FN, so it is not what we want. We expect the minimum to occur for R(N) > aol5 since the couplings added to the ideal chain (for taking into
Polymer physics
252
account the non-overlapping constraint) are repulsive; this bound on R(N) shows that if d > 4, the repulsive couplings only cause a weak perturbation of the total free energy acV/T1 (provided of the ideal chain and do not modify the ideal scaling law R(N) of this approach is correct). The major drawback that the approximations used above are that it ignores correlations between the elementary couplings and a for on their possible collective behavior; when these correlations play an essential role, other methods, for example renormalization, become necessary.
Critical aspects of real polymer chains Real polymer chains are generally very different from the ideal situation; their convoluted shape can make points of arbitrarily distant labels (i, j) actually be very close and thus strongly correlated. The statistical correlation < A14 > no longer decreases to 0 as the chemical distance lj —il tends to infinity. This critical characteristic is well reproduced by a self-avoiding random walk (where the chemical distance is interpreted as the walking time). Indeed, it is time-correlated and the temporal range of the correlations diverges; it represents the motion of a particle having an infinite memory, i.e. remembering all of its former positions. Studying just a piece does not suffice to describe and understand the structure of the whole chain: only a global vision makes sense here. This likely critical characteristic motivates us to seek asymptotic scaling laws (in the limit as N co) for the different statistical quantities of the chain, i.e. the end-to-end distance R(N), the probability density PN(f), the correlation function g N (F) and the structure factor iN(4). For example, Flory's theory gives the leading asymptotic behavior R(N) aoNv with y = 3/(d + 2) for d < 4 and I/ = 1/2 if d > 4; this latter value v = 1/2 supports the validity of the model of the ideal chain in dimension d > 4. Flory's law also gives < 11.gN/N11 2 > the quantity j-C N /N still converges to 0 in the quadratic mean whenever d > 1, but its fluctuations around 0, of order N— ( 1- - "), are more dispersed than in the case of the ideal chain if d < 4.
0, DETAILS AND COMPLEMENTS: CONNECTEDNESS
CONSTANT AND EXPONENT
7
To better describe the critical aspects of a random walk, we construct for z > 1 the generating function G(z) EZ =0 A1N z —N , formally analogous to the partition functions used for phase transitions: the role of the energy levels is played by the number N of monomers and the role of the inverse temperature /3 by log z. Assuming that all the admissible con fi gurations of N steps are equiprobable, their number )1/-N is the degeneracy of each "level' N. The fact that G(z) is decreasing and the boundary values G(z =1) = +cc and G(z = oc) = 0 ensure that there exists a unique threshold value 1 < z c < oo such that G(z) < ao if z > zc and below which G(z) diverges. The value z, is called the connectedness constant of the chain; it describes the asymptotic behavior of Ariv via the limit lim JVN/N1 = z c >
N—. co
Thus, z, > 1 can be interpreted as the asymptotic mean number of admissible orientations possible at each step. One then shows that the divergence of G at z = ZG obeys the scaling taw
G(z)
(z — ze ) Y
6A.2 —
ArN =
Polymer chains and random walks
253
For an ideal chain on a lattice where each site has m nearest neighbors, we have m N and zc = rra; the exponent takes the "normal" value y = 1.
— A self-avoiding chain does not overlap itself, which removes at least one of the m possible directions on the lattice; we have Ariv < M(M — O N-1 , SO z1 < rn — 1. One shows z eN which agrees with G(z) (z — z,) -1 if z is near ze ; that asymptotically, JVN "-0 the exponent y depends only on the dimension d. The proof of the scaling law satisfied by G uses a geometric renormalization which also applies in the study of percolation (§7A.3). Its principle is to interpolate the admissible configurations of the random walk by broken lines of Nlk macrosteps each made of k successive elementary steps (for fixed k > 2) (figure 6A.2). The essential stage is the description of the admissible configurations of a macrostep and of the constraints imposed on their assembling; for example they must be self-avoiding. They should make the set of the possible configurations of the chain of macrosteps as similar as possible (up to a change in the size by a factor of k) to the set of the admissible configurations of the initiai chain. The generating function G(z) = E [2) z N P)) of the initial chain, where the
N(v)
sum is over all the admissible configurations [i..] with steps, is suitable for taking a partial trace, after which the summation is over the configurations of the renormalized chain (made of macrosteps); G is thus related to the generating function RkG of this chain. The determination of the fixed points and eigenvalues of this operation Rk enables one to prove the scaling law G(z) (z, — 2) - 1 and yields the values of z, and of 7.
The various characteristic lengths of a polymer In conclusion, let us note that it is important to distinguish carefully between:
— The range ro of the physical interactions between the monomers: measured in terms of Euclidean distance, this length is very short, on the same order as the length a o of a monomer, whether the chain is almost ideal or on the contrary critical. The model of the self-avoiding random walk reproduces via a purely geometrical constraint the effect of a "hard-sphere" potential describing the infinitely repulsive contact interaction of two impenetrable and undeformable spheres of radius r o /2: V(r) = +oo if r < ro
V(r) = 0 if r> ro
The statistical correlation length j along the chain: this curvilinear distance, measured by following the labeling, is a statistical quantity, defined to be the characteristic length of the statistical correlation of the steps i and
ci
>
j. It gives the order of magnitude of the number of monomers (counted along the chain) whose position and orientation depend on those of a given initial monomer. If we consider the chain as the realization of a random walk, j is the temporal correlation range between the increments. The divergence j co expresses the critical character of the chain.
— The Euclidean statistical correlation length defined to be the characteristic length of the pair-correlation function gN (F.), it gives the order of magnitude of the Euclidean size of a segment consisting of j monomers, so it diverges with J.
Polymer physics
254 6A.3
Geometric renormalization methods
The critical nature of a polymer is not a consequence of the form or of the (always very short) range of the interactions between the monomers, but of the organization of these interactions, revealed by the divergence of the Euclidean and curvilinear range of the statistical correlations. This organization is ignored in Flory's theory, which takes into account the binary couplings but not the correlations between them, and one thinks naturally of using renormalization tools to analyze its consequences on the overall scale of the chain. It turns out that renormalization can be applied within a global statistical description, without its being necessary to perform a detailed analysis 153 of the contributions of the couplings in the different configurations of the chain. Its principle is to account for the effect of the correlations existing between larger and larger groups of monomers into a modification of the statistical parameters, in successive stages. We present two typical renormalization models, which via iterations bring the extreme cases of quasi-ideal chains and self-avoiding chains back to solvable models.
Renomalization of a quasi-ideal chain For a quasi ideal chain, for which the statistical correlations between its N monomers remain in the short curvilinear range J < N, renormalization reduces the apparent range of these correlations and brings us back to the situation of an ideal chain. This is done by replacing the initial chain by a chain of N I k macromers of curvilinear extent k » J, sufficiently large for them to be considered as statistically independent; then we express their average size b (or their variance b2 ) as a function of the length an of the monomers and of the correlations eliminated from their explicit description. The gain in this procedure is the independence of the obtained "macromers", which allows us, for example, to make use of the relation b \tic. The renormalization amounts to a change in the minimal scale of the R(N) description: at the resolution b instead of a o , the polymer appears as an ideal chain. -
<> DETAILS AND COMPLEMENTS: SOME TECHNICAL DETAILS The end-to-end distance of a chain (1-1.0 1
EE<
Aie i=1
where C1 -E-<
N-1
>=
i=1 :7=1
E
(N—i/DC,
1=1—N
> depends only on the chemical distance I. One shows that: liM
N
R2 (N) N
+00
+ 00
Ci
b(2)
whenever
E1Cd< oo
—00
This result makes the term "quasi ideal more precise: it can be applied to any chain whose statistical properties are invariant under index shifting and whose correlations are summable. borN is then asymptotically satisfied as N co. The value bo The scaling law R(N) -
' 53 Although this is the approach considered in § 6A.4.
6A.3
Geometric renormalization methods
255
appears as the effective length of a monomer, once the effect of the statistical correlations is o since the repulsive taken into account; it is greater than the real average length ao = N/Gr the characteristic scale of interactions between monomers tend to "unfold' the chain. If j is the correlation function 1 l''' Ch the sections made of k >> j monomers can be considered to be statistically independent. Indeed, their correlation is zero if they are not consecutive; if they are, then it is bounded independently of k since it involves only the segments of length j situated at their endpoints: its relative value is negligible if k is large enough. These sections, of average size b = bo jc, form the elementary segments of the renormalized ideal chain replacing the initial quasi-ideal chain.
o
10
Figure 6A-2 - Renormalization for polymers The basic principle, comparable to the method of spin blocks (§ 4.3.1), is the construction of macromers of k monomers (here k = 2) forming an effective polymer which is simpler to analyze. The diagram represents two successive decimations. They are supplemented by a transformation of the parameters of the chain. The renormalization is iterated until a fixed point is reached, or at least a situation whose statistical properties are more suitable for computations, for example perturbative ones. It reveals the self-similarity of the chain and the scaling laws satisfied by its statistical characteristics. If the chain is quasi-ideal, renormalization brings us back to the situation in which the macromers are statistically independent and form an ideal chain. If the chain is self-avoiding, the renormalization can be made explicit as a transformation of the average size a of a monomer and the excluded-volume parameter u; it leads to a non-trivial fixed point if d < 4 OT to the ideal-chain model if d > 4.
Numerical approach to renormahzation The numerical implementation of renormalization consists in randomly constructing a large number of admissible configurations of the real chain, of No monomers of average size al) , then performing the geometric renormalization illustrated in figure 6A.2. The statistical analysis of the decimated configurations gives straightforwardly
256
Polymer physics
the average size a l of the N1 = No/k macromers. The advantage of this method is that one constructs the transformation ao a l without having to explicitly perform the partial summation of the correlations, which avoids the error caused by the fact that these sums can be expressed as functions of the effective parameters only in an approximate manner. The fact that renormalization preserves the end-to-end distance R enables us to deduce u from the knowledge of ,j,,„x successive iterations =No k -i, ai)j<j,.n .,, for je and n such that n j o <jm , the exponent I) is given by: log(ajo /ao)
Or
jolOgk
u=
log(an+io/aio) n log k.
Testing the independence of I) with respect to jo and n in the second expression proves the validity of the scaling law and ensures that the asymptotic regime is reached after less than jû iterations.
Renormahzation of a critical chain The typical configurations of a critical chain present numerous /oops. Here we consider renormalization in the framework of the global statistical description of the chain, where the interactions between the N monomers of average size a are described only by the excluded volume parameter u. Renormalization transforms the parameters a and w va -d , by integrating the effect of the statistical correlations into them. Once we have chosen a decimation factor k, the renormalization Rk transforms the triple (N, a, w) into (N1 , a i , w i ) or N1 = N/k, where a l is the average size of a macromer and v i = w i g. is the excluded-volume parameter of the renormalized chain. The value of a l takes into account the correlations between the monomers inside a given macromer, whereas that of w I depends on the correlations between distinct macromers. R.k can be written: -
= NI k = aVrc [1+Ak(W)] wk 2— ( d 1 2 ) — Wk(W)] a? = coj is the size of a macromer in an ideal chain. If w > 0, the repulsive interaction (depending on w) between its k monomers tends to "unfold" it, which is reflected in the factor [1 + Ak (w)] correcting a? in al , where Ak > 0 if w >0; if w =0, we recover the ideal case, so Ak(w----.0) = 0; v i is an effective parameter measuring the overall energy of interaction when it is equally distributed among all the pairs of nearby ( in real space) macromers. It thus implicitly takes into account the organization of the couplings between the monomers of two interacting macromers. In Flory's theory, the interaction of two macromers involves k 2 pairs of monomers assumed to be equivalent and independent, which gives =k 2 u. However, the macromers are deformed by their mutual repulsion: the number of pairs effectively interacting decreases, which is reproduced by the factor [1- Wk (w)] correcting ta? in u l , with Wk > 0 if w >0; moreover Wk (w= 0) = O.
6A.3
Geometric renormalization methods
257
The molecular study gives access to the real microscopic couplings between the monomers, which allows one to compute (at least numerically using molecular dynamics methods) the functions Ak and Wk if k is chosen small enough. Iterating nk generates a sequence (Nj , ai, wi ) i >0 . A qualitative argument suggests the existence of a non-trivial fixed point for certain very convoluted polymers, called the "blob model" (the typical example is given by polyelectrolytes, i.e. polymers whose monomers are ions): the molecular structure and the functions Ak and Wk deduced from it ensure in this case that the macromers of sufficiently large order j > jo are voluminous enough in Rd to behave like hard spheres: t varies as al, so wi =taia.T d tends to a finite limit w*, which is a solution of
ws k2-(d12) [1
—
Wk(W * A =
<=>.
ID *
= 0 i.e. Wk (W * ) = 1 - 0 -4) / 2
Since Wk> 0 as w >0 and k> 2, there exists no non-trivial fixed point (w* > 0) unless d < 4. Identifying w2 with w* is legitimate for j > J large enough, in which case the renormalization equation for a simplifies to: ai +i = ai \rk: [1 + Ak,(w")] = rkai
where rk = \ifc11.
Ak (1.0 * )] >
The sequence (a)>i is thus asymptotically geometric; this result expresses the selfsimilarity of the chain at large scales I> aj >a0 0 2 . To explicitly determine the scaling law satisfied by the end-to-end distance R(N,a,w) as N tends to infinity, we use the fact that it is preserved by Rk and can be written in the form R(N, a, w) a 0(N, w). Asymptotically, ai +1 — rkai and wi +i wi w*, so that Ri = R)+1 can be written rk0*(Ni lk)=0*(Ni ) where 0* (N)E 0(N, w*), from which we deduce that:
0*(1V) N'
where
is =
log rk, log k
R(N,a,w) , aj (N1C -J )" ac(k, w)N v
where c(k, w) is independent of a and N. The renormalization analysis, here supplemented by a molecular study, thus proves the scaling law R aN' which is valid for every a and w if N is large enough, and it also gives the value of the exponent is. If d> 4, the only fixed point is w* = 0, corresponding to an ideal chain: we recover the result stating that all chains are ideal in dimension d > 4 (r = Vi does imply that is = 1/2). The quasi-ideal chains are the chains with Wk 0: renormalization makes their parameter w tend to w* = O. In that case, the parameter w appears as an inessential quantity, which a posteriori justifies the renormalization of quasi-ideal chains presented at the beginning of this paragraph and acting only on the average size a of the monomers. In this procedure, w* =0 implies that rk =Vii, which confirms that the quasi-ideal chains belong to the universality class of the ideal chain; this result is quite satisfying physically since we showed earlier that the two models can describe the same polymer at different scales. The existence of a critical dimension d, = 4 above which the solution is known enables one to consider using perturbative methods in order to solve the situations d < d,, the (small) adequate parameter then being e = d, d = 4 — d. —
258
Polymer physics
DETAILS AND COMPLEMENTS: FINITE-SIZE EFFECTS IN THE FREE ENERGY
The existence of -a fixed point w* of R. allows one to describe the dependence of the reduced free energy F(No, wo) on the number No of monomers of the chain, in particular the distorsion stemming from the particular environment of the endpoint monomers. Writing for the middle of the j-th segment, .-FI(No, wo) can be written:
F(No ,wo ) = — log f
.1 e -1."'0. - 0 (21— zwo ) ddii
, , 2 N0 ) is the reduced effective Hamiltonian of the chain in a where 7-1No , w ,3 configuration ...4/0 ), depending on the parameters No and W. When No is a multiple of k, the decimation is reali7ed by constructing N1 = No/k macromers made up of k successive segments and centered at the centers of mass itivi ) of these k-tuples. The transformation of the associated excluded-volume parameter is the component wo w1 of P. The transformation of F is obtained via a partiai integration eliminating the variables iivo ) describing the No monomers and replacing them with the variables (i ll ) the N, describing macromers. To this effect, we insert: —
H
E
_ k-1
j=1
ik j+g iddifi z
0
into the integrand of .frI(No, wo) and exchange the integrations, keeping those over (VI ...40 and integrating the ones over „ Without needing to explicitly perform the computation, which avoids knowing the Hamiltonian 71 explicitly, we obtain a relation of the form:
F'(Aro,wo) — P(Ari,w,)
No
(k 1) f(wo) - g(w o ).
g(wo) is a contribution related to the particular status of the endpoints, so independent of N. The other term follows from integrating over (k 1) degrees of freedom in each of the NI. = No/k macromers; f(wo) would be constant in the ideal case. Like the functions Ak and Wk above, f and g can be deduced from a microscopic analysis or from numerical simulations based on molecular dynamics. Starting from a value No = 10) °, we can iterate the renormalization Te,k jo times. If No is large enough, we can assume that the fixed point w* is reached after J < jo renormalizations and neglect the transient steps j < J; using k -2 te— i° = (k the approximation 1) -1 this gives a relation showing that the effects of the endpoints increase with N as log N: -
-
(No , w o)
P(N
,
= 1, w*) N f ( w* )
lologgN: g(wt)
6i1.4 6A.4
Polymers in statistical mechanics
259
Polymers in statistical mechanics
Taking the repulsive interactions between the N monomers of a linear polymer into account via the excluded-volume parameter u and the average size a of a monomer appears as a "mean-field" approach, since u is defined from overall statistical properties of the chain. The major drawback of this model is the global and deternunzstie nature of the parameters and a: they do not vary along the chain or with the configuration of the chain, and this is noticeably different from the situation in which we have a real self-avoiding constraint. The analyses given in the two preceding paragraphs, even those improved by renormalization, do not give any role to the loops and to the possible inhomogeneities of the spatial distribution of the monomers, To obtain better statistical predictions, it is necessary to describe the couplings between the monomers by modeling their interaction potential. This second approach formally resembles the situations encountered in statistical mechanics in the study of critical phase transitions. The study of the statistical properties of polymers, or more generally of random walks, is now based on the computation of the probability density PN (i) of one of its endpoints N = i knowing that the other is at .1 0 O. The initial step is to express PN(i) as a path integral whose integrand involves a phenomenological Hamiltonian locally reproducing the self-avoiding constraint; the integration "variable'" is the path ±(t) describing the configuration in the real space R d after a continuous extension of the discrete description (i;i)0
DETAILS AND COMPLEMENTS: EXPLICIT COMPUTATIONS As in the case of spin lattices, the discrete configurations (ii)0
In fact it is a function ±(0); for more details on path integrals, see Schulinan [1981] or Kleinert [1990 155 See 4.3.2 or Ma [1976 . 156 See for example de Gennes [1974 154
].
]
260
Polymer physics gives the probability density Po(i, 7):
P0(,
(11)0(Ali T) =
=
Pl
dI 2
d
exp
271-Dr
z2d -- ) 2DT
In order to reproduce the self-avoiding constraint and also any possible influence of the solvent, we introduce an effective (dimensionless) Hamiltonian H([il, 7), appearing in a "Boltzmann factor' exp[— H([], 7)] weighting the elementary probability dPo( 7) of the Brownian random walk in order to give that of the self-avoiding walk, denoted by dP( 7 ):
7) = e -11([47) dP0( [i]
dP([i] The conditional probability
P(, r) is thus expressed as a 11 "'7) dP0(ki
P(2, 7) =
Li, 7)
path integral: (with i(7) =
7)
[t ]
The statistical hypotheses on the polymer lead us to choose
([4
r
7) = fo di
f
t h(1*(t)— x(s)II)ds —
1 — 2
H([], T) of the
form:
fo fo /1(11s(t) — s(s) I ndi-ds T
The phenomenological homogeneous and isotropic potential h(r) is chosen with very shortrange To, so that h(11± — gH) is zero unless i and 9 are very close, separated by a distance smaller than ro; we speak of a (point of) contact of the chain with itself. Expanding the Boltzmann factor as a series transforms P(i, 7) into a sum of contributions [in (i, T)] n >o, where h(i , r) = P0 (2 , 7) and the (In)n>1 are given by:
ln(i, 7)/07. ..fordt i dsi •-• dP0( [i] h is the term of order 0 since it would coincide with P(2, T) if no constraint were imposed on ;421 +1
the chain. The term In describes the correction with respect to the statistics Po of a Brownian walk, due to configurations having exactly n points of contact. We change the labeling of Sn) into an increasing sequence 0 < 01 < ...< 02 n < r and set each (2n)-tuple (t1, s 1 , . . = ±(9j), with the convention that o=O and 92,2 +1= i. The (2n +2)-tuple is fixed, so that we can exchange the tinte integrations and the path integration on the subset consisting of the continuous trajectories [t] which interpolate the 2n + 2 positions )i=0...2n+2 in this order. This stage is essential since taking the path integral on this subset first involves a discrete Brownian ra,ndom walk on each interval 10j, 9, +1], where it gives the OA. It remains only to perform the time integrations and contribution Po(i +1 — 27L : one spatial (no longer functional) integration over the 2n variables
(-1r f 'I
r
n• j Jo * • *
2n
2n
f(9 ... 9 2n)
=
.
where f is given by:
f01 • - • Oan }del • - • d92, 1
ddYj 1=1
_
91 + 1 - 91)
H 41=1
0( 2k ) fl,
▪
6A.4
Polymers in statistical mechanics
261
writing rfo for the permutation transforming Pi function f(O i ...02n ) satisfies: for ... for
fo i
=1...2n into (t 1 , sl, . ,
t
,
Every
02rode1 . de2n =
do„ Jo
d92 J.:, do,
1
where the sum is over the set 82 n of (2n)! permutations of {1, 2, ..., 2n}. The time integration can thus be restricted to the ordered (2n)-tuples. The integrand f here has a particular form, since it must be invariant under the permutations exchanging 2j and 2j -I- 1 and also under those exchanging the pairs (2j, 2j + 1) and (2k, 2k + 1); the set of these permutations and of their products forms a. class SI, of order (2n0. The integration then involves as many distinct terms as there are permutations in the quotient S2,/SL, i.e. distinct terms in the factor (E, Es„, ...). Each term appears with the multiplicity (2n n!). A diagrammatic analysis helps to compute P(i, r) by graphically representing the various contributions, thus making it easier to count and estimate them. For all j E {1,2 ...2n}, and 'jr_+,1 are joined by a line corresponding to the factor Po(pi + i — yi 3 Oi+i — 95); each factor h(lIgi — is represented graphically by a "bridge" between gi and The number n of contributions h determines the order n of the diagram and indicates in which term In it appears: (-1)I is the sum of the contributions of the distinct diagrams of order n, each counted exactly once. An example is shown in figure 6A.3.
•
•
•
_• • • N_•••• • " •• • • • •
• 1
•
•
92
Figure 6 A.3
•
I
93
■■■
•••••••■■
•
94
- Diagrammatic analysis
The integrand in the contribution represented by the graph (with go = 0, .1 and 9i E Rd ) is given by
Po(Yi+i —
93 )
0<j<4 It contributes to
P(, r), in 12, 04
d04
Jo
after integrating (0 < 91 < ...< 04 < 7)
02 d03 1 163 c 92if del f
ll d'i ldd92dd 9.3dd 94
Polymer physics
262
In the case of a self-avoiding random walk, we observe that the graphs produced by this analysis are identical to those coming from an n-vector Landau—Ginzburg model with n = O. This correspondence enables us to straightforwardly transpose the results and methods associated with this model to polymers, and in particular the renormalization techniques used in conjugate space to achieve the explicit computation if the expansion above does not converge fast enough. Let us give some of the results obtained in this way; their statement b) of P(i, t), given by: involves the Fourier—Laplace transform
cm,
e — bi 13 (, t)dt
b) = Iff , dd el"
Using renormalization arguments analogous to those explained in chapter 4, that there exists a critical value b such that:
Q( q= 0 , b) lb b,) q1-2
(if lb— (if q
one can show
6,1 0)
which we regroup into a universal scaling law:
Q(4, h)
Q[(g(b)) -1 ]
where
e(b) ,-,
bc i —v
0 and The function Q(z) is analytic with respect to its real argument z; it is non-zero at z must behave like Q(z) .z 1-2 at infinity, which leads to the conjecture that 7 = (71 2). —
In the case of a Brownian random walk, the explicit computation is possible and gives:
(2,0,0 = [b + q2 D/2dr 1
SO
4- (b) 2 D /2bd
The critical value of the parameter is b, = 0, and the exponents have the values 7 = 1, = 0, v = 1/2, satisfying the conjecture y = v(t) — 2). In the general case (non-zero Hamiltonian), returning to real space—time enables one to deduce the behavior of P in the limit z oc, t oo from the behavior of Q as q —} 0 , lb — bcl Ch
P(Zt —v )
P(.ï, t) =
V', where in Thus the characteristic length of the random walk under consideration is e can also show general y differs from the value v = 1/2 obtained for a Brownia.n walk. One that the probability P(= 0, t) that the trajectory passes again through its starting point, satisfies a scaling law:
=
t a-2
(t >
Just as in statistical mechanics, there exists a critical dimension (here d,= 4) above which the mean-field approach is valid and leads to "normal" values for the exponents y, r?, ti and i;e; which coincide with those obtained for a Brownian random walk. For d < 4, these exponents can be given explicitly as a perturbative series in powers of c = 4 — d. Knowing P (i , t) gives the reduced entropy:
t) =
=
t)
log[P(i, t)IP(i
0,0]
— With no self-avoiding constraint, all the configurations have the same reduced energy U0; the presence of this constraint means that it is necessary to take into account the additional
6A.4
Polymers in statistical mechanics
263
H ([i5], t) coining from the repulsive interaction between the monomers for each configuration [4, so that the internal energy can be written: reduced energy
Ci (i, t ) We then deduce
=— f [r ]
d P( [
] I i , T ) [ rfo + 11 ( [ ±], t ) I
the reduced free energy: P(i, t) = 0 - (i, t)
—
(i, t).
o
REMARKS AND BIBLIOGRAPHICAL NOTES
The basics of polymer physics can be found in Flory [1969], [19711. For the description of the scaling properties of polymers, the fundamental reference is De Gennes [1984]; he explains certain "geometric" renormalization techniques introduced in §6A.3. The "Hamiltonian" renorrnalization presented in §6A.4 by analogy with the renormalization of spin systems is detailed in Ma [1976]; the use of diagrammatic methods in this context is treated in Kleinert [1990]. Specific references about the Flory exponent /./ are Cotton [1980] for its experimental evidence and Le Guillou and Zinn-Justin for its computation using fieldtheoretic renormalization methods. On the simulation of polymers via the Monte Carlo method, we refer to Brender et al. [1983] or Sokal [1989 ] for basics and statistical foundations, Kremer and Binder [1988 ] for lattice simulations and Leontidis et al. [1995] for simulations in the continuum. Des Cloizea-ax [1975], De Gennes [1975 ] and De Queiroz [1989] consider the so-called "0 point" transition. Standard real-space renormalization for polymers is presented in Maritan et al. [1989]. Some extensions of renormalization are suggested in Family [1984 ] , Oono [1985], Jug [1987] or, for the study of branched polymers or gels, in Stanley et al. [1982] and Duplantier [1986].
Fractal structures A book about fractals would deal with most of the topics where we have already encountered renormalization, merely because the physical principles underlying the presence of fractal structures are the same ones which make renormalization methods work. The essential notions of scaling laws and of scale invariance, of self-similarity and of universality appear in both situations (§ 7.1). A fractal structure is a visual rendering of the characteristics ensuring that renormalization methods are relevant for the analysis of the system in which it appears; the expression of its self-similarity guides the choice of the formalism and the construction of the renormalization operator. This chapter continues with the study of fractal measures; their local singularities can be hierarchically described by their dimension spectrum, determined by multifractal analysis, or revealed by renormalization analysis (§ 7.2). The chapter ends with an introduction to the wavelet transform: this local spectral decomposition is based on the scaling properties of the objects analyzed, so that it is natural to consider its relations with renormalization. The notions of measure theory used in this chapter are recalled in appendix 1.
7.1 7.1.1
Fractal geometry Critical aspects of fractal structures
Fractal geometry and renormalization share a common physical framework: the class of critical phenomena. Indeed, these phenomena are revealed by the appearance of spatial or temporal fractal structures, whose presence gives a. sure and simple clue to the adequacy of a renormalization analysis. Indeed, by definition, fractals have a structure which is self-similar on every scale in the sense that the characteristics on the scale i can be deduced from those on the scale 12 by a dilation. Fractals give a concrete form to the scale invariance on which the construction of a renormalization operator adapted to a given system is based. They provide visual examples of collective critical behavior, relating very different scales within a self-similar hierarchical organization: they are critical objects in the sense that they have no characteristic scale. A new kind of geometry is necessary to study fractals, because the usual tools of description and measurement are inadequate: for example the length of a fractal curve depends on thc resolution (minimal scale of the steps) with which it is observed (figures 7.1 and 7,2). Fractal geometry provides a guantitatzve description of the self similar structure of the phenomenon, by introducing various scaling laws whose exponents are related to -
Fractal structures
266
the fractal dimensions, generalizing the Euclidean notion of dimension to non-integral values (which become integers when the fractal is trivial). Renormalization methods provide a natural way to determine these dimensions and to describe their universality.
DETAILS AND COMPLEMENTS: LOCAL AND GLOBAL STRUCTURES In a real scale-invariant system S, typically a critical system, we must distinguish two "nested" structures with very different properties: local structure (or pattern); it does not present any critical characteristic; it is specific to the system and depends heavily on the details of the interactions and of the physical mechanisms involved; —
the small-scale
— the global self-similar structure, which reflects the existence of a collective, coherent and hierarchical organization of the elementary constituents of S; this is the backbone of the critical phenomenon. It is related to the nature of the statistical correlations (3.2.1) and does not depend on the specific details of the short-range physical couplings, hence it is not very sensitive to perturbations. It typically presents fractal characteristics, related to the critical properties of S. To describe the system completely (globally and on every scale), it suffices to know these two aspects, i.e. the small-scale patterns and the hierarchical structure according to which they are assembled. We will be most concerned with the global structure, because of its universality, its robustness and its physical role in the overall behavior; indeed it is the global structure which ensures the transfer of information:
— from small scales to larger ones: a perturbation of the basic pattern is sent by repercussion up through all the higher scales "along the global structure"; — from large scales to smaller ones: we observe an immediate adaptability to even sudden changes of boundary conditions or sharp variations of some global parameters; stabilization occurs thanks to the appearance of additional levels in the hierarchical structure. The robustness of such a mechanism explains the abundance of fractal structures in natural phenomena, in particular those which obey strong constraints simultaneously on small scales (internal constraints related to microscopic mechanisms) and on macroscopic scales (constraints imposed by the exterior environment). The global hierarchical structure of a fractal object is revealed by the action of scale transformations, appearing as adapted renormalization operators: consequently we will be able to deduce quantitative results on the nature of the collective organization, independently of the details of the local patterns.
Mathematical fractals The notion of fractal is only well-defined for mathematical fractals c Rd,which are sets of points generated by a specific algorithm or by an explicit definition. The simplest example is the dyadic Cantor set illustrated below (figure 7.1). Many other fractals can be constructed via, recursive procedures; they are lacunary if we dig holes in the basic pattern (as in the Cantor set) or on the contrary convoluted and intertwined if we complicate it (curve or Koch flake, figure 7.2, Von Koch [1904]). Other examples are Julia sets (Julia [1918], Douady [1986]), defined as the boundaries of basins of attraction of the fixed points of discrete evolutions (§ 5.1.1), attractors of chaotic
7.1
Fractal geometry
267
dynamical systems (§ 5.2,2) or the Mandelbrot set 157 related to asymptotic properties z2 c (in the complex plane C). of z
Step 0 Step 1 Step 2 Step 3
=I
MI
i■
i■
■
■
MN
MI
Step 4
• •
• •
• •
• 1
• Ir
••
••
• •
Step 5
1111
1111
1111
II II
II II
II II
IP I!
PI !I
Figure 7.1 - A lacunary fractal: the Cantor set
We start with Co = [0, 1]. At the rt-th step, we split each of the N„ = segments of length a, = 3' which make up C, into three equal parts; we eliminate the N, central segments to obtain C,+1. The iteration to infinity gives the Cantor set,: Coo
= ni-« iim ct, co
n >0
Cn
C,„, perceived with the resolution a, coincides with C. The length of Cn is L n Arn ct,= (2/3) n , equal to its Lebesgue measure mgC,), which proves that rrtL(Coo ) = O. The similarity dimension Ds is defined by: N(ka) = k -D IV (a n ) hence
D5 =
(if k = 3 -i)
log /V, log 2 = <1 — log a n log 3
Ds
( 0 /a9 1-1s L(d) since L(a)
L, = a
D s. We obtain a dimension of mass equal to Ds according to the scale invariance: mass ( n Co, 2 mass ( [0, 3 - " 1 1 n c,0 ). ).
157 The Mandelbrot set is the set of parameters cEC having the following property: the set of points whose trajectories under the action of z'-+ z2 c do not go to infinity is connected (Mandelbrot [1080], Douady 1 1986]).
Fractal structures
268
We say that Y is self-similar if, for certain values k > 1, the structure k..F obtained via an isotropic dilation of F of factor k consists of k D s disjoint parts which can be deduced from Y. by a similarity (i.e., a composition of translations, rotations and symmetries). This property requires a structure on every scale in F which must thus extend or become subdivided at infinity. The exponent Ds > 0 is called the similarity dimension of f; it coincides with d for a Euclidean structure of dimension d (for example a hypercube) which is trivially self-similar, This type of "ideal" fractal structure can be interpreted as a fixed point of a geometric renormalization whose operators [Rdk are exactly the dilations relating Y. to the kDs components of k.,F. When .1 appears in the model of a real system, the renormalization should be supplemented by a transformation of the physical parameters and of the mechanisms generating this structure, ,
0 (1)A
Generator:
Figure 7.2 - A convoluted fractal: the Koch flake The Koch flake 100 is constructed starting with an equilateral triangle ..T0 of edge ao, The generator of the recursion transforms a segment of length a into a broken line made of 4 segments of length a/3. At the n-th step, the flake F,, made of Arr, 3 x 4" segments of length a, = 3 -n a 0 , has length L r, =(4/ 3)n Lo ; this length diverges for n —too, so that is not a rectifiable curve. Locally, F, is made similar to by a dilation of factor 3 and possibly also a rotation and a translation; Y is thus exactly self-. similar and its similarity dimension Ds = (log N„)/(— loga n ) is equal to Ds .= log 4/ log 3, which is also equal to its dimension of mass. Ds > el =1 reflects the fact that this curve is convoluted, obtained by complexifying a basic Euclidean pattern of dimension d= 1; a consequence of this is the growth of the length L(a) of F as the minimum scale a of the observation decreases: L(k a) = ki-Ds L( a) (for k _ 3-j).
7.1 Fractal geometry
7.1.2
269
Real inhomogeneous fractals
Unlike the mathematical fractal defined analytically as a set of points of Rd, the "real" fractals obtained as results of experiments or of numerical simulations are defined with a minimal scale a (for example the resolution of the picture, the step of the numerical simulation or the sensitivity of the measuring apparatus). They thus appear as a union Ya of disjoint cells of volume ad. Such a discrete structure F can be said to be fractal if it is scale invariant in one of two following senses 158 (for fixed a): 1) in a glollal sense if the number N (a, r) of cells of a tiling of side r necessary to cover Ta scales as N (a , r) s r - D1( 4 ). In general, N(a, r) must be averaged over the various possible tilings, translated by A± where 11,6■ 11 r). The quantity N(a, r) decreases as r increases, so the real number Di (a) is positive; it is called the covering dimension of Ta or its capacity. It is a global fractal dimension of Fa , smaller than d since N(a,r/k)< kd N(a,r). It describes the dependence with respect to the linear scale r> a at which the d-volume V(a, r) of Y„ is measured; this apparent volume is then equal to V(a, r) = rdN(a, r d-131 (a). It increases with r except when D I (a) = d, in which case ,F„ is Euclidean. Its lower bound is V (a, r = a), and is reached when the covering coincides with Fa. in a local sense if the number n(a, r, 13 ) of disjoint elementary cells of _Ta contained in the ball of radius r and center ±13 scales as n(a, r, o) (ofvlumead) 1),(a,e ; in general we need to smooth out this quantity n(a, r, .io) by a local average over Zo in a ball of radius ro:z.dd a. The real number D2 (a, i.o) lies between 0 and d since < kdn(a, r, 0) ; it is called the local fractal dimension at o of .F,, n(a, kr, 2)
In these two qualitative definitions, the symbol • means the existence of a linear part' in the graph of — log N or log n as a function of log r between the values r,„ > a and rMr > rro bounding the scales at which the structure Fa is perceived as fractal; the slopes are D 1 (a) and D2(a, (:)) respectively. For k varying between suitable bounds at fixed a and r, we have N (a, kr) D '(a) iV (a , r) and n(a, kr, i;) ) kp 2 (a i'°) n(a, r, 0). The two dimensions D i (a) and D2(a, io) are, by their very definition, experimentally accessible. Note that these graphs must be smooth at scales Ar < a to erase the discontinuities due to the discrete character of Ta ; at scales r < a, at which the structure of la is by definition that of the balls of Rd , their slope is d. In the zone r > rm, their slope again has an integral value do (independent of o E .7, if this fractal is homogeneous): we speak of a fractal curve if do = 1, of a fractal surface if do = 2, and so on. The fractal is called lacunary if Di (a) < d o , and convoluted if D 1 (a)> do ; its fractal character is imperceptible if D 1 (a) = do . The fractal .Ta is homogeneous if and only if D2 (a, i o ) is independent of E Ta . In this case, the product N (a, r)n(a, r, 1=p) is approximately equal (for all o E to the number Ara = N (a , r = a) of cells a d making up .Fa ; thus it is independent of r, which we use the distance "sup" in Rd given by d(x,y) = supi
Fractal structures
270
implies that the two dimensions D1 (a) = D2 (a) are equal, If .Ta becomes homogeneous on a scale ro < rm , the number of cells of Fa is the same in each cell rg of a covering of Fa , and so is equal to the spatial average < n(a, r, 0) >spat over the centers of the cells a d making up T. We can then write .Afa = N(a,r) < n(a, r, i o ) >; the concavity of the logarithm ensures that < n(a, r, io) > > r, and we deduce from this that DI (a) > < D2 (a) >. In conclusion, we point out that the fractal properties of a natural structure are defined only approximately, locally and in a domain of scales which is bounded above and below; moreover, they are generally only statistical properties, which become observable and well-defined only by averaging over different subdivisions, for the global quantities such as N(a, r), or over different centers for the local quantities such as
n(a, r, ,t 0 ).
Self similarity of a real fractal structure -
By varying the scale a chosen for defining the fractal object, we obtain a family [Fa]. This family is said to be:
1) globally self similar if N(ka,kr) r) for all k such that r and kr are in the adequate domain of scales. The exponent a can be interpreted as a large-scale similarity dzmension of the fractal: .F„, dilated by a factor of k and covered by N(a,r) cells of radius kr, is identical to the union of k' parts similar to .Tk a , each covered by N(ka, kr)= N (a, r) cells of radius kr . -
2) locally self similar if n(ka,kr, o )R J n(a,r,o) when k varies between suitable bounds (for a, r and o fixed). -
-
These notions of self-similarity are easily adapted to experimental check. If the dimensions are well-defined, we have the equivalences:
1) [Fa] 0 globally self-similar .4=> Di(a) = a independent of a. Indeed, plugging the definition of D1 into the relation of global self-similarity, we obtain N(ka, kr) k' N(a, r) k' r-D i(a) from which we deduce that: Di (ka) 2) [Ta ] , locally self-similar D2(a, io) independent of a. Indeed: n(ka, kr, o) kp,(ka,to n ia, r/k, "aj o ) by definition of D2 (ka, o ) and then kp3 (ka''On(ka, r, by self-similarity. We also have n(ka, kr, i;o ) n(a, r, k,D2 ( a>o)n(a, r/k., la ) by first making use of the self-similarity. Comparison of the two expressions gives D2(ka, io) = D2 (a,i 0 ). The self-similarity is important as it makes Di(a) (or D2(a, i. 0)) appear as a quantity independent of the scale a at which the fractal is constructed, therefore intrinsic to the physical system in which it occurs. In this case, one can express the dependence of N (a, r) and n(a, r, (:)) not only with respect to the resolution r of the analysis but also with respect to the resolution a of the definition:
7.2
Fractal measures
271
1) The relation N(ka,kr) ,--, k'N(a,r) , k -D IN(ka, r), deduced from the global self-similarity and from the definition of D I , shows that N (a , r) no longer depends on a since D 1 = a. (r/a)D2(0) where ra(ka, r, i 0 ) 2) We write ra(a, r ) i; 0 ) n(a ) r/k, ()) by self-similarity). (since n(ka, r, .i0)
k -D2 ('Û)n(a, r,
A mathematical fractal .F0 appears as an ideal structure, defined at the scale a = O. The family [yd a where F is a covering of .F0 by cells of volume a d tends to the limit Y0 as a tends to O. The exact self-similarity of Y0 implies the exact self-similarity of the family [Yak both locally and globally. The covering of Fa by cells of side r coincides with Fr so that N(a,r)-= N(0, r); consequently, the covering dimension D i of a > 0 and coincides with the similarity dimension D s of Y0 . isndept
More complex fractal structures Among the extensions of the notion of fractal, let us draw attention to: nested fractals, for which the covering dimension depends on the scale r of log N(F, r), we thus observe breakpoints of the the analysis. In the graph of log r slope at r / . rm , so we obtain a different dimension in each domain [ri, rj + i] of scales. Thus, a global vision of F is filtered by the choice of the scale r of the analysis, and the resulting situation can be said to be plurifractal. —
— inhomogeneous fractals, where the local fractal dimension D(x) depends on the point x but varies continuously with x; such a structure requires local analyses (such as renormalization or wavelet transforms, — superimposed fractals, where the local fractal dimension D(x) depends on the point in a very irregular way: for each value D, Ix , D(x) = D} is a very lacunary fractal set. Multifractal analysis was designed in order to describe for each value of D its intertwined fractal distribution in the x-space; it gives a global but filtered vision, since it describes only the points x with a given singularity D(x) = D (§ 7.2).
7.2 Fractal measures 7.2.1
Local dimension and dimension spectrum
In this paragraph we consider the fractal analysis of Borel measures on Rd when they are more complex than the measures dm() = pMdd defined by a density pW > 0 which is regular on Rd . The first extension is to the situation where a density p can be defined but may not be regular; an example is p(x)-= ixi - (0 < a < 1) on [ 1, 1]. In a more general case, the support of rn can be lacunary (fractal), and even the notion of density disappears. We define the local dimension of Tn, at by: -
.
I1M r—p 0
1o g(rn(B[:C,r)]) log r
D(m,
- m
Fractal structures
272
r1) (rn'') for r small enough. rritB( , r)] is increasing with respect to r in such a way that D(rn, ±) > O. If drnW = p(i)d' (where 0 < p(±) < co) then D(m, i) d.
Qualitatively, we write m[B(i• , r)]
m has a singularity at ±o if D(rra, 4) < d: visually, this corresponds to the presence of a localized mass at 4. If p(,) — xoII - where 0 < a < d, then = d — < d but D(rn, .i) = d if ± D(m, ±0. A limiting example is an atomic , where D(rn, 0 ) E 0 and D(rn, = oo (if ± measure drra(i) = (5(i — 3 0). a d> d; generally, (a > 0) then D(m, c)) — Conversely, if p(±) ^d D(rri, > d reveals a lacunary measure at 40 . The local dimension D(m, ia) is thus an exponent which quantifies the singularity of m at 4; the singularity becomes stronger as D(m, c)) tends to O. D(m,.i0 ) = d if In has a density p (0 < p < oo) in the neighborhood of 4 whereas D(m, 4) =-- oo if does not belong to the support of m. DETAILS AND COMPLEMENTS: EXAMPLES OF FRACTAL MEASURES — On a real fractal .Fa defined as a union of cells a d , the measures rn a are entirely defined (on the discrete a-algebra generated by the cells a d ) by the weight of each cell. A uniform measure will describe only the geometric aspects of Ta ; an inhomogeneous measure, giving different weights to the different cells, can also describe dynamic aspects (for instance the visiting frequency of the cell or the reactivity of a site). The local dimension is only
log ma [B(± 0 , r)]; empirically defined, as the slope of the linear part of the graph log r the local dimension D(rna , 4) coincides with the local dimension D 2 (a , ±0) of ,Ta if m a The family [(1-a , m a )] >.0 is said to begives the same weight to all the cells ad of consistent if for a' > a, Ya , (a' > a) is the covering of 1a by cells (d) d and if m a , is the restriction of m a to the coarser cr-algebra generated by the cells (al d ; in this case, the limit mo of the sequence [rn a] a> 0 when a tends to 0 is a fractal measure, of support Fa equal to the intersection of the sets [Zs]a>0• — A class of fractal measures is obtained by modeling on the construction of the Cantor C]O, 1! to the set and either keeping a symmetric dyadic iteration but giving a weight left-hand part (coded by c = 0) and a. weight 1— to the Tight-hand part (coded by E = 1). At the n-th step, the interval coded ci , E n will have a weight:
Tnn([6 1 • • En]) =
[6,(1 — o)+ (1— c.7 )t31
a ([0,1 ] ) = 1
1<j
or by keeping a uniform weighting giving a measure 2 — n to each interval of the Cantor set of order n, but making an uneven subdivision of the intervals tx,s --= [x, s + ay] U -fy] (a 1/3, b 1/3). Among the 2' intervals of Cri , ay, X + (1 — b)yi U [a; + (1 — b)y, 614 have length ai — Physical examples are the local (volume) density of a porous material or the local surface density of a deposit. — In the strictest sense, the adjective "fractal" is used to designate a measure m which is invariant a.nd ergodic with respect to an evolution when its local dimension (still called the information dimension, and mpalmost everywhere constant by ergodicity), is strictly less than the covering dimension of its support (or capacity). This situation reveals the lacunary nature of the attractor of the evolution and is typically encountered in chaotic dynamical systems. (.>
7.2 Fractal measures
273
The example dm() = reveals the absence of regularity of the local dimension D(m,i;) with respect to For a more general measure m, and for each real number D > 0, we can define the set ED = {±, D(711., Z) D} of points where the singularity of the measure rn has exponent D. These sets are in general irregular, lacunary and very intertwined with each other, so that their measuretheoretic description gives only trivial information. This is, for example, the case if m is an invariant and ergodic measure with respect to an evolution, with local dimension constant rn-almost everywhere, equal to D,: we have rn(ED,n ) = 1 and m(ED) = 0 if D Dm , which is not helpful. Thus, it is in fact the fractal properties of the sets ,FE:D .ID >0 which must be studied as functions of D to obtain a description of the singularities of ni and of their spatial distribution. The tool for realizing this global and hierarchical description of m is the dimension spectrum which associates to each possible local exponent D the fractal covering dimension f(D) of ED; note that it does not directly describe the fractal properties of rn or of its support but rather those of the sets in which rn has a given local dimension. Concretely, we subdivide the support of m into cells of side a and write ii(a, D)dD for the number of cells such that the local fractal dimension of the measure at their centers lie between D and D dl); then
f(D)
log v(a, D) a—>ID —
log a
or more qualitatively
v(a, D)
f (19)
For each singularity of rri, the dimension spectrum gives a quantitative characteristic describing the lacunary nature of the set of points where such a singularity is observed; the smaller the value of f(D), the more lacunary the set of points. Let us remark that the dimension spectrum plays the same role with respect to the measure ni as the critical exponents which are used to classify critical phenomena.
7.2.2 Multifractal analysis The goal of multifracial analysis of a measure m of support contained in a compact subset X of Rd of diameter L is to determine its dimension spectrum'' a 1. f(a), describing the spatial distribution of its local dimensions a > 0, by relating them to computable quantities, for example:
Z (IV , q) =
inf
partitions AN
E 7,,,o5”
and
1<j
F (q) = rim N
log Z(N,q) log N
where AN =
fo.
150we
adopt here the standard notation a
4,1(a)
instead of DP—, f(D) as above.
274
Fractal structures
DETAILS AND COMPLEMENTS: PRINCIPLES OF THE PROOF
To show how f(a) can be computed via the knowledge of F(q), we express f(c) via the partitions AN; the number of elements A 3 E AN of center xi such that a(a 3 ) = a is given by: Ni(a) a} card { j, 1 < j < N d , a(ij ) Plugging the definition of the local dimensions [a(±3 )]1
00
1
F(q) = lirn
log
N—roo
Z (N , q)
N
log
N - q a N 1 (a) da
We complete the computation using a method of "steepest descent"; this method is valid a q , and is based on the in the limit N co if f(a) — qa has a unique maximum at a expansion:
is.rf @l q )—q `x ' exP[—(a — a q ) 2 1r(a q )1(1ogN)/2] [1+ r(a)(log N)(a
ce q ) 3]
Termwise integration gives the contributions of successive orders (to an arbitrary order if we co): carry on the expansion of the remainder r(a)) to the quantity (N 00
Nf (*)da = N 1 (a)_ gŒci V2r[lf" (a q )I(log N)] 1 / 2 [1 + 0(logN) -1 1
Plugging this result into F(q) shows that transform with (q, a) as conjugate variables:
df
F"(qa)
and
T st,(ce 9)
t(ag)
dF dq
F(q)
(qa) = a and
F(q) and —f(a) are related by a Legendre
_a
d(—f)1 4
= qaq f(Ceq) 01=0(
q (q)ig=g.., f(a) = [F(q) q ddF
F(qc,) aqû
[a
da
)
The rigorous mathematical proof, showing the existence of the limits, the regularity of the functions and the uniqueness of the maximum a q , is more arduous Note that F (q) can be introduced as a threshold value via the following relation:
inf
partitions A N
E rn(k )§, r;F(q)
1
1<j
where 7'1 is the linear size of the element Ai of the partition AN (made up of Nd elements). A more constructive criterion (Hentschel and Procaccia [1983)) is given by:
inf
partitions .A N
E
nt(A.)q 7.7 — -
i<j
00
if y > if y <
—
—
F(q) F(q)
Note that Z(N, q) is analogous to the partition function of the canonical ensemble encountered in statistical mechanics: log N can be interpreted as the volume V of the system and q replaces the inverse temperature ,3 imposed by the thermal bath. F(q) is obtained in the thermodynamic limit; it is the dimensionless free energy (the free energy .F divided by k B T) per unit of volume, i.e. a pressure. f corresponds to the (dimensionless) reduced volumic entropy and a can be interpreted as the internal volurnic energy:
q=-
F=
V
f=
k
a= v F=U-TS
F aq - f
275
Fractal measures
7.2
Figure 7.3 - Multifractal analysis and generalized dimensions
Generalized dimensions We introduce generalized dimensions D(q) (or Renyi dimensions, [1970]) via the relation F (q) (q — 1.)D(q), They are related to the fractal properties of the measure and are all equal to d for the Lebesgue measure. D o = f(a o ) is the Hausdorff dimension of the support of the measure rri, also called the capacity of the measure, it corresponds to a (fractal) covering dimension (Hausdorff [1919]). D I is the information dimension of the measure (often called the dimension of the measure without any qualifying adjective). Figure 7.3 illustrates the following relations: at any q: ag = F'(q), f' (a9 ) ag is decreasing;
—
q
q and F(q) = gag — f(a g ). The function
F'(0), f(o) = Do, f(a o ) = 0; - at q = 1: F(1) = 0, a Eai r(i) = f(ai) = Di, Pal) = 1; — one checks that ai
at q
0: F(0) = —Do,
a 7, ao =
-
local dimension of the measure is equal to a*, identical at every point of the support of rn, whose covering dimension is f(a*) = Do = —F(0). The measure m is called multifractal if aq is not constant, in which case D I < Do . Multifractal analysis relates f and F via a Legendre transform, and thus gives a constructive tool for studying the scale properties of the measure m,
Fractal
276
structures
7.2.3 Renormalization of a measure Let m be a measure on a set X C Rd. To evidence a scaling law of the form r)] r D (m , '°) as r tends to 0, one constructs a family of transformations [.Rk,E,„A]20EX,k>0,A€R, appearing as renormalization operators acting on the measure rn. Rjc ,g o ,A is defined via the relation:
E X,
d[Rk, t,,,A(m)]W = k A dm[k -1- (i., - i; o )
increases the "apparent resolution" by a factor of k in the neighborhood of i o since the renormalized measure of a ball B(±o, r) is related to rn[B(o, r/k)].11. rn is discrete, defined on cells of size a, Rk A ,,A(rn) is also discrete, defined on cells of size ka. The dilation of the lengths by a factor of k is accompanied by an increase in the "mass" by a factor of kA, so as to reveal the scaling law defining the local dimension D(rn, 4). This transformation is invertible: = Riik,x„,A. The family [Rk,g,,,A]k >0 has thus a group-theoretic structure isomorphic to 00, cc], x); it is equivalent to iterate Rk , g, , A or to replace k by its powers: R O A = Rk3,.A. The relation: Rk, o ,A
Vn. E N,Vr > 0, [Rka rto , A (rn)][B(io,
k
nA in[B(i o ,rk - n)]
shows the equivalence:
Rk,20,A r+/ * = m
„ k nA re[13(4, r)] Vn E Z, Vr >0, i2*[B(0, re)]. log in* [B(i;o , r)] hm log ro
For the measures m* which are fixed points of Rk, g0,A, the local dimension D(rn, thus exists and is equal to A. A typical example is dm() = particular, the Lebesgue measure is a fixed point of all the operators [14, - 0 ,A-d]k>o• All the measures belonging to the stable manifold of Rk . ,„,A at rir, i.e. such that t. 0 A (m) = in*, have local dimension A; D(nt, 0 ) = A at It is also sufficient that this weak convergence takes place for measures restricted to the A (m) is either zero if neighborhood of ;t o . On the contrary, the limit A< Dfrra, to), or not defined (infinite) if A> D(m,i3o). The Vahle A= D(m, i o ) is the only one giving a non-trivial asymptotic behavior under the action of renormalization.
((> DETAILS AND COMPLEMENTS: GLOBAL PROCEDURE The drawback of the renormalization operator RIc, o ,A is that it is local, i.e. adapted to revealing scaling properties of measures only in the neighborhood of the single point Another, global and more constructive renormalization is possible; let us describe the principle of this approach which is still being developed 161 • Let rn be a measure of support contained in a bounded open set X C Rd (the study can be generalized to any measurable space). For a fixed real function A("±) on X and a scaling factor k> 0, we construct the renormalization of m by induction. At the n-th step, we subdivide X into disjoint cells of volume 161
Research on this subject has been done by Mandelbrot and Evertz [1994 [1992].
277
The wavelet transform
7.3
a -d , labeled by their centers
1/2n)ra X (n ) C (Ziri) d and coinciding with the balls We define the measure — if we take the distance sup supj.i...d — Y.11 on Rd . kAn()),k m on the a-algebra TO) generated by the balls [B(Z, 1/2n) r1 X] tex (n) by: ),k rnJ[B(i , 1/2n)
[11,
n xi
kAw rrt[B(,1/2k7t)
n
E X (n )
C (Z1n) d
A km is thus related to the restriction of m to the a-algebra '7-(k " ) , which is finer than R T(') if k > 1. The limit of the family (T ( n ) ), >1, i.e. the smallest a-algebra containing all the a-algebras T(n) is the Borel a-algebra E of X. The renormalization nit(,),krri is then the measure defined on T as the limit as
RA(.),km
n
= nlinl R (:().),krn
oc
of the sequence
(weak convergence of measures)
One must of course check that this limit exists and does not depend on the sequence of subdivisions ( 1 /ra, X('))„> 1 used to construct it, which restricts the domain of definition of RA( . ) , k to a set of measures M Ao j k. Since the function A(.) is fixed, (PZA(,),kik>o, 0) is a one-parameter group 162 isomorphic to J0,04, x). The advantage of this construction lies in the following results:
— [R.A(.),k][B(o, r)] involves the restriction of m to B(±o, rik); the contraction of the lengths by a factor of k is compensated by a local weighting k A( ') ; = A = eonst, then [TIA(,),km][B(±,r)] = — — the Lebesgue measure mL belongs to MA( . ) ,k whatever the function A(.), and the associated renormafized measure P—A(.),krni, is the measure of density p(i) = kA (') -d ; — If
drr() = p(I)dd
then RA(.),km has density
[TR AG),k d(t) =
R (An()) ,m is non-trivial if and only if A(i.) coincides with the local dimension — D(m, i) of the measure m at every — If R.A( . ),km* = Tri*, then m* is locally self-similar of local dimension A(.). — If k> 1, R. A 0,k reduces the possible fractal character of the measure by a magnifying is glass effect: schematically, a singularity of m concentrated in a volume a d around distributed after renormalization in a volume (ka) d after having been multiplied by k A W . — If k < 1, then on the contrary .A(,),k enables us to describe the long-distance scaling law perceived at each point. The renormalization brings to the immediate neighborhood of the mass distributed in a ball of radius 1/k times as large: R.A( . ) , km describes the massic distribution as it is perceived on the average at
7.3
The wavelet transform
The wavelet transform is a rnultiscale , localized spectral analysis, designed to describe the local scaling properties of given natural structures. Like renormalization, 162 This
group is a Lie group only if we consider only measures which are absolutely m[B(i, r] is differentiable. continuous with respect to the Lebesgue measure, so that r
278
Fractal structures
it is based on the scale invariance of these structures, and several further analogies will be made precise in this paragraph.
7.3.1
Transformation formulas
The spatial inhomogeneity of the fractal characteristics of real structures often makes global methods of analysis inadequate or even inapplicable: these methods give only average indications which, even if they correctly take into account the effect of the local inhomogeneities, cannot describe their possible spatial (or temporal) organization. For example, the dimension spectrum gives a hierarchical description of the singularities of a fractal by describing the more or less lacunary structure of the sets of points of given local dimensions, but it does not give any information on their spatial pattern. Only an image of the fractal which is simultaneously both spatial and hierarchical is able to reveal this organization, which is particularly important when we seek to understand the mechanism of formation of the structure or in problems of pattern recognition. To make up for this inadequacy of global spectral analysis, researchers developed a method of local spectral analysis: the wavelet transform, It has two aspects: — an analytical procedure, whose goal is to associate a family of local spectral components to the function A(t); — a synthetic procedure, whose goal is to characterize the local scaling properties of these components and to determine the local fractal dimensions directly on them, then to reconstruct the function A(t). Schematically', wavelet analysis consists of a decomposition of A(t) according to a basis of functions [gc,], called (analyzing) wavelets having a finite support in order to give a local character to the analysis and being adapted to the detection of a particular pattern in A(t). The local spectral components are constructed as follows:
S(A,
„, b) = b—d / 2 JA()9 rt(
X
—
b
Zo
ddt
bd/ 2 A(to bi)g)dd
The wavelet transform is extended to measures by replacing AWol dt with dm(). Because the support of gc„ is finite, the scaling factor b enables us t,o choose the size of the domain of observation around t o , The usefulness of this parameter b to display the local scale invariance of A (at t 0 ) and the flexibility it brings to the analysis is intuitively obvious. In dimension d> 1, the function g o, generally contains a rotation (indexed by d — 1 angles). So one can perform not only a local but also a directional analysis of A. Visually, the wavelet transform acts like a microscope whose optics is described by the wavelet g, which can be oriented and moved around (by varying t 0 ) over the object being studied, and whose magnification can be controlled (via the choice of b). The spectral components obtained keep track of the scale b and of the spatial distribution of the local structures they describe.
We do not detail the conditions of admissibility which must be satisfied by the spanning functions [2,,,], nor the conditions of regularity and integrability on A(t); for these questions we refer to Holschneider [1988] or Meyer [1994 163
7.3
279
The wavelet transform
DETAILS AND COMPLEMENTS: COMPARISON WITH FOURIER ANALYSIS
In order to clarify the specificity of this transform, we compare it to the Fourier transform. The Fourier transform (App. IV.1) corresponds to the choice Y,.0 =0, b =1 and g a (i)= 0:6 1 ; since the functions [g a ] a are periodic, their support is all of Rd. This transform is used to show the periodicity of A:
[Vi, A(i)=A(i. i 0 )1 is equivalent to (S(A, (1)=0 unless äE2(o)={ , ã.o E 27rZ)] It gives a useful analysis of the function A(i) only if the leading behavior of the function is periodic or quasi periodic on the whole space, since then the transform 8(ã) presents very marked peaks, corresponding to wave vectors ci associated to the periodicity of A and to their harmonics. In that case, Fourier analysis is relevant as it simplifies the description of the main behavior of the function A(i) by replacing it with a sequence of spectral components which is, at worst, countable and often even finite; this sequence contains almost as much information as A (exactly as much if A is exactly periodic) and it suffices to reconstruct an approximation of A. In all the other cases, we need to know all the components to be able to reconstruct A: Fourier analysis does not simplify the study since it uses as many degrees of freedom in real space as in conjugate space. Moreover, it is not possible to perceive just from the Fourier transform of A the presence of a locally periodic behavior of A, nor to find, on a spectral component, the spatial zones which give an essential contribution, nor to determine explicitly the spatial arrangement of these domains. -
A wavelet transform can solve these problems by taking
g6 (i) = e
igo(i). The function go has bounded support, for example, of linear extent Az = 1, centered and maximal at i= 0; this ensures the local nature of the analysis by truncating the range of observation, in a way which can be regulated by the choice of b. The variable rj appearing in the spectral components allows us to center the analysis at any point of the space. We thus obtain a representation giving both the wave vectors '6 and their spatial localization to on the scale b. A familiar time-frequency analog of this representation is a musical score, which simultaneously indicates the notes (the frequencies), their duration (the temporal scale) and the moment at which they must be played. The advantage of the wavelet transform as a method for analyzing a signal is that it uncovers the underlying "musical score".
7.3.2
Local scale invariance and renormalization
One of the advantages of wavelet analysis is that it is injective and even explicitly invertible. In dimension d= 1, the inversion formula is given by: A(X)
C; 1 J R JR
SO, X0 5 g ,b) g
x — x0\
b 7 db d
xo
where Cg = 27r f +: V(k)1 2 Ik1 -1 dk , which requires that 'i(0) = O. However, we can detect remarkable properties even without using this inversion formula. Above, we detailed the use of the wavelet transform to detect localized oscillating behavior. Other extensions of the wavelet transform make it possible to detect other kinds of remarkable behavior besides periodicity. The nature of the symmetry properties which
280
Fractal structures
are accessible via simple observation of the components depends on the choice of the analyzing functions g.
0
DETAILS AND COMPLEMENTS: WAVELETS AND SYMMETRIES
The translation groups G(i0) .= {O E Rd n E Z are the symmetry groups associated to the Fourier transform in the sense that the invariance of a function AM under the action of one of them is immediately reflected on the Fourier components of A: }
[VO E
A(i+ nia )] [S(A, =-0 unless ci E Z(k-0) -.= Ce, 6.4 E 274 Nn E Z, Vi e Rd , A(2)
Aot., A] -
The group G(i0) acts linearly on the space of functions ff : R d 3. R), transforming fo O -1 . Consequently, the invariance of A can also be stated its elements via To (f) as: A is an eigenvector of eigenvalue 1 of all the linear transformations of the group g(i0 ) = {To, 0E G(i0)}, isomorphic to G(4) since To, o = To, 0 0 2 . The ability of the Fourier transform to detect periodic behavior comes from the fact that the basis [g(i) e i ' i t5E R d of the decomposition consists of eigenfunctions of all the transformations of -
0 (g) = e' .4 g a . Consequently, an eigenvector A of eigenvalue 1 has no components except on the spanning functions of eigenvalue 1, i.e. for (i E Z(4). T
Extending this point of view, we can introduce wavelet transforms to study invariance with respect to groups G of linear transformations acting in F = : Rd —4 R}: it suffices to be able to choose a complete orthogonal set [g]„ of wavelets (g a E .F) made up of of common
eigenfunctions of all the elements of Ç. In this case, we conclude that a function A E F is invariant under a transformation T of the group G if and only if it decomposes unique/y onto the wavelets of eigenvalue I under the action of T. The group g of transformations can in particular be a linear (or linearized) renormalization group.
Via the wavelet transform we can, for example, obtain the local scaling laws of the objects analyzed; this is the point which makes it a method of anaksis of fractal structures. Moreover, the spectral components of the function A under consideration keep track of the spatial distribution of the local fractal dimensions.
0
DETAILS AND COMPLEMENTS: WAVELETS AND LOCAL SCALE INVARIANCE
Let us show that we can directly read off the scale invariance of A at 0 from the dependence on b of its spectral components [S (A , ka, g, b)], where g is the analyzing wavelet, of finite support, which appears in their definition. Let us introduce:
[ht ,,,t,A](i)
b -1 / 2 A[i.0
— i70)]
A : Rd
R
This operation A 3 3- 12 10 ,bA satisfies the group law oh 0 = h x0 ,b0, 2 ; it represents the action of the affine group (consisting of the dilations and the translations of Rd ) , it is linear and preserves the norm in L2(Rd , dd ). We check that: -
E Rd ,
,
S(A,
g, b) = S(h ,bA , io
2
, g b = 1)
The wavelet transform
7.3
281
Let us introduce: 2
JA(0,
r) = < *r
til(i; + i,)] 2 dd
Set:
— A(
0)
==
A
0(X 0)
=0
and
Iz 0 ,b( 11 t0 )=h 0 ,b(A) — A(x0)
One can then check that the following three statements are equivalent:
br) = b(D() +4 ] JA, o (i'o,r)
flgo , b A 0 = b[D(1'0)+4) At. 0 S(i6 0 , 4 +
b[D ('''» I] S(A, ,
g ,b = 1)
If they are satisfied for every b and r with r < ro and br < ro, these three assertions give three equivalent formulations of the scale invariance of A at io, associated to the local fractal dimension D(±0). The exponent of the scaling law satisfied by JA (r) is given by
. The interesting point is that the existence of a (local) scaling law for the function A is equivalent to the existence of a scaling law of the same exponent for the spectral components of A. In this case, the adequate renormaliza.tion is the linear transformation:
Rt oi b(A)
P
4 0 ,041 (io,
and
b
= = b -14+D(1°) LT4 (to, br) = Rk0,b(A)( 2; ° ' r) .
being arbitrary and fixed, we have:
RT0,t1 ( A Z O
)
A
t0
( JAY° )
j
A ffla
<=> S(Ae- 0 , 13 o ± b, g, b) = b[4+D(2 ) 1 S(A xo ,
b = 1)
In the extension of the wavelet transform to measures, the local scale invariance dm(±0 bi) bl)( ° ) drn(1:0 i) is equivalent to S(m, ±0+b,g ,b) = bp( 0 )i-d12 S(m, ±a+1,g, b = 1). Here the adequate renormalization is the operator Rb ,x, p(0 0 ) introduced in § 7.3.3. Like the Fourier transform, the wavelet transforms can be defined in the sense of distributions164 , which makes it possible to extend them to the cases where the first definition gives rise to problems of existence and convergence. Thus it is possible to consider the family tg aoj a where = as a family adapted to scaling properties. Indeed, with this choice we have:
S(A2 0 , 40, a, b) P+1
4, b = 1)
(6 >
Let T be a linear transformation on a space .1" of functions of Rd in R, for example R) or Tm f 1—• f f (t)clm(t) where TA f f A(t) f (t)d d t with F = L2(R't = L1 (dm). We define the Fourier transform of T "in the sense of distributions" on the set D(T) of functions yo of Rd in R which admit a Fourier transform (,-3 el. by: r.-[.."(9)E T T)). No 164
(
restriction is imposed on T: the constraints of existence of D(.7") (Schwartz [1978], [1979]).
I" concern its domain of definition
282
Fractal structures
The following conditions are thus equivalent:
-
R o0 ,b(16 0 )
A 0 for all b > 0;
— S(A 20 , i o , a, b =1) = 0 unless a — for all b > 0, ±0 , a b)= 0 ,
unless a = D (5 0).
Note that [Tt 0 g2](x) = gcet) (i.- 0 ) is an eigenfunction of the transpose of R,t Di b; the transpose is on the linear operators of the Hilbert space L2(11.d , ddi;), whose scalar product we denote by < I >. Indeed:
b) b[cf—D(x0)1s(A 0, y 0 , a , b = 1) b — i4+D( ' °)) S(A 0 ,±0,
< Rfo ,b(A f l aTfo e„ >
-
< Ik,171±092 > < A„,104- 0 ,1,117'1 4°j >
from which we deduce that [t .F4 0 ,b][Tta gaa ] = b'n ('°% o gc,. ° . If A is scale invariant at --0, of local dimension D(), then only its spectral components on the function g° are
non-zero, i.e. on the only function whose translation Too g°OE is an eigenvector of eigenvalue 1 of 1 .1=4. In the case of a renormalization group and a wavelet transform, one finds the result obtained with translation groups for the Fourier transform. The general result can be stated as follows: if Lq c,]„ is a family such that for all a, T a g, is an eigenvector of 1 R, 0 ,b, then the only non-zero local spectral components 8(A 0 , g, b) of a function A invariant under i b are those where a is associated to an eigenvector of eigenvalue 1.
The method can be generalized to other types of symmetries, reflected in the local invariance of the function A (from R d to R) under the action of transformations of a parametrized group. Wavelet analysis then simultaneously gives the spatial and even the directional and hierarchical (as functions of the observation scale) distributions of the parameters of the local transformations preserving A, which enables us to visualize the spatial structure and the symmetry properties on different scales. For example, it allows us to detect the position and the scale of a particular given pattern. The wavelet analysis is thus an essential step in the understanding of the mechanisms of formation of fractal structures or more generally of structures presenting a local invariance under the action of a symmetry group. The close relationship between wavelet analysis and renormalization techniques can be seen in the fact that their respective domains of application have a large intersection.
0, DETAILS
AND COMPLEMENTS: PHYSICAL EXAMPLES
Let us conclude this chapter by giving some examples where the wavelet transform and renormalization methods come together and supplement each other. They prove to be particularly efficient in the quantitative analysis of scale invariance — of the accumulation of period-doublings associated to the period-doubling scenario and of the subharmonic cascade observed on the power spectrum 05.1.6,
of the fractal structure of certain strange attractors and of the associated invariant measures (§ 5.1.3, § 5.4, Meyer [1991]);
7.3
The wavelet transform
283
— of the energy cascade of developed turbulence, of the field of velocities and of the phenomena of spatial intermittency observed in this regime (§ 5D.2, Argoul et al. [1989],
Arneodo et al. [1993]); — of the fractal clusters, such as the critical (infinite) cluster of a percolation lattice (§ 7D.2); — of models of fractal growth and of aggregation.
REMARKS AND BIBLIOGRAPHICAL NOTES The fact that fractals are currently fashionable as well as really conceptually interesting, and the diversity of the domains in which they naturally arise, have given rise to a great deal of research. To begin with, we must cite the "historic" article by Mandelbrot [1967], little noticed at the moment of its appearance although it introduced the original notion of fractals. Now recognized, (Aharony and Feder [1989]), Mandelbrot participated in most of the progress in the description and the understanding of fractal structures (Mandelbrot [1977], [1982], [1986]). Barnsley [1988] and Peitgen et al. [1992] show the breadth of the domain of application of fractal geometry; the mathematical aspects are explored in Feder [1988] or Falconer [1990]. For a more physical approach to fractals, see the presentation by Pietronero [1989] of their origins and properties, the collective books edited by Runde and Hay lin [1991] [1994] or the conference proceedings edited by Pietronero and Tosatti [1986] and by Stanley and Ostrowsky [1988 ] . The subjects considered in chapters 5, 6, and 7 and their supplements are also given in Gouyet [1996], in a presentation oriented towards their fractal aspects. The article by Farmer et al. [1983], those collected in Barnsley and Demko [1986] and the book by Devaney [1990] present fractals encountered in the study of deterministic chaos. Gefen et al. [1980] consider the critical phenomena taking place on fractal structures. Stauffer and Stanley [1990] present fractals as an extension of "traditional" physics. The book by Barabasi and Stanley [1995] deals with fractal concepts encountered in surface growth phenomena. Applications of both renormalization methods and fractal concepts to the analysis of aggregation phenomena (DLA) and related models, not approached in this chapter, can be found in Gould et al. [1983], Nagatani [1987] and Nagatani et al. [1992]. Historically, the concept of multifractality was introduced by Benzi et al. [1984] and by Frisch and Parisi [1985] to describe the distribution of singularities of the velocity fi eld in a fully turbulent fluid. This concept, further developed by Mandelbrot [1986] and [1988] in relation to already known fractal geometry, turned out to be relevant for the delicate analysis of strange attractors (Halsey et al. [1986], Collet, Lebowitz and Porzio [1987]). Multifractal measures and their similarity properties are studied in Mand.elbrot [1989] and in Mandeibrot and Evertz [1991], [1992]. Other more physical examples can be found in De Arcangelis [1988], Stanley and Meakin [1988) and Stanley [1991]; Paladin and Vulpiani [1987] study the anomalous scaling laws observed in multifractal objects. A complete and recent mathematical presentation of multifractal analysis is given in Falconer [1990]; a more physical and more accessible approach can be found in the book by Peitgen et al. [1992]. The experimental aspects of the determination of a dimension spectrum are considered in the reference article by Grassberger and Procaccia [1983]; another approach, based more on numerical aspects, is proposed in Chhabra and Jensen [1989]. The waveiet transform presented in §7.3 is a stillexpanding subject; surveys of the successive advances in this area can be found in Combes [1980], Combes et al. [1988] and Meyer [1991].
Supplement 7A Percolation Percolation lattices give discrete models of disordered binary media, and they undergo a universal critical transition (§ 7A.1). This transition induces scaling laws and fractal characteristics both in the statistical properties of the percolation cluster (§ 7A.2) and in the transport phenomena on these clusters (§ 7A.4). Renormalization gives numerous and exemplary methods (§7A.3) to describe these scaling properties analytically or numerically. It is also possible to use finite-size scaling to obtain certain critical exponents.
7A.1
Percolation models: clusters and percolation threshold
The term
percolation is associated to the study of disordered binary media, in which a
local property can be realized in two ways coded 0 and 1. The small-scale structure is thus a nesting of regions 0 and regions 1, perceived as random by a macroscopic observer. There are numerous examples of percolation situations: — systems consisting of two species A and dominates or 0 if the species A dominates;
B; the coding is locally 1 if the species B
— adsorbing catalytic surfaces: the adsorbing sites are coded by 0 if they are free and 1 if they are occupied; — mixtures of a conducting material and an isolating material, where one studies the transition between global isolating or conducting behavior; — mixtures of a conducting material and a superconductor, where one studies the appearance of superconductivity on the macroscopic scale; lacunary systems, modeling porous media or rough surfaces; the empty places are coded 0 and the occupied zones 1; — polymerized gels, where the presence of a chemical liaison is coded by 1; one studies the transition of the liquid to a special phase called "gel"; — populations, where one studies the possible propagation of an epidemic; the healthy individuals are coded 0 and the sick 1. The etymological example 165 is the passage of water through coffee grounds which consist of fine particles more or less agglomerated according to the density, which can be regulated by tightening the filter of the percolator. As can easily be observed on a percolating coffeepot, and Hammersley [1957] to designate the modeling of random binary media. This type of model could be found previously in the work of Flory [1941] and Stockmayer [194 4] on polymerized gels. 165 The term "percolation" was introduced by Broadbent
286
Percolation
the time taken by the water to pass through the filter, i.e. the time it is in contact with the coffee grounds, depends on this density; moreover there exists a density known as the percolation threshold above which the water cannot pass through the filter. The natural problem arising here is to describe the agglomeration of the coffee grounds as a function of its density, then to describe the characteristics of the propagation of the water through the random inhomogeneous medium obtained.
Formalization: four models of percolation Let us consider systems of extension L in Rd, described with a resolution a
— site percolation (figure 7A.1.(a)): the situation is discretized by a tihng by identical cells of volume a d, identified with the sites of a lattice indexed by Z d . The state of a site is random, and the sites are statistically independent: each of them is occupied with the same probability p, so has a probability 1 — p of being empty;
— bond percolation
(figure 7A.1.(b)): the situation is discretized by a mesh with statistically independent and identical bonds of length a, which are present with probability pB, and therefore absent with probability 1 — pB;
— site-bond percolation
(figure 7A.1.(c)); this is a. combination of the two preceding situations; one uses a model of sites in which the bonds between two occupied sites are present only with conditional probability pBi
— directed percolation (figure 7A.]..(c1)); one uses the model of bond percolation but adds a random orientation on each bond.
<>
DETAILS AND COMPLEMENTS: PHYSICAL DISCUSSION OF THE MODELS
In model (a), a site corresponds to the minimal volume perceptible by the observer: it is occupied if its density is greater than the threshold of sensitivity of the measuring apparatus or if it can serve as a support for the diffusion of a test-particle. This model is suitable for problems of contagion in a random medium or for modeling adsorbed systems. The other models are better adapted to the study of transport phenomena; they lend themselves to the schematization of statistically anisotropic media. Models (b) and (c) were introduced in the context of polymer gels. Model (d) is used, for example, to study neural networks or invasion phenomena in porous media. A network of resistances placed randomly on a regular lattice with probability p realizes a bond percolation system; a system of directed percolation is realized by replacing the resistances by transistors.
7A.1
287
Percolation models: clusters and percolation threshold
WEISS MM. ME M O WO O =
MEE=
(b)
(a)
(c)
20111111101 Figure 7A.1 - (a) Site percolation, (b) bond percolation, (c) site—bond percolation and (d) directed percolation
111•11111 It ERNE 711131211
(a) the probability p that a site is occupied coincides with the total concentration if the lattice is large enough; (b) the probability pB that a bond is present coincides with the total concentration of bonds if the lattice is large enough;
(d)
(c) we recover (a) if all the admissible bonds are (ps =1) and (b) if all the sites are occupied (p= 1); (d) the bonds of the model (b) are oriented.
present
0. DETAILS AND COMPLEMENTS: PROBABILITY p AND AVERAGE NUMBER DENSITY The configurations of a lattice of N sites are described by [e] where ej = 1 (this happens with a probability p) if the site j E Z d is occupied and Ey 0 if it is empty. The total number of occupied sites is a random variable No(p, N, [e]); thus this is also true of the concentration c(p, N,[e ]) = No (p, N,[E])IN=L- Ej 6TIN. Applying the (strong) law of large numbers (App. cx) , this random concentration coincides almost 1.2) then shows that in the limit as N
surely with the probability p that a site is occupied:
Ern c(p, N,[f])= < f > = p
N-9.
a°
almost surely.
The central limit theorem estimates the fluctuations < [cp ,N —29 ] 2 can be transposed without difficulty to bond lattices.
>= 0(1IN).
The proof
The advantage of these models lies in their simplicity: the sites or the bonds are described by independent and identical bimodal random variables, entirely specified by their individual probability p or pB. These models are particularly well adapted to simulation methods; they were developed in parallel with numerical tools. Percolation systems thus constitute basic models for studying binary random media; they provide representatives of the universality classes observed for these media.
Percolation
288 Clusters and the percolation threshold
A cluster is a connected set of occupied sites or of occupied bonds. In case (a), the sites of a cluster must be connected by a sequence of occupied nearest neighbor sites; in cases (b) and (c), two bonds of a cluster must be connectd by a chain of occupied bonds; in case (d), two sites of a cluster must be connected by a sequence of coherently oriented bonds. Unless we explicitly say so, we consider below only model (a) of site percolation. -
In an infinite lattice, the percolation threshold is defined to be the concentration p, at which the first infinite cluster appears. Intuition would seem to indicate that p, = 1/2 by symmetry or that this threshold should be a random variable however, these two ideas are entirely wrong! In a lattice of infinite extension, this concentration has a welldetermined value, depending only on the chosen percolation model and on the geometry and the dimension d of the lattice, but not on the physical interpretation of the occupied sites or the bonds present, nor on the way in which p increases starting from p= O. The question is thus to compute p, and to describe the transition p=pc . In a finite lattice of linear extension L, we introduce the notion of a spanntng cluster, whose definition, depending on the physical context of the model and the geometry of the lattice is, for example, the existence of a cluster connecting the edges of the lattice. The concentration I3,(L) at which the first spanning cluster appears is now a random variable; its value depends, moreover, on the precise definition of a spanning cluster used and on the way in which it is constructed, for example by randomly filling the remaining free sites (which increases
tends to
will study the rate of the almost sure convergence of MI)) to p, as L infinity as well as the dependence on L of the mean and of the variance of Pc (L).
p). We
The study will deal with static aspects (§7A.2), considering geometric statistical properties of clusters and their fractal characteristics as functions of the concentration p, before approaching dynamic aspects (§7A.4), in particular the study of transport phenomena on the static structure uncovered by the first part of the study. This study is mainly motivated by the desire to understand and quantitatively describe transport phenomena, which are directly related to observable physical phenomena.
(>
DETAILS AND COMPLEMENTS: NUMERICAL DETERMINATION OF pc
To determine the percolation threshold, we will observe a transport phenomenon which occurs only if there exists a spanning cluster supporting it; the statistical study of the values Pc obtained by observing a large number of configurations (of finite extension) gives the deterministic limit p c . A first example is the contagion model used to reproduce the propagation of forest fires (Drosse! and Schwabl [1992)]. It is realized by filling each site of a square lattice N X N with probability p: for this, we independently select random numbers ei for each site i, uniformly distributed in [0,1], and we fill the site if ei < p. The fire is set at a site on the left-hand edge at the instant t = 0; in a time step to t o + 1, the sites which are lit at to light their nearest neighbors and go out. For each configuration, we obtain the time r taken by the fire to reach the right-hand edge or to put itself out. We observe that the time 7- (p, N) obtained by averaging T over a large number of independent configurations selected with the same probability p diverges for a deterministic value pc (N) dependent on N; as N tends to infinity, pc (N) tends to a value pc depending only on the geometry and on the dimension of the lattice.
7A.1
Percolation models: clusters and percolation threshold
289
A second example is that of diffusion on the preceding lacunary support. At t = 0, the test-particle leaves an occupied site d',0 on the left-hand side. Its motion, discretized in time, is + 1 , of the defined recursively: we (equiprobably) select one of the nearest neighbors, denoted particle goes the instant if it is occupied, the ti = jr; site z(t_i ) where the particle is located at there in a time step 7 and ,t(ti+i) = ki+1; if it is empty, Oi-i..1)= (ti). The quantity which best characterizes this motion is the quadratic mean displacement D (t , p) = < 1i(t)— .t011 2 >, where the average is taken over a large number of independent configurations and for each of them, over a large number of independent particles. If the lattice is large enough, we observe
t ) oo: pc — p = 0(1), then D(t, p)
the following asymptotic behavior as
—
remains bounded with time; the — if 0 < p < pc and medium is too lacunary for diffusion to occur and it traps the particle; -
pc = 0(1), then D(t,p) t: the diffusion is asymptotically — if 1 > p>p, and p normal, analogous to the Brownian motion observed when all the sites are occupied;
tcr — between these two extreme regimes, the diffusion is anomalous: we have 1)(t,p) where 0 < a < 1, and the quantity 2/a appears as the fractal dimension (in quadratic mean) of the trajectories of the particle. The greater the size of the lattice, the more the transition between the trapping regime for p < pc and the diffusive regime for p > pc is sharp and allows a threshold pc to be defined precisely. There also exist purely geometric (static) methods to numerically determine the random threshold Fc (N) in each configuration of the preceding lattice of N sites, and then to
) oo. One of the most classical methods is determine pc itself by passage to the limit N based on the Hosheu-Kopeiman algorithm (Hoshen and Kopelman [1976], Kopelman [1986]). This algorithm can be applied whatever the geometry and the dimension of the lattice, and enables us to test whether a given configuration percolates and to make a statistical study of the spanning cluster. We begin by labelling all the sites of the lattice line by line 166 . The —
first step of the algorithm is to assign a number (or label) ni to the j-th site encountered while numbering, with
-
ni = 0 if this site is empty;
-
ni = ni _k if this site is a nearest neighbor of a site j — k of label — ni = 1 supi j) with nk
166 The most general condition is that at every moment, the set of numbered sites and that of the not-yet numbered sites form two complementary connected clusters.
290
Percolation
with pi,,-1 and we take Pj,n 2 —(n+1) , with the sign — if the configuration percolates; in particular, Pj,11Pj,ri an-d Pi > Pc if Pj,n-f-i.
large numbers gives an estimate of the average <23,(N) > J p . The results of finite-size scaling theory (described at the end of §7A.2) then allow us to estimate the distance between the value < (N)> deduced from the simulation and the exact deterministic value
lh•
7A.2
Static aspects
Consider the situation of an infinite lattice. The value pc of the percolation threshold is deterministic but depends on the specific details of the chosen percolation model and of the geometry of the associated lattice; comparison with the observed value serves as a guide to select the most relevant model. On the other hand, the transition p = pc has universal properties, which can be expressed by scaling laws whose exponents depend only on the unique physical parameter which is intrinsic (i.e. independent of the model), namely the dimension
d of the
space.
The probability of belonging to the infinite cluster The transition p= p, corresponds to the appearance of an infinite cluster: it is present for every value p>p, arid is quantitatively described by the probability P„,,(p) that it contains a given, arbitrarily chosen site, Experiments and simulations suggest that P00 (p) should satisfy:
P(p)= O
if
p < pc
Poo(P)
(P — PO P if p > pc
Poo (pc ) = 0 reveals the very Iacunary character of the infinite cluster at the percolation threshold: although it is infinite, it occupies a zero fraction of the lattice; its characteristic property is thus its connectedness on every scale (Coniglio [1982}). Experimental observation in dimension d < 3 of p — ) 13,0 (p) shows the divergence of the derivative [dP/ dp](p) at p = pc , When ,3 < 1 (so at least in dimension d < 3), the graph of Po, (p) has a vertical tangent at p,; its form, analogous to case (b) of figure 1.3, thus shows the critical nature of the transition p.= pe ; in that case, the relevant order parameter is P. The interest of this scaling law for P(p) lies in its universality: 0 turns out to depend only on the dimension d. This law is thus independent of the model and reveals a real physical property, common to ail disordered binary media. It is valid only near pe ; much higher than the threshold, the infinite cluster contains the majority of the occupied sites, so that P(p) increases as p. c(;)
DETAILS AND COMPLEMENTS: THE MEAN-FIELD APPROACH
The computation of P(p) via a mean-field method 167 is possible if we neglect the presence of closed paths in the lattice, called loops, so as to assimilate the lattice to a Beth e lattice as in figure 7A.2. Thanks to the "tree-like" geometry of this lattice, we can define the conditional probability Q(p) that a site (c) neighboring a site (o), known to be occupied, does 167"
Proposed by Flory [1941 ] in the context of polymerized gels.
7,4.2
Static aspects
291
not belong to an infinite cluster contained in the branch coming out of (c) and not containing (o). We then compute the probability Pfi nit,(p) that an arbitrarily chosen site (o) does not belong to an infinite cluster: either this site is empty (with probability 1—p) or it is occupied and none of its z neighbors belongs to an infinite cluster in the branch not containing (o) of which it is the initial vertex. This can be written:
1
—
Poo (p) = P1 11 (p) -=- (1 — p) ± pQ(p) z
The condition P(p) = 0 implies that Q(pc ) = 1. We then continue the reasoning on one of the neighbors (c) of (o); this site (c) is in the situation of probability Q(p) described above if it is empty or if it is occupied and if each of its z — 1 neighbors in the branch not containing (o) does not belong to an infinite cluster in the branch not containing (c) whose initial vertex it is. This assertion can be written:
Q(p)
= ( 1 — /3) + PQ(P)z-1
(with Q(Pe) = 1)
Differentiating this relation at p:--_- p,, we obtain the exact value p, = 1I(z — 1) where P(p) = 0 and Pc/0 1 (p, + 0) = +co. The expansion of P(p) with respect to p — pc then gives the value 168 /3 = 1. As in numerous other critical transitions, the "mean-field" computation is valid without restriction on the lattice or on the model whenever the dimension is greater than a threshold etc ; we have d, = 6 for percolation.
o
7A.2 - Bethe lattice (z = 4) Each site has z neighbors and z(z — 1) points at distance 2; this lattice is characterized by the absence of "loops': the sites (a) and (b) are connected only by a path passing through the site (o). The mean-field approach here leads to the exact result p, =11(z — 1) and )6 =1. Figure
s
One can introduce other statistical quantities which describe experimentally or numerically accessible quantities by averaging over a sufficient number of results. Like P(p), they have the advantage of obeying a scaling law with universal exponent at p = pc . 168 A Bethe lattice is conceivable only in infinite dimension: it is not so much a lattice with a particular geometry as a representative of the class d = co: the independence of )3 with respect to the geometry of the lattice does not fail and we shall write )3(cd = co) = 1.
Percolation
292
The average number of sites in a finite (non-empty) cluster We denote the average number of sites in a finite cluster by 8(p). It diverges at p,, then decreases since the infinite cluster is not taken into account; we always have S(p) > 1. where 7 is identical on both sides of p c and It satisfies the scaling law 8(p) 113 depends only on d.
Correlation functions r The correlation function C fi r,ite (p, 0 is the conditional probability that the site f.0 is occupied and belongs to the same finite cluster as the site fo, knowing that fo is occupied and does not belong to an infinite cluster; thus it is normalized by Cjirtite(P, r= O) 1. It depends only on the modulus r of F by homogeneity and statistical isotropy. FOI p > pc , we define Cinfinite(p, F) similarly for the infinite cluster (Kapiltulnik et ai. 119831). We obtain Cfi n ite (f) where the sum is over all the sites of the lattice (including = 0). S(p) = Two characteristic lengths are associated with these functions, according to:
E,
E r 2 Cm(p, F.) . [ E C[j (p, f) ] -1
where [I ] = finite Or infinite
inite(P) estimates the characteristic size of the finite clusters when the concentration is p. These correlation functions and lengths diverge at p=p, showing the critical nature of the transition p= pc . Empirical scaling hypotheses lead us to write the functions C fi, it ,(p, r) and Ci n, fi n it e (p, r) in the form:
C(r,p)
(13.[r(p) -1 ]
(r > a > 0)
zb e — a4 at infinity. Their behavior at and typically (I)(z) where 4P(z) is analytic, 0(0) for r large enough: we recover the fact that at the critical point r p=p c is thus CH p=pc, an exponential decrease rb— e — "le(P) is replaced by a power law r— e2( for r co.
Characteristic length There are several possible definitions for the
characteristic length C(p).
< p < 1) and C n fi,it e (P) We introduced the correlation lengths, i(P) (if firlte (if pc
(p) of the finite clusters can be interpreted — The average gyration radius ( 1.3.2) as a length of connectedness. The appearance of clusters of size increasing towards infinity as p increases to p, implies that (p) diverges when p tends to N---0 (i.e. from below). For p>p,, one of these giant clusters has become infinite and is growing by absorbing the others, but just above the threshold, there still remain many other large clusters, which become less and less distinct from the infinite cluster as p approaches pc : eg (p) also diverges as p tends
G
to p c + 0 (i.e. from above). — If p > pc , we introduce the scale e(p) above which the infinite cluster is homogeneous. Its divergence as p tends to pe follows from the lacunary character of the infinite cluster at pc and justifies calling it the "critical cluster' .
7A.2
293
Static aspects
The remarkable point, empirically well-verified, is that these lengths, whose physical interpretations are quite different, all obey the same scaling law
where the exponent is is identical for p > p, and p < p, and depends only on d. The proportionality factor depends, however, on the exact definition of e; it is not universal and differs on either side of p = pc .
Fractal structure and universality of percolation The critical cluster is a structure for which an the notions of fractal geometry can be explicitly described. Via these notions, one can quantify the lacunary, self similar and ramified character of the critical cluster; these notions are also involved in the scaling laws of the critical transition p pc . For instance, the fractal dimension D of the critical (Alexander and cluster is related to the preceding exponents by the relation D = d — Orbach [1982 ] ), revealing a super universality in the percolation since it is valid whatever the universality class of the exponents. Thus three levels of universality appear: -
-
the percolation threshold p, is independent of the physical interpretation of the occupied sites or the bonds present but depends on the geometry of the lattice, on its dimension d and on the percolation model; —
— the critical exponents depend only on the dimension d of the lattice; — the relations between the critical exponents can be applied whenever we are dealing with a percolation system (i.e. discrete, with binary and non-coupled local states) whatever the value of the dimension d is.
DETAILS AND COMPLEMENTS: GEOMETRIC RESULTS 169
— One justifies experimentally and theoretically that the gyration radius rs and the "mass" s of the cluster of s sites are related by a scaling law: s r,(p,)13 ' (s co) at the percolation threshold. The exponent D' can be interpreted as a mass dimension of the finite clusters and coincides with the fractal dimension D of the critical cluster.
— We write sn s (p) for the probability that a site belongs to a cluster of s occupied sites. It is immediate to check that p = Es> , sng (p) Pœ (p) and S(p) = [Es> , s2 n,(p)] [E, >1 sn,(p)]' for all p E [0,1 ] . At—pc , the quantity n, satisfies the empirical scaling law n- 3 (pc ) (s oc). — The above scaling law can be extended to values p
pc in the form:
ns (P)
where II) is analytic on [0, co], such that 4:1)(0) =0 so as to recover n,(p,) ,--, s' . — We can show that the exponent of the laws C(pc , r) r
has the value a
= d D. —
— Many fractal characteristics can be associated to the critical cluster, among which its
degree of ramification and the fractal dimensions of particular subsets, such as its interna/ perimeter (border sites belonging to the cluster), its external perimeter (border sites not 169 We
refer to Stauffer [1985], Nagatani [1986 ] or to Havlin and Bunde [1991] for the proofs.
294
Percolation
belonging to the cluster), its backbone, obtained by eliminating the dangling bonds which, if the occupied sites are considered as conducting sites, are not crossed by any current, and finally the set of red sites (or bonds), those which in the same interpretation would carry all of the current.
Finite-size effects Since the systems modeling percolation lattices have a finite linear extension L, we must study the dependence on L of the percolation threshold (or rather of its statistical properties since this threshold is then a. random variable F.),(L)) and of the distribution of the clusters; we also need to describe the modifications of the asymptotic scaling laws (La-- oo) at p= so as to compare their predictions with the observations made in finite size. The general procedure of § 3.2.4 can be applied, for example, to the scaling law obeyed by the probability P (L , p) that a site belongs to a percolating cluster. Supposing that the only characteristic length of the system is (p) p pc h' and that P(L, pc) L —A (A > 0); we look for P (L , p) in the form P (L , 13), L A F [Ll/V(p pc )] The regularity of P(L,p) at p (for finite L) requires that F(z) be analytic on R. The scaling hypothesis at p --=p, ensures that F(0) 0 since otherwise we would have P(L, pc ) = O. As L tends to infinity, we should recover the scaling law Poo (p pc)'8 which means that F(z) must behave like z'9 at infinity and that A =131v: —
" .
,
P(L,p)
F [L11 (p — pa )]
where F(0) 0 0
and
F(z
co)
2-6
TA.3 Renormalization methods The evidence of a universal critical transition at p= pc motivates us to use the tools of renormalization in the study of percolation. This paragraph presents the numerous methods
employed to compute the percolation threshold pc and the critical exponents of the associated transition and to determine the universality of these exponents by showing that they depend on the dimension d of the space but not on the geometry of the lattice or on the particular percolation model used. These methods take place in real space and are mostly numerical. They were designed to underscore the critical cluster, since its lacunary character, reflected in the fact that the probability P(p) of belonging to it is zero, prevents it from being directly visible. The methods, based on the fact that this cluster is connected on every scale, must preserve this property. Their advantage is that they concentrate the analysis on the collective structure associated with the infinite cluster rather than on specific details, on which the properties conjectured to be universal should not depend. Unless we explicitly state the contrary, we will consider an infinite hypercubic lattice of dimension d; we are still considering the case of site percolation, Since the sites are identical and independent, the statistical state of the lattice will depend only on the occupation probability p of a given site; this probability is thus identified as the structure rule on which the renormalization will act.
The method of "rnacrosites" This method is based on the general principles illustrated in figure 1.6. Once a scaling factor k is fixed (such that k d is an integer), it consists of subdividing the lattice into cells
7A.3 Renormalization methods
295
of kd sites each assimilated to a unique site having two possible states (empty or occupied) and forming a lattice with the same geometry. A contraction of the lengths by a factor of k ensures the conservation of the number density of sites. The transformation can be explicitly
computed on p by computing the occupation probability p' Rk(p) in the renormalized lattice: for this we need to determine in which cases a macrosite is considered to be occupied. This is not uniquely determined; the general form of Rk
Rk (p) =
E
Prob(M) w([d) =
E
prq[ 1 ) ( 1 _
[EJE{0,1}k a
NE(0,i). 0
The sum is over the 2 kd configurations [f] of a mazrosite and n(H) is the number of sites occupied in a macrosite with internal structure [e]. The choice of the weight w ([ d) is based on the physical interpretation of the occupation of a site to give a coherent interpretation of the occupation of a macrosite. Once Rk is constructed, one looks for its fixed points in [0,1 ]. The self-similarity of the configurations of the lattice at the percolation threshold implies the existence of a non-trivial fixed point p* coinciding with the critical concentration pc ; by definition, this marks the breakpoint between the situations where all the clusters are finite and those where there exists at least one infinite cluster:
p < p c : there exists no spanning cluster, so that a sufficient number n of renormalizations must lead to a situation where the macrosites are isolated, or even empty, in the limit n 141 (p) = 0; 00: — if p > pc : there exists at least one spanning cluster, so that a sufficient number n of renormalizations must lead to a situation where the macrosites are all occupied: R(p) = 1. Thus one condition of physical relevance for the transformation Rk is that it must have two stable fixed points p= 0, p= 1 and an unstable fixed point p c . Its action on the correlation length (p) can be written: —
if
[Rk(p)] = E(p)/k
hence
k iRk(P)
—
Pci -v
The linear analysis of /4 in the neighborhood of the fixed point p c leads immediately to the value of this exponent v:
v = log ki log Ak
0. DETAILS
where
Ak
1(dRk I dP)(Pc)I > 1
AND COMPLEMENTS: EXAMPLES OF WEIGHTING
A first choice is based on the majority rule: a macrosite is occupied if it contains at least s occupied sites out of k d , which means that w([e[)=-- 1 if nad) > s and w([E])= 0 otherwise; the threshold s remains to be fixed. Consider a triangular lattice in dimension 2 with k 2 = 3 and 8=2; we obtain R(p)=p3 F 3p 2 (1 p). The fixed points are p= 0, p = 1 and p* =1/2; other arguments i " show that 13* =1/2 is the exact value of the threshold. The linear analysis of R at p* gives v=log(A/ log(3/2):: .2. 1.355, comparable to the theoretical conjecture 171 for the value v=4/3. -
—
--
170 The
duality between the triangular lattice and the Bethe lattice (figure 7A.2) with parameter z = 3 gives them the same threshold pc = 1/(z —1) = 1/2. However, one does not obtain v via this analysis, which justifies the recourse to renormalization. 171 See Bunde and Havlin [1991].
Percolation
296
Another choice, which is often better because it preserves the property of connectedness of the cluster, is the following: a macrosite is said to be occupied if its configuration percolates; it then has the weight w ([ d) = 1. There is still art ambiguity in the percolating character of a configuration; the criterion could be that there must exist a path consisting of nearest neighbor sites linking the faces of the cell which are transverse to some direction which is fixed a priori, or more strictly, linking each face of the cell to each of the others. Let us consider a square lattice with k= 2; a macrosite is called occupied when its configuration allows us to link the vertical right-hand edge to the vertical left-hand edge via a sequence of nearest neighbors. As illustrated in figure 7A.3(a), we thus obtain R(p) -z-- p 4 + 4p3 (1 — p)+ 2p2 (1 — p) 2 . The fixed points are p = 0, p = 1 and p* -=.--- (16- — 1)/2,=---,' 0.618 (more refined procedures give pc = 0.59275); the computation of v gives v = log2/2100-5- — 1) ^.-2, 1 6.
o
P
(b)
4
p3 ç'
3 P 4
3
P 4
3 P 4
H 4 H H h 11 11-1 0 I-1 Fl 11 hi Y 5
,4 ,
PB
l'BY 13
3 2
32
PBqB
PB4B
,„4 „
Y BIB
Y B YB
,,4 , FB "IB
32
,3 ,2
32
PB qB
,4 ,
PBqB
BYB
Figure 7A.3 - Renormalization.
Rk = 2
2 2 P q
2 2 4
P
1,0
,
1- BY B
32
PBqB
hi H 3 2
3 2
PBqB
PBqB
H
1-1
PBqB
PBqB
23
23
for a square lattice (d = 2)
(a) Site percolation: Represented here are the elementary con fi gurations for which the macrosite is considered as occupied; the contributions to Rkp are indicated (with q = 1— p) and lead to Ilkp = 7 1 + 4p3q + 2p2 q 2 . (b) Bond percolation: Here we show the elementary configurations for which the macrobond is present; the sum of their contributions to RkpB (with
q.B = 1 — pB) gives RkpB =
p13 + 543qB + 8p19 2/3
+ 2Piql,
7A.3 Renormalization methods
297
"Macrobond" method The macrobond method is a simple transposition of the preceding method to the situation of bond percolation; it is illustrated in case (b) of figure 7/1,3 . Renormalization should preserve the connectedness of the cluster, which guides the choice of the elementary configurations corresponding to an existing macrobond. For a square lattice and for k = 2, we obtain the value pB,, of the percolation threshold as the non-trivial fixed point of R(p) = p5 + 5p4 q ± 8p3 q2 -}- 2p2 q 3 (q = 1 p). This gives the (exact) value pB ,, = 1/2. —
The "ghost—site" method We imagine that there exists an extra "ghost site" linked to the various sites of the lattice; these additional virtual bonds are independent and present with probability h. Renormalization assimilates cells of kd sites to macrosites, so that now it transforms the two parameters p and h to give the probability p' -= Rk(p,h) that a macrosite is occupied and the probability h' = rk (p, h) that it is linked to the ghost site. We now include among the configurations of the macrosite which percolate (and so cause the macrosite to be occupied) those for which the path of nearest-neighbor occupied sites passes through the ghost site; rk (p, h) is obtained by counting the paths linking the ghost site to a site chosen in a prescribed subset, in order to preserve a global direction of the percolation (figure 7A.4). One checks that the unstable fixed point is (pc , h= 0), where pc is the same as in the method of matrosites; this reflects the artificiality of the ghost site. A linear analysis in the neighborhood of (pa , h = 0) recovers y and also gives access to another exponent:
1/ , log k I log A ik
where
Afk = 1(ark / ah)(pc , h = ()) > 1
(a)
(
3) 2
Figure 7A.4 - Method of the ghost site
(k = 2, d = 2)
(a) The model here is that of case (a) of figure 7A.2. We have represented only the additional configurations, those where the path passes through the ghost site (*). The occupation probability p' of the macrosite is given by
(q , 1 — p): p'=-.- Rk(p , h) = p 4 ± 4p3q + 2p2 (12 ± 2p2 q 2 h2 . (b) The ghost site and the macrosite are linked if there exists a path from the ghost site and one of the sites of the two sides marked with arrows; this path can be direct i * * or indirect i —o. 4 —o. * (i = 1, 2, 3). The probability h' = rk(p, h) can be written: —
= p4[1 — (1_h)1 + 0311 [1 — (1_03] +p2q 2( 5 [ 1 _(i_v] + h) +3p473/1.
1
Percolation
298
1/ characterizes the properties of response of the percolation system to an external influence proportional to h, which can decrease the lacunary character of the configurations by improving the diffusion Or by creating "bridges" between the clusters; more explicitly, //' appears in the scaling law obeyed by the characteristic length: (p c , h) h- v , or more » where <1, (z) is analytic in R and non-zero generally: h) at at 0 (to recover the scaling law h = 0) IP Pcl—P), and behaves like 41)(z) infinity (to recover the scaling law (7),, h) h - v' ). We note that h) no longer diverges —
at
p,
if
h
0 O.
Effective couplings method The preceding methods based On a decimation are approximate since quite different configurations end up giving the same renormalized configuration. To compensate for this loss of information, we must refine the description of the renormalized system by keeping track of the initial statistical correlations with the help of some additional parameters: we introduce for example effective couplings between macrosites to compensate for the approximations of the decimation. Unfortunately, iterating the renormalization ad infinitum will generate an infinite number of new coefficients; indeed, after each renormalization, more information on the statistics at small scales (those scales which are eliminated from the explicit description by the renormalization) must be taken into account in the coupling constants, which requires an increasing number of such constants in the model: the renormalization must take place in a parameter space of dimension greater than 1, in fact infinite. The obvious technical problems caused by the explicit analysis of such a renormalization generally appear in problems of Hamiltonian statistical mechanics; they have led to the development of various numerical methods (for example Monte Carlo renormalization group approaches), detailed in § 3.3.4 and which can easily be adapted to percolation.
The method of "macrocells" The operation of decimation can lead from a cell of k d sites to a cell containing Kd rather than a single one as in the method of macrosites. It is made explicit bymacrosite relating the lattices renormalized by Rk and RK. Their characteristic lengths satisfy the relation 4(Rkp)=K(RKp). By plugging in C(P)" we obtain k(IRkp — Per)" obtained by The desired exponent linearizing Rk and RK in the v is KV :1,KP — Per. neighborhood of their common unstable fixed point pe :
dRK
dRk
dp (Pc) ki —
Ki
dp (Mr
log k
—
log K
log [(t) (p ilog [(?) (pc )] )
Although this method is theoretically equivalent to the method of macrosites (corresponding to the choice K =1), its numerical application .(the so-called small-cell method) turns out to be more efficient and leads to better estimates.
7A.3 Renormalization methods
299
The "small-cell" numerical method This method is just the direct numerical application of the above methods. Its guiding principle (Reynolds et al. [1977]) is that it does not seek to make the renormalization Pi = RkPo analytically explicit, but just to realize it geometrically on a large number J of configurations selected with the same probability po . Let us consider the case of a lattice of Nff sites. For each configuration, we cut the lattice into macrosites of k d sites, determine their occupation according to one of the rules defined above, and contract the lengths by a factor of k. Thus we obtain without computation a configuration which by construction corresponds to a realization of probability pl = Rkpa of the lattice of Ne = (No/k) d sites. By the law of large numbers, the arithmetic mean of the average concentrations of the J configurations renormalized n times in this way gives pn . Performing this procedure for different values of pa, ---RD30 (it suffices to restrict to the neighborhood we determine the correspondence pp of p,). In this procedure, the main obstacle is the finite size of the lattice, which limits the number n of iterations, introduces statistical errors in the estimation of A., and induces finite-size effects in the percolation phenomena. To avoid this last difficulty, one can use the so-called large cell method described below, or else make precise use of the dependence of the statistical characteristics of the lattice with respect to its size L ("finite-size scaling") as -
explained below.
The "large-cell" numerical method The general large-cell method (presented in § 3.3.4) can be applied to site—percolation in dimension d by considering a cell L d (Friedman and Felsteiner [1977]). We then obtain the probability R(L,p) that this unique macrosite contains a percolating cluster as the fraction of percolating configurations among a large number of configurations selected with the same
probability p. We have 4"[R(L,p)] e(p)/L since the decimation factor associated to p R(L, p) is L. The scaling law (P)"-'1P /J1 — , to the leading order in the neighborhood of pc , then leads to: (ORlap)(L, pc ) R(L,p) in the neighborhood of the percolation threshold p,. We must, however, be able to make L vary enough to reliably determine the exponent 1/v, as the slope of the graph log L —+log[(aR/ap)(L,p4] for example. The method can be transposed to bond percolation by considering a lattice L d-1 x 2L which is divided into two cells L d . Then R(L,pB) is defined to be the probability that there is a macrobond between these two cells, obtained as the fraction of configurations (selected with the same probability pB) for which there exists a continuous path of elementary bonds connecting the opposite faces (parallel to the separating face) of these two cells. One obtains the same result: (aRlap)(L,pB,,) ,-,-, L 11 '. Note that it suffices to construct
Method using finite-sue scaling laws The counterpart of the distortions induced by the finite extension L of the lattice is the appearance of scaling properties with respect to L; many numerical methods for determining the percolation threshold, p c , and the associated critical exponents are based on these scaling
laws.
300 (;)
Percolation
DETAILS AND COMPLEMENTS: EXPLICIT COMPUTATIONS
The concentration c(L,p) of a configuration selected with probability p on a lattice of linear size L and of dimension d is defined as the number of occupied sites divided by the c(L , p) = p almost total number of sites. The law of large numbers ensures that surely and the estimation of the remainder by the central limit theorem shows that it is < L, which is the case if p is sufficiently far from p,. For fixed L, this negligible when random distance between c(L, p) and p becomes large as p tends to p,; at the leading order in p — pc , we express its average in the form:
pc oo,p)>=p where F(z) is analytic at z and non-zero at z = 0. The constraint < c(L implies that F(z) z at infinity and that a = 1/v. Consequently, we have the following L -1 / since F(0) O. Once scaling law at the percolation threshold: < e(L, p c ) > —p, Pc has been determined, this gives direct numerical access to the exponent v . —
7A.4
Dynamic
aspects
The dynamic aspects of percolation are of two types: • The dynamic properties of the structure; these are internal properties concerning the evolution of the distribution of the clusters and of their characteristics. We can distinguish three classes, respectively describing: —
the spontaneous
relaxation from an imposed configuration to the equilibrium
distribution, described by the relaxation time; — the temporal correlations, described by temporal or spatio-temporal correlation functions and parameters characterizing the stability, the migration and the possible aggregation of the clusters; — the response to external influences modifying p, the boundary conditions or the stability of the cluster; in this case one determines response functions. These properties depend on the nature of the sites and on the meaning given to the fact that they are occupied. An example is adsorption in an atmosphere whose composition varies. We need to know the dynamics of the occupation of the sites and the influence that the exterior constraints have on them in order to study their dynamic aspects: they have no universal characteristics and for this reason we do not consider them further. • The dynamic properties on the static structure, considered as the support of various transport phenomena. Their study is based on a model of static percolation, in statistical equilibrium, entirely described by the geometry of the lattice, its dimension d, its linear extension L and the elementary probability p. The dynamic ingredients to add are the (often random) propagation rules, restricting to the case where this propagation does not modify the static configuration. For example, one studies the diffusion of electricity, of heat or of a test-particle and searches for the (electric or thermal) conductivity and the diffusion coefficients. The critical nature of the percolation threshold is reflected in the divergence of the transport coefficients at p = pc ; like the static quantities, they obey scaling laws with
7,44
301
Dynamic aspects
pd. The advantage of percolation models and the motivation behind their respect to lp static study is that they give support to the study of such dynamic properties of binary disordered media.
DETAILS AND COMPLEMENTS: TYPICAL DYNAMIC PROBLEMS ELECTRIC CONDUCTIVITY . The conducting material is represented by the occupied
sites (or the existing bonds) and the isolating material by the empty sites; we switch a tension between two opposite faces. For p < p c , the resistance Il(p) of the lattice is infinite since the current cannot cross the sample from one side to the other unless there exists a spanning cluster serving as a support for its propagation. For p > p,, the current goes through and subdivides into the different possible trajectories in a way prescribed by the purely deterministic Kirchhoff laws describing its propagation. It circulates only in the backbone of the spanning cluster and not in the dead-end ramifications called dangling (p —PcY, reflecting its critical bonds. The resistance then obeys a scaling law Ft(p) divergence as p tends to p, from above. The analysis can easily be transferred to the computation of the conductivity of a conducting/superconducting mixture; the empty sites, which were previously isolating, and therefore of infinite resistivity, are now associated to the superconductor of infinite conductivity. The study of the passage of a fluid in a porous medium, which is intuitively analogous, turns out, however, to be much more delicate beca.use of wetting phenomena and of the role played by pressure; it leads to the model of gradient percolation (Gouyet (1996]) in which the effective density (that of the bonds which are permeable by the fluid taking surface tension and local pressure into account) is a slowly varying function of the position on the lattice.
Getines, corresponds to occupied of a test-particle sites diffusion of on clusters various models of or existing bonds: equiprobable tests of the different directions (admissible or not) (§7A.1), equiprobable tests of only the different admissible directions, tests in a prescribed order and so on. We typically obtain a diffusion law < D(p)P(P) at the leading order in the limit t —> oo. The value of the diffusion coefficient D(p) and that of the exponent ce(p) depend on the generic characteristics of the chosen propagation rules and above all on p: if p < pc , the particle has a trajectory bounded in such a way that cE(p 0) = 0; since this trajectory grows with the average size of the cluster, D(p) diverges as p tends to pc from below. If on the contrary p tends to 1, the empty sites become very rare and do not influence the asymptotic law, so that the diffusion is normal, with a(p = I) = 1 and D(p =1) 00,o:4. If 0 < p — pc < 1, the diffusion is in general anomalous, with exponent ce(p) E ]0, 11 related to the fractal dimension of the infinite cluster on which the motion takes place. AN ANT IN A MAZE. This picturesque expression, introduced by De
CONTAGION PHENOMENA . The model of forest
fires detailed in §7A.1 also applies to the
propagation of an epidemic. In both cases, the relevant statistical quantity is the characteristic time 7-(p) of the propagation, which diverges at p = pc as the extension of the lattice tends to infinity. The value pc separates the systems where the propagation stops by itself (p < pc ) from those where an infinite number of sites are reached.
302
Percolation
As in the static study, the description of the finite-size effects is essential since systems which are simulated or experimentally encountered are of finite size; the observed results will thus differ from the behavior predicted in the thermodynamic limit, the more so as the percolation threshold is approached. One studies, for example, the average time taken by a test-particle to cross a given zone or the average flow crossing over a finite barrier. One of the theoretical approaches to transport phenomena on a critical cluster consists of constructing, via a carefully controlled algorithm, a fractal structure reproducing the static characteristics of this cluster (determined beforehand): a density equal to that of the percolation threshold, the same degree of ramifi cation, the same static critical exponents, the same fractal dimensions for the real and the fractal clusters, their backbones, their internal contours and their external perimeters. One then has an analytical framework which is entirely known, in which to compute the dynamic exponents and the transport coefficients. In particular, renormalization methods are particularly efficient when we apply them to these models of clusters, which are fractal and thus self-similar on every scale; we cite the example of resistance and of the vibration modes of a Sierpinski carpet, (SierpinsId [1915]), recounted in detail in the book by Gouyet [1996]. If p > pc , the infinite cluster will be correctly reproduced by a homogeneous
juxtaposition of fractal structures of density p and of linear extension
(p).
(;) DETAILS AND COMPLEMENTS: FRACTAL MODELS OF THE CRITICAL CLUSTERS
— The Bethe lattice is an ideal fractal whose ramification degrees are identical at every point and for which mean-field approaches are valid (§7A.2).
— To reproduce the bond clusters and their backbone, one uses the model of Mandelbrot and Given [1984], with generator:
11•1•111=11111•1
-R-
-
"Squig fractals" are algorithms, proposed by Mandelbrot [1984), to construct a random structure with controlled stochasticity by cutting certain bonds with a prescribed probability at each step of an algorithm, which leads to an ideal but random fractal; such models have more flexibility for reproducing the random nature of real clusters.
REMARKS AND BIBLIOGRAPHICAL NOTES A first approach to percolation phenomena, concentrating on fractal properties, is given in Gouyet [1996]. For a complete introduction to the subject, one can consult the very accessible book by Stauffer [1985] or the more recent one by Stauffer and Aharony [1992]. Further classical references are the books by Essam [1980], Kesten [1982] for the mathematical aspects, or Grimmett [1989]. One can then look at more specific articles presenting the main advances of research in the domain of percolation; Stauffer [1979 ] considers the scaling
properties of percolation clusters, Bunde and Havlin [1991] propose a systematic survey of
7,4.4
Dynamic aspects
303
the essential results concerning static properties of the clusters on the one hand and their dynamic properties on the other, as supports for diffusive phenomena; Mandelbrot [1984 ] emphasizes the modeling of percolating systems with the help of fractal structures; Havlin and Ben Avraham [1987] and more recently Isichenko [1992] emphasize the study of transport phenomena, in very dense survey articles. More specifically, diffusion on the percolation cluster is studied for example in Aharony [1984], [1985], Alexander [1986], Harris et al. [1987] or, in the context of electric conduction, by Kirkpatrick [1973], Bergman [1989], Clerc et al. [1990]. A more general reference on dynamic phenomena in percolation lattices is the collection of articles edited by Klafter et al. [1986]. Among articles exploiting renormalization in the context of percolation, we cite the fundamental ones of Shapiro [1979] and of Reynolds et al. [1980], and the survey by Stanley et al. [1982]; see also Vicsek and Kertesz [1981] or Gawlinski and Redner [1983] for the extension to a continuous medium, and Nakanishi and Reynolds [1979] for the extension to a model of site-bonds. More generally, concerning the physics of random media and disordered systems, one can consult the conference proceedings edited by Deutscher, Zallen and Adler [1983 ] , by Pynne and Skeljtorp [1985 ] , by Pynne and Riste [1987], and by Pomeau, Guyon and Nadal [1988].
Appendix I 111.11
01.,,
...,,,m11■111■.•11.1•■
Measures and probabilities In this appendix we introduce some notions of measure theory used in the main text, for example invariant measures associated to a dynamical system ( 5.1.1, §5A.1), the Boltzmann—Gibbs distribution in statistical mechanics (§2.1, §4.3), the distribution law of a stochastic process and the transition probabilities of a random walk ( 6.1.3). We deal successively with measures and the associated formalism (1.1), random variables and the adapted notions of convergence (1.2), and stochastic processes, in particular those possessing the Markov property (1.3)
1.1
Measurable spaces and measures
A measurable space is a pair (E ,13) consisting of a set E and a a-algebra B, where a a-algebra is a subset of the set P(E) of subsets of E, containing 0 and E and stable under differences [(A, B) —4 A — IA and countable unions (and therefore also under countable intersections and taking complements). The elements of 8 are said to be 13-measurable. If E is countable, B is the discrete o.-algebra P(E) generated by the singletons. If E is a topological space, we take the g-algebra B to be the "Borel a-algebra" generated by the open sets of E. From a physical point of view, the elements of the c--algebra B are the observable subsets of the phase space with the resolution we are using; a real non-measurable function on B, i.e. such that the inverse image of a Borel subset of R is not necessarily in B, cannot be specified experimentally and thus has no reality in the physical description under consideration. Taking a worse resolution restricts to a sub-c--algebra of B. A measure is a real, positive and a-additive function (with values in RU {±a3}) on B; a-additivity is a notion of additivity extended from finite to countable sums, which states that for every countable sequence (Ai)i> 1 of pairwise disjoint measurable subsets, we have:
( 00 M
U Ai)=
00
E m(Ai)
(with Ai €1 Aj = 0, Ai E B)
Consequently m(0) = 0, m is simply additive and rn is increasing for inclusion. From a physical point of view, a measure gives a weighting of the subsets of E, which have a well-specified "weight" only if they belong to B. The measure rra is said to he bounded if rn(E) < oo. A subset of is said to be (B, m)-negligible if it is contained in a Bmeasurable subset of zero measure. A property which holds except on a negligible set is said to hold rn-almost everywhere (or rn- almost surely if at is a probability), which introduces a notion of genericity in a measure--theoretic sense. A probability 'measure is simply a measure such that rn(E) = 1: a bounded measure can always be normalized
e
306
Measures and probabilities
into a probability measure. The support Supp(m) of a measure m on the topological space E endowed with its Borel a-algebra B is the largest closed set outside of which the measure is zero: Supp(rn) = X — U {U open, m(U) = To every measure m we associate an integral over E, uniquely defined by the relation m(A) = f 1A (t)dm(s) where 1A takes the value 1 in the measurable subset A and 0 outside. We write L i (E, B, na) for the set of m-integrable functions; this set consists of all the real and measurable functions f on (E, B) whose modulus f is the limit of an increasing sequence of step functions of integrals converging to a finite quantity, written f If(x)Idm(x) and called the integral of f with respect to m. A measure m i is said to be absolutely continuous with respect to a measure m 2 on the same measurable space (L, B) if every m2-negligible subset is also m i defin The theorem of Radon Nykodym then shows that there exists a positive-negli ble. m2-measurable function p, unique up to a function which is m 2 -almost everywhere zero, such that dm i (s) = p(s)dm 2 (x). This function p is called the densdy of the measure m 1 with respect to the measure m2, —
1.2
Random variables and stochastic convergence
A random variable defined on the probabilized space (Ft, T, P) and with values in the measurable space (E, 13) is a measurable function w X(w). Its probability law is a probability measure vx defined in (E, B) by: x (B) = P({w
X(w e 13))
for all B G
Its random nature is a consequence of the fact that we are not describing the correspondence w X(w) but only the probability law ux, defined on the image space (S, B) deduced from it. This reduction occurs when only the statistical properties of X are observable. Below, we restrict ourselves to real variables. If the probability law vx is absolutely continuous with respect to the Lebesgue measure dx on R, we introduce its distribution of probability (or density of probability) Px defined by dvx (x) = px (x)dx. It is a positive function and it is Lebesgue-integrable if the measure is bounded. The moments of X are defined as the statistical averages < X written:
>, which are
<X' >.= X"(w)dP(w) = s'clux(s) < X > is the (statistical) mean and < (X— < X >) 2 >=< X2 > — < X > 2 the variance of X. u >. It has complex The characteristic function of X is defined by: fx(ii) = < dx values and is continuous at u = 0 (where its value is 1) and even uniformly continuous on R. The moments of X exist up to order k if fx is k times differentiable at 0; the converse is also true for even k, and fx is related to the moments by: [cr fx MO] (ta = 0) = (0" <X" > Two random variables X and Y defined on (S2, T, P) and with values in measurable spaces (e , A) and (.7% B) are statistically independent if the joint probability law vx , y is
Appendix 1.2
307
Random variables and stochastic convergence
the convolution of the individual laws vx and vy, i.e.: v(x,y)(A x B) = vx(A) 1/Y(B) where P([X E A, Y E = P([X E A.]) PUY E B)) for A E A and BEB.A consequence (i.e. a necessary but not sufficient condition) of the independence of X and Y is that their covariance Cxx < XY > < X >< Y> is zero. -
We define the conditional probability measure of Y with respect to X by:
P(Y E B, X E A) ppc
PO' EBIX A)=
.
EA)
If all the moments of X are defined, the function gx (u) =< exp(uX) > and 0 of Gx , called the the logarithm Gx(u) are analytic on R. The expansion at u cumulative expansion of X, defines the irreducible moments «X" >>i„ of X: oc,
Gx(u) = n=1
11 '
The irreducible moments of order greater than or equal to 3 are zero for a Gaussian (27r0r 2 ) -1 exp{-(x - m)2 /2c 2] (of mean m and variance (7 2 ): thus density p„,,,(x) they measure the distance between vx and a Gaussian law. Let [X,] >0 be a sequence of real random variables defined on (R, T, P), One can define different notions of the stochastic convergence of this sequence to 0:
— Almost-sure convergence : P({c.) GS -2, lim X(w) = 0}) = 1 -P
CO
— Lr -convergence (convergence in mean of degree r): lim — Convergence in probability:* > 0, Jim
1Xn(w)i r dP(w) -7--
> 6) -= 0
71-• 00
—
Convergence in law: for any Borel set B, writing vx„ for the probability
distribution of X„:
lim vxy, (B)
n
=1
if 0 G B
= 0
otherwise
This is equivalent to pointwise convergence (which is in fact uniform on every compact subset whenever it occurs) of the characteristic functions [fx], >0 to the constant 1. Let us summarize the various convergences and their relations:
a.s. L
in probability
>
in law
L f (r < s)
Amongst the convergence theorems, we use the law of large numbers and the central limit theorem ; we state them here in their simplest form. Law of large numbers: If (XJ )1> 1 is a sequence of independent identically x. distributed random variables of mean m, then the random variable n ) converges almost surely to the statistical average m =< X >.
Measures and probabilities
308
Central limit theorem : If (X 1 )1>1 are independent and identically distributed with mean rn and finite variance o- 2 , then the random variable Eln,=i (Xj -7n)RF1 converges . in law to the centered Gaussian law of variance These two results are involved in an essential way in the statistical study of a sequence of observations (xj)i >1, assumed to be independent realizations of a single random variable X.
1.3
Stochastic processes and Markov chains
A stochastic process is a family [147),]), E A of random variables defined on a given probabilized space (S-2, T, P) and with values in a given measurable space (X, B). The process is said to be discrete if A is countable, continuous otherwise. We speak of temporal processes if A = t E R, spatial processes if A = E Ra , and spatio4emporal if A = t) G Rd+ 1 . The process is real (or scalar) if X = R (endowed with its Borel o--algebra). The global probability law P of the family [147),]), E A is uniquely related G A, ...A, E A}, defined for all finite to the finite joint probabilities n-tuples (B1, ..., Bfi ) of elements of B by:
x B2 X ... X B) = Prob[W(k) E B1, W(A2) E B2 ) —1W(An) E Bn] Thus they suffice to describe all the statistical properties of the process. A temporal process is said to be (statistically) stationary if P is invariant under changing the origin of time; it suffices to express this property on the finite joint probabilities: = Pt 1 +e,..,t n +6 for all n > 1 (n finite), t1 < < t and 19 e R. A spatial process W(i) is said to be (statistically) homogeneous if P is invariant under changing the spatial origin, which is equivalent to: = P2 1+ 0 0,— ,Zre.+XO for every Yo E Rq and every n-tuple of points of Rg. A scalar process is said to be isotropic if P is invariant under rotation, which can be tested on the finite joint probabilities: for every rotation R, P±,,. , t „ = The space-time correlation function of the real process W(.i, t) is given by:
p, s) =< [W(, t)— < w(i, t >;:.] [w(9, s)— <
s) >..;]
It depends only on It - s if the process is stationary; only on - if it is statistically homogeneous, and only on I Pif it is isotropic. It has great physical relevance, since it measures the statistical autocorrelation of the process in space and time. Frequently what is actually studied is its Fourier transform, since in the case of a stationary and homogeneous process, the modes (, co) in the conjugate space appear as random variables with vanishing covariance (App. IV.2). The process is said to be Gaussian if and only if its finite joint distributions are Gaussian; its global law P is then specified by the knowledge of: in : :
R R, R x R 1 4 R, -
rn(t) = < W (t) > C(ti, t2) < [W(ti) - rn(ti)][W(12) - ni(t2)] >
309
Appendix 1.3 Stochastic processes and Markov chains Three viewpoints
The process [Wi]t>o can be considered from three points of view; this discussion relates the analysis of stochastic processes to the analysis of dynamical systems and helps us to understand the construction of the adapted renormalization techniques
(§6.2). The canonical viewpoint: we associate to [147t] t>0 the triplet (X, 6, i3) called its canonical process. This correspondence is not injective since it does not involve the dependence of the values of -Kit with respect to the w G S-1; (X, B, P) is thus the canonical process of several different processes which in that case are said to be equivalent. The random-function viewpoint: we consider the process [Wth>0 as a single random variable on (S2, T, P), with values in a function space to each w G S2 there corresponds a function [t Wi(u))] G The deterministic viewpoint: we can always consider [Wt] t>0 as a deterministic Wt (co))1 of R. into X' . Such a viewpoint is impossible if we know (co evolution [t only the canonical process associated to [W ] t > 0 . The advantage of this point of view is that it makes all the results relative to flows applicable to processes, and allows us to adapt the essential notions of ergodic theory to them as well,
Markov Chains A sequence [Xn],l>o of random variables with values in a measurable space (X, B) is a Al arkov chain if its conditional probability measures have the following property, for all B E B and all X and so, E X:
i _ n = Sn, Xn-1 Sn-1, •••) X0 = P[Xn+i G _RIX
Sol
= P[Xn+1 E BIXn =
syi]
This property is the analog for discrete stochastic processes of the notion of a discrete dynamical system x„ ÷ 1 = f (x) encountered in chapters 2 and 5. It reflects the absence of memory of the system described by the sequence [X,]> 0 since the knowledge of its state at an instant n entirely determines its later evolution, without involving its "history" previous to the instant n. The simplest example is that of a process with independent increments. The statistical properties of a Markov chain are entirely specified by the elementary transition probability pi (t, x; .), i.e. the probability law on (X,.13) defined by pi (t,x; B) P(X t+i E BIXt = x) Indeed, we deduce the composition law' directly from the definition; it is called the Markov property and gives the transition probability p, On an interval of n steps:
pn (t, x; B) -72 P[X t+„ BLX t = xl pn _ k (t /, y; B) d y pk(t , x; y) fyEX [p,_k * pid(t, x; B), k any integer between 1 and n — 2 'It recalls the group-theoretic structure of the flow generated by a dynamical system.
Measures and probabilities
310
The probability law qn, at the instant n is given by qy, = py, * qo and satisfies qn+k = pn 9c qk for all integers k and n. The notion of stationaraty of a Markov chain includes two independent aspects (it is possible for each one to be present without the other): — on the one hand: the independence of the transition probability p i (t, x; B) with respect to the time t, to be compared to the autonomous character of a dynamical system; — on the other hand: the independence of the instantaneous probability law q t respect to the time t, to be compared to a fixed point of a dynamical system. with From now on we assume that the transition probability p i. is independent of L If the space of states X is finite, with N elements X = (x 1 , x N } , then the elementary transition probability is a positive N x N matrix M whose elements are given by: M11 = Pi(xi, xi)
independent of t E N
P(Xt-fi siiXt =
Writing q(t) = P[Xt = x i], M determines the instantaneous probability law: for all i 1, ..., N, we have [M. q(t)]i
E
qi (t +1)
Vt
E N q(t) =
M t . q(0)
1, from which we deduce Mjj Since M is a transition probability, it satisfies that Det(M 1) = 0: thus it admits at least one eigenvalue equal to 1, whose eigenvector is a time-invariant probability q*. By introducing the norm IM1 = qi' one checks that iiM.qii = liql I (since qi > 0); we deduce from this equality that the eigenvalues of M have modulus less than or equal to 1. Consequently, q* is a stable fixed point. Writing II for the projection onto the eigenspace associated to the eigenvalue M. = H. q where II. q is invariant. 1, one checks that
Ei
REMARKS AND BIBLIOGRAPHICAL NOTES Let us indicate some books containing more complete expositions of the notions briefly covered here. Measure theory is treated in Halmos 1958] and Billingsley [1979]. For the basics of probability theory, we first cite the book by Kolrnogorov [1956], who founded, around 1933, the axiomatisation we use today; classical references are Renyi [1970], Feller [1971] or Gnedenko [1973]. The convergence of sequences of random variables and the associated limit theorems axe given in the monograph by Lukacs [1975] and in the one by Gnedenko and Kolmogorov [1954], which specifically treats sums of independent variables. Generalized limit theorems are given in Bouchaid. and Georges [1990] and Doukhan [1995]. Basic reference on stochastic processes are Doob [1953], Karlin and Taylor [1994]; for Markov chains, we refer to Revuz [1975] and Chung [1967] for their asymptotic properties. Important articles on processes and on the notion of noise which they are used to model are collected in Wax [1954]. For the use of processes in a physical context, consult the books by Gardiner (1985], Haken [1983b] and Van Kampen [1981]. [
Appendix II Dynamical systems In this appendix we define the language needed to present the analysis of dynamical systems via renormalization (chapter 5), and in a general context, to describe the properties of a renormalization operator and of the flow generated by it ( 3.1). We distinguish discrete dynamical systems (1I.1) which are simpler to study, from continuous dynamical systems (11.2), which are closer to physical evolutions. The stable and unstable manifolds of a flow, which occur in the study of renormalization operators around the critical fixed points, are introduced in 11.3. At the end we gives some notions of ergodic theory (II.4).
II.1
Discrete dynamical systems
A discrete dynamical system is a pair (X, f) consisting of a set X (typically an open set of a vector space ) and a map f from X into itself. X can be interpreted as the phase space of a physical system, of state xr, E X at the instant n. The map f is the evolution law; it determines the state at the next step, via 5 44 = f(x,,); it will always possess all the necessary regularity properties. The orbit of x o E X (or the trajectory coming out of s o ) is the sequence Er (x 0 )1,> 0 of successive states if the initial state is fn(x) of X x N into X. given by s o E X. The (discrete) flow is the map (x, n) The system is said to be autonomous if the transformation relating x,., to xn+1 does not depend on n. In this case, the orbits coming out of xo at different instants coincide, so that two orbits are either disjoint or included in each other. Autonomy corresponds to invariance under changing the origin of time. A fixed point of a dynamical system is an element x* G X such that f(x*) = thus it is a state of equilibrium. The linear analysis' 73 of the discrete flow at x* consists in determining the eigenvalues (Aj)j of the stability matrix Df(xs) and the associated normalized eigenvectors (ei )i . If y is near x*, we decompose it in the form 174 : y = x*
ci(Oei O(HY11 2 )
(cj(y) E R)
The coefficient ci (y) measures the projection onto the direction ej of the distance y — x* between the state y and the fixed point x* . The decomposition of the state algebraic notions needed for linear analysis are introduced, for example, in Dunford and Schwartz [1958]; see also the reference book by Dunford and Schwartz [195S ] for an exhaustive presentation of linear operators and their properties. 174 We restrict ourselves to diagonalizable matrices; for a matrix having a k xk Jordan block associated to the eigenvalue , a polynomial dependence of degree k — 1 with respect to time n. is added as a prefactor to the dependence fr. 173 The
312
Dynamical systems
fn(y) after n steps gives: (y)
E c,(10[Df(x.)n.e 1 l + Q(IIH 2) = x + E
(y)A7 ei + 0 (110 2 )-
i
The relation ei [fn (y)] the following behavior:
ci (y)+ 0(4 11 2 ) show s that, at the leading order, we have
— if I.Ajl < 1, ci[fn (y)] decreases to 0 like lAj In ; in X, the physical system approaches its state of equilibrium 2-,* in the direction ei , which is thus said to be (linearly) stable (referring to the mechanical notion of stable equilibrium). — if I Ai I > 1, ci[fn (y)} diverges as lAf
the direction ei is said to be unstable.
— if 1, = 1, then c.i[fn(y)]l is constant; the associated direction ei is said to be marginal and corresponds to the notion of indifferent equilibrium in mechanics. The stable directions (Pt I < 1) generate the stable subspace E of the flow at e; the unstable subspace .Er' is constructed similarly (with the directions for which 1,)t > 1) and the central subspace EC also (directions for which I I = 1). The phase space 175 decomposes into a direct sum X = Et ED EC OE', The analysis of the non-linear terms shows that if no eigenvalue has modulus 1, the exact flow and the linearized flow are homeomorphic near x' , so that it suffices to study the stability of the latter.
Let [X, (f0 0 ] be a family of discrete dynamical systems, depending regularly on a parameter p and such that fi, D has a fixed point xtl . If D WO has no eigenvalue of modulus 1, the implicit function theorem can be applied to f1 (x) — x and states that has a fixed point x p is near po and that the stability matrix D f ( em ), together with its eigenvalues and its eigenvectors are regular with respect to p.. The passage of an additional eigenvalue through the unit circle (lAi(p i )1 = 1) when p reaches p i a change of stability, or even to the disappearance of the fixed point forcorespndt (x*0 i ) is no longer invertible. The qualitative change observed > pi since rd — at p = pi is called a bifurcation. The generic bifurcations are represented in figure Hi; any other situation is destroyed by arbitrarily weak modifications of fo . Generalizing the notion of a stable fixed point, an attrador is the smallest closed subset A of X which is invariant under the action of f (f[A] C A) and contains the accumulation points (as the time n tends to infinity) of all the trajectories coming out of an open set 14 containing it. We generally add a constraint of contraction of U under the action of f, making fn[U] tend asymptotically to A. The set of initial conditions generating a trajectory which converges to A is called the basin of attraction of A.
175
1f X is
a differentiable manifold, one decomposes the tangent space Tv. X.
Appendix 11.2 Continuous dynamical systems
313
A (p)
ŒA(p) (p)
(b) : Hopf
(a) : Pitchfork
(c) : Saddle-node
Figure 11.1 - Generic bifurcations of discrete dynamical systems in a discrete parametrized dynamical system [X, (f 0 ) 01, the destabilization of a fixed point zo(p) is observed at p = po if the modulus 1A(p)1 of the eigenvalue of maximal modulus of Dfp (x 0 (p)) passes through 1 when p reaches the bifurcation value po . This can happen generically in three different ways: (a) Pitchfork bifurcation: A(p o ) = —1; the fixed point still remains for Jt > pa but is then unstable; it gives rise at po to a stable 2-cycle; the normal form is t(x) = 1 — px 2 (po = 3/4) (see figure 2.2, §2.2.2). the fixed point (b) Hopf bifurcation: A+(po) = e'w and A - (p0 ) still remains for p > po but is unstable; it is replaced by an invariant circle on which the motion is a rotation of angular momentum co; the associated normal form is given in polar coordinates by Mr, 0) (pr r 2 , 0 + w) (p a = 1) ( 5.4.2). (c) Saddle-node bifurcation: A(po ) = +1; the stable fixed point coalesces with an unstable fixed point at pa; they both disappear for p > pa ; the associated normal form is fp (s) = p + 5 2 (po = 0). A symmetric form is given by f (X) = p+ 2; — 5 2 (pa = 0), for which the fixed points exist for > 0 5 . 3 .4
11.2
Continuous dynamical systems
in physics, one often prefers to model "continuous" evolutions over time 176 ; this gives rise to the notion of a continuous dynamical system, Le. an ordinary differential equation of order 1:
EX
t ER
d.Xt = V(t, X 1 ) dt
Typical examples are the equations of motion in celestial mechanics and chemical kinetic equations. The notions introduced in the discrete case can be transposed to continuous systems. In the general case, X is a differentiable manifold; V is then a tangent vector field. We restrict ourselves to differentiable systems, for which V has 176 The variable t often denotes time, but the theory of continuous dynamical systems can be applied to any equation of this form, whatever meaning t may actually have,
Dynamical systems
314
the regularity properties ensuring the existence, the uniqueness and the regularity of the solution [t 9a(t , s 0 , 0] of initial condition c,o(t o , s o , to ) = x o , called the trajectory corning out of s o at time t o . The uniqueness of the solutions leads to the "generalized group-theoretic law" 00,x0,t2)
0(ti
(1
t2 E R)
(Yso E
(p(t o , s o , t t o + 5)1. The (continuous) flow 177 is the set of trajectories {(s, s o ) does not depend V if its velocity field A dynamical system is said to be autonomous explicitly on time. One can always reduce to this situation by adding a "pseudotemporal" dimension to the phase space X: (dZidt)(t) =
Z(t) = [st t, X] ERxX
v(stl, xt)
For this reason, we always consider autonomous dynamical systems. Autonomy is cto(t) is a equivalent to the invariance under a change in the origin of time: if L io(t + 0) for any interval of time O. The flow is stationary trajectory, then so is t and frozen, and the solutions depend only on the duration t - t o of the evolution starting from the initial condition so : c,o(t o , s o , t) = Ot-t 0 (x0). Autonomous flows are thus one-parameter groups of diffeomorphisms of X for the composition law 0, which is isomorphic to the group (R, -F) since:
Ot=o= Idx
0 1
0 t —
Of
0
Os
=
The parametrized curve (9 = {0 t (s 0 )1 tER is called the orbit of s o . It is a subset of X invariant under the action of the flow. A subset y of X is said to be invariant under the action of the flow if C Y for every real number t (the relations Ot C _t[y] C y and 15_ t oq5t = O t o (b_ t M x actually imply the equality); this is the case if and only if y is a (countable or not) union of orbits. The orbits are either disjoint or identical, and form a stationary partition of X, called the phase portrait, which helps visualize attractors and their basins of attraction. The fixed points X* are the solutions of V(X*) = O. The spectral analysis of the stability matrix. DV(r) (also called the Jacobian matrix) determines the behavior of the flow in the neighborhood of X*. Decomposing the initial condition Yo = X * +Ei + 1 2 ) , the linearized flow at X* can be written:
(my]
Y(t) =
Y,
E
+ 0(113112)
The criterion of stability (for increasing t) of the eigendirection ej, with eigenvalue , is given by R('yi) < O. Bifurcations of the continuous flows are thus observed when the eigenvalues cross the imaginary axis (R(7) = 0).
hydrodynamic analogy is obvious: t so(to, x o , t) describes a trajectory of particles or volume elements of a fluid in motion, and V(t,x) is the velocity at time t of the particles passing through re at t. 177 The
Appendix 11.3
11.3
Stable and unstable manifolds
315
Stable and unstable manifolds
To present the local non-linear analysis near an equilibrium state x* E X, we will restrict ourselves to discrete flows. Our goal here is only to explain the results used to study the action of renormalization operators in the neighborhood of their critical fixed points. The simplest case is when the matrix Df(e) is diagonalizable, having (unstable) eigenvalues of modulus greater than 1 and (stable) eigenvalues of modulus less than 1, but no eigenvalue of modulus equal to 1. In this situation, the fixed point x* is said to be hyperbolic 178 and X = E" ED E'. The non-linear analysis of f associates a (local) stable manifold V and unstable manifold VI' to it as follows':
E /I such that lim r(x) = x} =
= {x E 14 such that ](yr, )n
YI2
E U,
E U such that Vn > 0, f'(x) E
r (yr,) = x
and lim y, = VI -foc
for a sufficiently small neighborhood Li of x* . These manifolds V' and V' are invariant under f; their intersection is the fixed point x* and their tangent spaces are E' and Eu respectively. This situation is summarized in figure 11.2. The results can be transposed to continuous flows: the stable directions are those associated to negative eigenvalues of the stability matrix at x* and the unstable directions are those associated to positive eigenvalues; the hypothesis that x* is hyperbolic corresponds to the existence of positive and negative eigenvalues and the absence of zero eigenvalues.
Construction of the manifolds V' and Vu One of the methods used to construct these manifolds is to express them as graphs; we will discuss the case where f is analytic in R2 in the neighborhood of a hyperbolic fixed point x* = O. The stability matrix Df(0) then has two eigenvalues A and kt of moduli 1AI > 1 > F,L E' and Eu, being taken as axes, define coordinates (x i , x 2 ) in which D f (0) is diagonal; we write fi and 12 for the corresponding components of f , We look for the local stable manifold in the form:
V' = ilsi,s2 = G(xi)J 'xi E 1= [—a, all The choice of I ensures the local nature of the construction. The invariance of V' under the action of f is written as: for all xi E f , f2 [x 1 , G(x 1 )] = G [fi(x , G(e i ))) After Taylor expansions of f and G at 0, the order by order resolution yields the derivatives of G at 0: G(0) =
0
C(0) = 0
G"(0) = 2 a i f2
P— A The fact that G vanishes at 0 simply means that the fixed point (0, 0) belongs to the manifold; the vanishing of G'(0) expresses the fact that the first order (i.e. linear 178 The
definition is more sophisticated in infinite dimension: it then specifies bounds on the norms of the projections of D f (e) onto E"" and Er and on their inverses; we refer, for example, to Hirsch and Pugh [1979]. 179 See Lang [1962] for the notion of a differentiable manifold.
Dynamical systems
316
approximation) of the local manifold V' coincides with .613 , which is thus indeed its tangent space. The non-linearities of the evolution appear in the derivative G"(0), which is in general non zero and related to the curvature of the stable manifold at the fixed point. A similar procedure is possible for the local unstable manifold, expressed as V" = {[x 1 ,x 2 = 11(x i )],x i E I}. -
The procedure extends to higher dimensions, by using the graphs of functions of several variables. More generally, a local inversion theorem shows the existence and the regularity of G and of H in the neighborhood of a hyperbolic fixed point, which implies that the local manifolds are conjugate to their tangent spaces and that we can "straighten" them in a differentiable way. Their curvature estimates the non-linearity of the flow in the neighborhood of the fixed point x*.
Figure 11.2 - The stable and unstable manifolds of a hyperbolic fixed
point If x* is a hyperbolic fixed point of the discrete system (X, f), there exists a unique pair (V 5 , V') of manifolds invariant under the action of f and tangent at x* to the vector spaces E3 and Et` respectively (these spaces are non-trivial and their direct sum is X by hypothesis on e). V' is the stable manifold and Vu the unstable manifold at x*. The dotted curves sketch the discrete trajectories. The diagram would look identical in the case of a continuous flow (with the suitably adapted assumptions of regularity and hyperbolicity).
Appendix 11,4 Ergodic theory
317
Central manifolds The local non-linear description around the fixed point x* becomes delicate if one or more eigenvalues have modulus 1. It is a situation of bifurcation: although it is not generic in the parameter space, it is important because it marks the transition between two qualitatively different types of behavior of the flow. Unlike the stable and unstable manifolds, which are unique and as regular as f, here we can in general construct many (in fact an infinite number of) invariant manifolds tangent to Ec , called central manifolds; they are less regular than f. The exact flow and the linearized flow are no longer conjugate, so that we cannot identify them around x* . The behavior of the flow transversally to E remains simple, controlled by the stable directions if one starts on V' and by the unstable directions if one starts outside V' and the central manifolds. However, there exists no absolutely general result concerning the behavior of the flow in the marginal directions. Figure 11.3 illustrates a possible situation.
Figure 11.3 - Central manifolds If the flow has a non trivial central space E', there exists an infinite number of central manifolds (drawn in boldface), invariant and tangent to Ee at e. On the contrary, the stable manifold Vs is unique. The figure represents a possible situation in dimension 2. -
11.4 Ergodic theory The above notions of differentiable geometry are supplemented in the framework of measure theory by introducing a weighting on X adapted to the evolution, called an invariant measure. Here one enters into the domain of ergodic theory; let us describe some of its basic notions. Let f be a transformation of the measurable set (X, 13, m) into itself. One speaks of — invariance when, for every measurable subset B, one has rn(f -1 [B])
rn(B)
318
Dynamical systems
or, in functional form, when for every dm-integrable function F, one has
f
F o f(x) drn(x) =
F(s) dm(x)
— ergodicity when every measurable subset which is invariant under f has either zero or full measure, i.e., writing A for the symmetric difference of two sets:
VB C B, (B A f -i [B]) rn-negligible == m(B) = 0 or rra(X - B) = 0 or, in functional form, if every dm-integrable and invariant function F(i.e.Fof=F holds tn-almost everywhere) is m-almost everywhere constant. — mixing , which is a property holding when one has for a measure m normalized to 1: VA E B, VB E B, lim rra[A n
oo
n f - n(B)) = m(A) m(B)
(with m(X) = 1 )
or, in functional form, for two dm-integrable functions F and G: nliTo
F 0 J.' (x) G(x) dm(x) = f F(x)drn(x) f G(x)clrn(x)
Birkhoff ergodic theorem (Birkhoff [1931]) This theorem, which is a basic result of ergodic theory and of its applications, states that ISO: If the measure m on (X, 13) is invariant and crgodic with respect to the transformation f, then for every real dm-integrable function F, there exists a set X, of full measure (i.e. such that m(X, - X) = 0) such that: Vso E tÇ
F(fi(s 0 ))=
lim n
n oo
F(x)drn(x) A'
0<5
Lyaptinov exponents (Lyapunov [1906]) We give the definition of the Lyapunov exponents only in the case of a space X which is an open subset of R, since this is enough to obtain a qualitative understanding of the notion; the (more technical) extension to dimensions greater than 1 is given in §5.1.3. For every evolution law f defined from X c R into itself and every element xo E X, one constructs: 7(f , s o ) = lim inf log (Kr ) 1 (so)li = lim inf n --+ ix)
72-P QQ
71
1
E
log I
(xo))1
0<<
The invariance 7(f, S o ) =7[f, f(x0)] ensures that 7(f, .) is ni-almost everywhere constant, equal to (f, m) for every rn-invariant and ergodic measure under the action extends to flows () E R: Vxo E Zm, lim t — o.
lot F(0,(x 0 ))ds
=
f F(x)dm(x).
Appendix 11.4 Ergodic theory
319
off. Birkhoff's ergodic theorem then proves the existence of the limit (thus lirn inf can be replaced by 1irn) and gives its value:
IR
log It (x)Idm(x)
There are as many exponents as there are invariant and ergodac measures under the action of f. A priori, the Lyapunov exponent has no regularity properly with respect to f except, for example, if f has a stable cycle (x i , x2, ••,
in = N -1
E 1<j
ö
and ,y(f, m) = N -1
E
log ./.'(x j )1= log l(f N ) 1 (x.i.)1<
1<)
where the expression log l(fN)(si o ) of 7(f, m) does not depend on the element 2!) ,, of the cycle. In the general case, 7(f, m) cannot be expressed in terms of f only, reflecting the fact that 7( f , m) is not a characteristic of f but a global characteristic of the flow [(x, n) fn (s)] generated by the iteration of f. The Lyaputiov exponent of a continuous flow Of (s) in X C R. is defined by 7(0 , m) = limT,,,o log 10!/.(x)1, for all x E Xm , where m is an invariant ergodic measure and Xrn C X is of full measure.
REMARKS AND BIBLIOGRAPHICAL NOTES First among the many books devoted to the theory of dynamical systems, we cite the fundamental books by Poincaré [1880], [1892], Birkhoff [1927], Whittaker [1944] and Srnale [1967]. Perko [1991) is a recent introduction which is both complete and accessible. The mathematical foundations are given in Coddington and Levinson [1955], Arnold [1974], or Hirsch and Stnale [1974]. For the geometric aspects, see Brin and Katok [1983]. Abraham and Shaw [1984) is interesting for its figures, Guckenheimer and Holmes [1983] for the numerous examples it contains. The linear analysis of stability of an attractor (a fixed point in this appendix) and the associated theory of bifurcations are presented in the course by Ruelle [1989c]; they are investigated more deeply in Moss and Joseph [1981], Chow and Hale [1982], and Guckenheimer and Holmes [19831. The properties of stable and unstable manifolds are considered in Hirsch and Pugh [1970] and in Shub [1986]; Carr [198]] details the particular role played by the central manifolds. For an introduction to ergodic theory, a good beginning can be found in the very accessible course by Halmos [1959], where the essential notions are presented; in particular the proof of Birkhoff's theorem (Birkhoff [1931]) can be found there. A more recent introduction is given by Sinai [1976]. Some more exhaustive texts are Billingsley [1965], relating ergodic theory to information theory (Khinchin [1957]), Arnold and Avez [1967 ] , emphasizing the physical consequences of the ergodicity of an evolution, and the recent book by Mane [1987), where ergod.icity is replaced in the framework of dynamical systems.
Appendix III Thermodynamic formalism In this appendix we recall some notions of statistical physics used in the main text. In MA, we discuss the macrocanoniccd description of an isolated system, and in 111.2 the canonical description of a system at thermal equilibrium with a thermal reservoir. We introduce the notion of thermodynamic limit, and sketch the generalization to continuous systems.
Let us consider a physical system S made up of N subsystems (or "particles") of
size a equal to the minimum scale (the "resolution") of the description, so that one cannot perceive the fine structure of these subsystems. Each particle j is described by a set of quantities denoted s E E; the state of S is described by a microscopic configuration [s1N = (si)i<j
111.1 The microcanonical ensemble The system S is assumed to be isolated, exchanging neither mass, nor heat, nor work - so no energy at all - with the exterior. The space S of possible states is thus contained in the hypersurface of constant energy configurations E, where it is bounded by the other constraints of conservation imposed by the fact that S is isolated. The statistical description of S is based on the macrocanonical hypothesis183 stating that all the accessible configurations are equiprobable. Let S2(Ar, E) be the number of such configurations, equal to the cardinal of L. Each configuration occurs with the same probability [1(N, E )J -1 . The (dimensionless) microcanonical entropy is defined by cr(N E) = log Q(N, E). It is zero if S can take only one configuration, which is then entirely specified by giving E. It increases with the number of possible states, i.e. with the degeneracy of the energy level E: it measures the lack of information about the 181
This hypothesis is discussed in § 5A.4 in relation to ergodic theory.
322
Thermodynamic formalism
con fi guration of S when only its energy E is known. It satisfies:
cr(N, E) = -
E p(N , E , [s]) log[p(N, E, [s])] [3)EE
Among the distributions of probability on E, the value p(N E, [s]) = [Q(N , E)] -1 realizes the maximum of - E[s} p([s] ) logp([s] ). This is exactly the content of the microcanonical hypothesis: the minimal information necessary to specify the statistics of an isolated system S is the knowledge of the constraints on L. The probability that an internal quantity A of S takes the value A 0 is given by p(N , E, A 0 ) = 12(N, E, Ao)Intot(N E) where ft(N, E, A 0 ) is the number of configurations realizing A = Ao . Knowing A = A o , the microcanonical entropy is given by cr(N , E, A D ) = log 1(N, E, A 0 ). The most probable value A, is thus the one maximizing this entropy. If the distribution has a marked peak around A m , the statistical averages of the quantities X(A) depending on the variable A can be identified with their value X(A,). The set of configurations such that A = A, is then taken as the state of statistical equilibrium, and the possible differences A 0 A, are called statistical fluctuations. One defines the microcanoni cal temperature T of the system S by:
T = [ka (acrlaE)N,A ] The statistical equilibrium of two microcanonical systems exchanging only energy is reached when their microcanonical temperatures are equal: this characterization of thermal equilibrium supports the identification of T with the thermodynamic temperature.
111.2
The canonical ensemble
The statistical formalism extends to systems S which unilaterally undergo external influences: the system S is modified by the exterior medium but itself produces an action so weak as to be negligible. The formalism of the canonical ensemble is applicable in the case of a system S in thermal equilibrium with a thermal reservoir T (also called a thermostat) at the temperature T, which can exchange heat with S without its own temperature varying, and thus imposes the temperature T on S. It is a consequence of the microcanonical formalism applied to (5 +1), with the hypothesis:
-
Etot = ET ± Es (T and S weakly coupled); — Es < ET (this assumption is implicit in the notion of thermal reservoir); — the microcanonical temperature TT [k a (acry I ET)(E E 5 ] -1 of the thermal reservoir is approximated by the value [Ic a (acrT /aET )(E)] -1 (exact in the limit Es/ET -* 0): TT is not influenced by the presence of S; — Otot (Etot , Es) = EEs QT. (Et ot — Es)Os(Es) (weak coupling). Plugging the expansion crT(E tot - Es) = ay(E) - OEs where 0 = 1/(k B 7T) into the probability distribution of Es we obtain: ,
P(ES)
= 118(134e -06. s Z(i3) EEs iltot(Etot I ES) Sitot(Eto, Es)
Appendix 111.2
323
The canonical ensemble
where
z(s, 0 ) E 0,(Es )e-f3Es The partition function Z(S , 0) can also be expressed in terms of the configurations:
Z(N, fl)
E e-masiiiv) [s]
where if ([s], N) is the energy of the configuration [s] of S, consisting of N particles. The sum in Z(N, 0) is over all the possible con fi gurations [s) of the particles. The knowledge of Z(N, fl) gives access to all the thermodynamic quantities of S: — its free energy is given by F(N , 0) = -0-1 log Z(N, 13). the probability distribution of the configurations (or Boltzmann-Gibbs distribution) is given by: —
1
P(N, 13,[s]) = Z(N , g)
—
its internal energy is given by
U(N, )3) =< H >=
1/(N,[s])p(N, )3,[s]) [8]
where the sum is over the configurations of the system. U can be written in terms of the partition function: U= - (OZ10 13); — its entropy is given by S(N, 3) E[5] p(N, [s]) log p(N, (3, [s]). This entropy is related to the other thermodynamic quantities by the relation F=U-TS and written in terms of the partition function:
s(N, 0) = -ko
2
a 0 13
(loZ g
)(N,13) ko
2 (aF —) 00
(N, 0)
Dividing by N defines quantities per particle. We expect that the influence on a particle of the particles around it should become saturated as N increases, which leads to the study of thermodynamic limits lim N ,,, X(N , N where X(N, ,Ci) is one of F, U, S. The divergence of this type of limit expresses the fact that the whole of the environment controls the state of a particle and that the system, whatever its size, behaves like a block which cannot be decomposed into independent cells of finite size: such a situation is called a critical phenomenon. The extension of the above formalism to the case of continuous systems is immediate: the system no longer lies on a lattice (aZ) d but in a volume V C Rd . Its con fi gurations are given by continuous fields sM. The discrete sums E9E(az)d are replaced by integrals f d, The discrete sums over the configurations Emee, or few cis i dsiv are extended to path integrals A d , in which the "variable" of integration is the field s( ).
Thermodynamic formalism
324 REMARKS AND BIBLIOGRAPHICAL NOTES
The basics of statistical mechanics were introduced around 1870 by Boltzmann (Boltzmann [1964]); the goal of the theory was to deduce classical thermodynamics from. the purely mechanistic description of molecules, using appropriate statistical arguments. His work was completed by Maxwell [1890], then formalized by Gibbs using statistical ensembles, in particular the microcanonical and canonical ensembles introduced above (Gibbs [1902 ]) . This theory, which at first was violently controversial, is now an indispensable tool of theoretical physics. Classical expositions can be found in Balescu [1974 Khinchin P949], Mac Quarrie [1073], Ruelle [1978a,13], Ma [1985] or Chandler [1987],
Appendix IV The Fourier transform The Fourier transform constructively relates real and conjugate spaces. Its formulation differs according to the functions to which it is applied. We propose here a short summary indicating the transforms adapted to each case and easy to modify, if necessary, according to the normalization used (TVA). The symmetry and regularity properties of functions axe reflected in those of their spectral components (IV,2).
IV.1
Transformation formulas
The Fourier transform realizes the decomposition of "suitable" functions OM
(i.e.
functions which are sufficiently regular and decreasing at infinity) on a complete set of purely oscillating complex functions [eif- ],TE Q called Fourier modes. The set Q varies according to the nature of the initial function 0, which can be — considered as having bounded support equal to [0, L}d or equivalently, as being periodic of period L in each direction of Rd, via the periodic juxtaposition of the domains [0, L ; ]
d
— defined on a lattice of parameter a (so one cell occupies a volume ad); — defined on Rd. We adopt a unified formulation, involving "dummy" normalization constants A and A which facilitate modification of the normalization. The basic transforms for functions with bounded support [0, Lid are given by:
E
_ L_dt5 d (i)
fL
fL
Jo Jo e 2iarri .2 / L ddz
1 if = (0 ... 0) 0 otherwise
{
77 .= FIM
riEZs
where 6 d is the Dirac distribution in dimension d. In this case we have Q 27rh/L, n E Z d } and the transform and its inverse are defined by: L
joL
T OW
= Ad
0( ,) _ Â L
e 2irfa,0 L
0
10
'dd4= (27r) d s5 d (i) d
(i)12 d
(Bessel-Parseval formula)
Zd
The basic formulas in Rd (with given by:
JR
6 -2irra..t/L
E IIEZd
At -d E 21E
= =
dd4
playing the role of the volume
ei fRd
t d d ri,
(27r/L) d)
(2 7 d8d ( (i) )
are
The Fourier transform
326 The transform -;(4), defined in
=
Q=
Rd, is related to
A d /Rd 0(±)ei "ddei
Ad JRd
1001 2
0(i') by:
OGi) =
dd 4 1= Ad 1 [
21r) -
Ad l'ila k4) C—i" (2C 1 q)d
0(i)I 2ddi (Bessel-Parseval formula )
The consistency between the normalization constants is ensured by the condition AA = 1. The value of A is then arbitrary; we use A = A = 1.
Real space
Ax
L - periodic
discrete = a, i = ah
Adad
E
ciail4
in each direction
L
2irr_fl
,_
A d fot . . . fo e —E— di42;
continuous i: E Rd
Adf
?la d AA
e i2 Icid
Rd
1
Conjugate space
27r/a - periodic in each direction d_ 2rr .fa.... L a e —iag.T . _Lg.. (27r) d
discrete A
q = 2*r, 4 = 2f
Ad L—d .....
Ee
-2
V -4
continuous q E Rd Ad f e -I- E,IT dd j
fia
271-
tic Zd
IV.2
Basic properties
This spectral decomposition reveals the oscillating behavior of 0. The existence of reciprocal formulas is a technically essential point. Unlike "real" space in which the functions f, depend on positions i (or on instants t), conjugate space is the space of wave vectors 7 (or of frequencies c.,-) in the temporal case); 0- () is called the spectral (or the "mode 4"). The Fourier transform is essential in physics component at since the spectral components are often experimentally accessible with more precision and reliability than the function itself. For example, it becomes easier to eliminate spurious noise or to choose from the components of a signal, the ones corresponding to the phenomenon under investigation. If 0 is real, then o(q) and 0(-4) are complex conjugates, so that and --4 are one and the same mode: thus we are reduced to a decomposition on [cos(), sin(q.)] qEQ. Setting = rt-1 where r = H I 1, we obtain: r d- 1 dr dd- 1 1-1,
nd
2(700[F(d/2)]-1
Appendix IV.2
327
Basic properties
where I' is the Euler function. The transform of an isotropic function
fRci 0(i)e
4.±, dd
sl d
rd-1 ç(r)
OH
is given by:
sin qr di' qr •
It depends only on the modulus q of In problems involving only isotropic functions, working in conjugate space allows us to reduce d to a simple numerical parameter (in 74-1 and St d ): thus the study can be formally generalized to the case of non-integral dimensions. The Fourier transform transforms a local property with respect to into a uniform property with respect to and vice versa: thus a function 4 and its transform 0-- give complementary information. The extreme case is given by the relations transforming the Dirac distributions into constant functions and vice versa. The properties extend to functions of two variables C(i 1 , 2 ); the typical case is that of correlation functions. The Fourier transform of C depends a prion on the wave vectors j and 4- 2 which are respectively conjugate to and i;2. Let us decompose the argument of the complex exponential: =
;i141.
- i.32)
(6.
x2
-
2
) -i
2
+
42)
=
XiQi
+
X2Q2
42)/2 and Q2 = 41 + 42). with X 1 = Qi = (41 X2 X2 = (ii The infinitesimal integration volumes are preserved: cld 1dd 2 = ddX 1 ddX2 and , 2. The homogeneity of C, expressed by the fact that C similarly ddi.dd q.2 = d d ch dd cd depends only on X 1 = - x 2 , gives the following form to the transform of C: -
,
q2 ) = (2 71.)d 6d(Q 2 )
= (2 7)d 45dW
'c'(q 1 )
If C is, moreover, isotropic, then CIM depends only on the modulus q i ; if C is local and proportional to 5i 1 i'2 ), then is a constant. Let us conclude by noting some crucial properties in the study of critical phenomena. A system of linear extent L in real space is described with a resolution 0 of f(i.) is reflected in a singularity = 27r/L in conjugate space. A singularity r 0, then j(4) behaves like q oo of f() and vice versa. If f(i) behaves as ra as r co. The proof is based on the change of variables q - a -d as q
f(qta) =
f m e ityl.
=
f
q —d
fRd
q
= I I I)
REMARKS AND BIBLIOGRAPHICAL NOTES A complete mathematical presentation of the Fourier transform can be found in Schwartz [1978]. For a basic presentation more oriented towards its physical applications, we refer to Chaxnpeney [1973]. For its "concrete" use in the theory of signal processing, for example to construct and analyze power spectra ( 5.1.6), a basic reference is Oppenheim and Schafer [1989].
Bibliography This bibliography is by no means exhaustive; it represents a series of partial and subjective choices of the author. The references have been selected for their accessibility (for introductory books), their historical importance (original articles) or their fundamental nature (courses, surveys, reference works on the subject). Most of them contain extensive and more specifically oriented bibliographies. Each of the references given below is actually cited in the main, text of this book.
ABRAHAM R. and SHAW C. Aerial Press, Santa Cruz.
[1984] — Dynamics: the geometry of behavior. j, II, III.
A. [1984] — Percolation, fractals and anomalous diffusion. J. Stat. Phys., 34,
AHARONY
p. 931-939. [1985 ] - Anomalous diffusion on percolating clusters. In Scaling phenomena in disordered systems, edited by R. Pynn and A. Skjeltorp, Plenum Press, New York, p. 289.
AHARONY
A.
A. and FEDER J., eds. [1989] - Fractals in Physics; essays in honour of B.R. Mandelbrot. Physica D, 38.
AHARONY
AIZENMAN M.
[1986] - Rigorous studies of critical behavior. Physica A, 140, p. 225-231.
ALEXANDER S. [1986] - Anomalous diffusion on percolation clusters. Physica A, 140, 13 - 397. ALEXANDER S. and ORBACH R. [1982] - J. Phys. Lett. (Paris), 50, p. 77. AMIT D. [1978] - Field Theory, the
renormalization-group and critical phenomena.
McGraw-Hill, New York. ARAMAKI S. [1989] — Development of the renormalization electrodynamics. Historia Sc., 37, p. 91-113. ARGOUL F., ARNEODO
theory in
quantum
A., COLLET P. and LESNE A. [1987] - Transitions to chaos
in
the presence of an external periodic field.: cross-over effect in the measure of the critical exponents. Europhys. Lett, 3, p. 643-651.
ARGOUL F., ARNEODO A., GRASSEAU G., GAGNE Y., HOPFINGER E., FRISCH U [1989] — Wavelet analysis reveals the muitifractal nature of the Richardson cascade. Nature, 338, p. 51-53. ARMSTRONG M.A. [1988] - Groups and symmetry. Springer, Berlin.
A., BACRY E. and MUZY J.F. [1993] - Wavelet analysis of fractal signals: direct determination of the singularity spectrum of fully developed turbulence. Springer, Berlin.
ARNEODO
ARNOLD L.
[1971] - Stochastic differential equations. Wiley, London.
ARNOLD L. and WIHSTUTZ V., eds. [1986]— Lyaptinov exponents. Series "Lecture Notes In Maths." , vol. 1186, Springer, Berlin.
ARNOLD V.I.
[1963a] - Small denominators; proof of a theorem of A.N. Kolmogorov on the preservation of conditionally-periodic motions under a small perturbation of the hamiltonian. Russ. Math. Surveys, 18, p. 5.
330
Bibliography
V.I. [196313] - Small denominators and problems of stability of motions in classical and celestial mechanics. Russ. Math, Surveys, 18, p. 85.
ARNOLD
[1965] - Small denominators; mappings of the circumference onto itself. AMS translations, Series 2, 46, p. 213-284.
ARNOLD V.I.
[1992] - Ordinary differentia/ equations. 3rd edition Springer textbooks,
ARNOLD V.I.
Berlin. MAJDA A.J. [1991] - Mathematical models with exact renormalization for turbulent transport. Commun. Math. Phys., 131, p. 381.
AVELLANEDA M. and
BAK P.
[1989] - The devil's staircase. Phys. Today, 39, p. 38-45.
BAKER G.L. and GOLLUB
J.P. [1990 - Chaotic dynamics, an introduction. Cambridge ]
Univ. Press, Cambridge. BALESCU R.
[1975] - Equilibrium and nonequilibrium statistical mechanics. Wiley, New
York.
A.L. and STANLEY H.E. [1995] Cambridge Univ. Press, Cambridge.
BARABii. SI
BARNSLEY M.F.
Fractal concepts in surface growth.
[1988] - Fractals everywhere. Academic Press, Boston.
BARNSLEY M.and DEMKO S.G.,
eds. [1986] - Chaotic dynamics and fractals. Academic
Press, Orlando. BATCHELOR G.K. [1953] - The theory of homogeneous turbulence. Cambridge Univ. Press, Cambridge. [1982] - Exactly solved models in statistical mechanics. Academic Press,
BAXTER R.J.
New York. L. and GIORGILLI A. [1980a] - Universal properties in conservative dynamical systems. Lett. Nuovo Cim., 28, p. 1.
BENETTIN G., CERCIGNANI C., GALGANI
G., GALGANI L., GIORGILLI A. and STRELCYN J.M. 11980b] - Lyapunov characteristic exponents for smooth dynamical systems and for hamiltonian systems; a method for computing all of them. Meccanica, 15, p. 21.
BENETTIN
R., PALADIN G., PARISI G. and VULPIANI A. [1984] - On the multifractal nature of fully developed turbulence and chaotic systems. J. Phys. A, 17, p. 3521.
BENZI
M., MANNEVILLE P. and POMEAU Y. [1980] - Intermittency in Rayleigh-Bénard convection. J. Physique-Lettres, 41, p. L341-L344.
BERGE'. P., DUBOIS
BERGE. P., POMEAU Y. and VIDAL C., Paris.
eds. [1984] - L'ordre dans le chaos. Hermann,
[1989] - Electrical transport properties near a classical conductivity or percolation threshold. Phy.sica A, 157, p. 72.
BERGMAN D.
BILLING SLEY
P.
BILLINGSLEY P.
[1965] - Ergodic theory and information.. Wiley, New York, [1979] - Probability and measure. Wiley, New York.
BINDER K., ed. [1979] - Monte Carlo method in statistical physics. Series "Topics in Current Physics" , vol. 7, Springer, Berlin.
BINDER K., ed. [1987] - Applications of the Monte Carlo method in statistical physics. 2nd edition. Series "Topics in Current Physics" , vol. 36, Springer, Berlin.
Bibliography
331
K. and HEERMANN D.W. [1988] - Monte Carlo simulation m statistical physics. Springer Series in Statistical Physics, Springer, Berlin.
BINDER
BINDER
K. and
YOUNG A.P.
[1986] - Rev. Mod. Phys., 58, p. 801.
BIRKHOFF
G.D.
BIRKHOFF
G.D. [1927] - Dynamical systems. AMS Publications, Providence.
BIRKHOFF
G.D.
[1912 - Quelques théorèmes Sur le mouvement des systèmes dynamiques. Bull. Soc. Math. de France, 40, p. 305-323. (Reprinted in Dynamical systems: a renewal of mechanism, edited by S. Diner, D. Fargue and G. Lochak, World Scientific, Singapore [1986] .) ]
[1931] - Proof of the ergodic theorem. Proc. Nat. Acad. Sci. USA, 17,
p. 656-660.
R. and Boston.
BISHOP
CRITTENDEN
R.
[1964] - Geometry of manifolds. Academic Press,
B.B. and SHIRKOV D.V. [1958] - Introduction to thc theory of quantized fields, (2nd edition in 1980), Wiley, New York.
BOGOLIUBOV
L. [1964 - Lectures on gas theory. English translation edited by S. Brush, Univ. of California Press, Berkeley.
BOLTZMANN
]
J.P. and GEORGES A. [1990] - Anomalous diffusion in disordered media: statistical mechanics, models and physical applications. Phys. Rep., 195, p. 127-293.
BOUCHAUD
G. and TAKENS F. [1990] - Unfoldings and bifurcations of quasiperiodic tori. Memoir of the AMS, issue 421.
BRAAKSMA B., BROER H., HUITEMA
and DURETT R. [1988] - Random walk in random environment: counterexample? Commun. Math. Phys., 119, p. 119-211.
BRAMSON M.
a
G.E. [1972] - Introduction to compact transformation groups. Academic Press, New York.
BREDON
D. and HAVLIN S. {1983] - Study of Monte Carlo methods for generating self-avoiding walks. J. Stat. Phys., 31, vol. 3, p. 661-670.
BRENDER C., BEN-AVRAHAM
J.C. and ZINN-JUSTIN J. [1974] — Discussion of critical phenomena for general n-vector model. Phys. Rev. B, 10, p. 892.
BREZIN E., LE GUILLOU
E., LE GUILLOU J.C. and ZINN-JUSTIN J. [1976] - Field theoretical approach to -critical phenomena. In Phase transitions and critical phenomena VI, edited by C. Domb and M.S. Green , Academic Press, New York,
BREZIN
BRICMONT
J.
[1991] - Random walks in asymmetric random environments. Commun.
Math. Phys., 142, p. 345-420.
J. and KUPIAINEN A. [1990] - Rigorous renormalization-group and disordered systems. Physica A, 163, p. 31-37.
BRICMONT
J. and KUPIAINEN A. [1991] - Renormalization group for diffusion in a random medium. Phys. Rev. Lett., 66, p. 1689-1692.
BRICMoNT
J. and KUPIAINEN A. [1992] - Renormalization group and the LandauGinzburg equation. Commun. Math. Phys., 150, p. 193-208.
BRICMONT
BRIN
M. and KATOK A. (1983] - Geometric dynamics. Series "Lecture Notes in Maths.", vol. 1007, Springer, Berlin, S.R. and HAMMERSLEY J.M. [1957] - Percolation processes; crystals and mazes. Froc. Cambridge Philos. Soc., 53, p. 629.
BROADBENT
332
Bibliography
ed. [1993] - Renormakzation. From Lorentz to Landau (and beyond). Springer, Berlin.
BROWN L.M.,
BUDNICK J.T.and KAWATRA M.P. , eds. [1972] phenomena. Gordon and Breach, New York.
Dynamical aspects
of critical
BUNDE A. and HAVLIN S., eds. [1991] - Fractals and disordered systems. Springer, Berlin. BUNDE A. and HAVLIN S. [1991] - Percolation. In Fractals and disordered systems, edited by A. Bunde and S. Havlin, Springer, Berlin, p. 51-150. BUNDE A. and HAVLIN S. eds. [1994] - Fractals in Science. Springer, Berlin.
BURGERS J.M. [1974]
-
The non-linear diffusion equation. Reidel, Boston.
BURKHARDT, T.W. and VAN LEEUWEN, J.M.J., ization. Springer, Berlin.
eds. [1982] - Real space renorrisal-
eds. [1987] - AdBUSIELLO G., DE CESARE L., MANCINI F. and MARINARI E., vances on phase transitions and disorder phenomena. World Scientific, Singapore. CAMPANINO M. and EPSTEIN H. [1981] On the existence of Feigenbaum's fixed point. Commun. Math. Phys., 79, p. 261-302. -
CAO T.Y. AND SCHWEBER S.S. [1993] - The conceptual foundations and philosophical aspects of renorrnalization theory. Synthese, 97. CARDY J.L., CARDY
ed. [1988] - Finite-size scaling. North-Holland, Amsterdam.
J .L. [1996]
-
Scaling a nd renormalization in statistical physics. Cambridge Univ.
Press, Cambridge.
CARR J.
[1981 ]
-
Applications of center manifold theory. Springer, Berlin.
CHAMPENEY D .C. [1973] - Fourier transforms and their physical applications. Academic Press, London. CHANDLER
D. [1987]
-
Introduction to modern statistical mechanics. Oxford Univ. Press,
Oxford. CHEN L.Y., GOLDENFELD N. AND 00NO Y. [1994] Renormalization group theory and variational calculations for propagating fronts. Phys, Rev. R, 49, p. 4502-4511. -
Direct determination [1989] CHHABRA A.B. and JENSEN R.V. singularity spectrum. Phys. Rev, Lett., 62, p. 1327-1330. -
CHOW S.N . and HALE J.
[1982]
-
of the
f(a)
Methods ofbifurcation theory. Springer, Berlin.
CHUNG K.L. [1967] - Markov chains with stationary transition probabilities. Springer, Berlin. CLERC J.P., GIRAUD G., LAUGIER J.M. and LUCK J.M. [1990] The a.c. electrical conductivity of binary systems, percolation clusters, fractals and related models. Adv. in Phys., 39, p. 191. -
CODDINGTON E.A. and LEviNsoN N. tions. McGraw-Hill, New York,
COLLET P. and ECKMANN J.P. [1978]
[1955]
-
Theory of ordinary differentia/ equa-
A renormalizatson group analysts of the hierarchical model in statistical mechanics. Series "Lecture Notes in Physics" , vol.
74, Springer, Berlin.
Bibliography
333
COLLET P. and ECKMANN J.P. [1980] - Iterated maps of the interval as dynamical systems. Series "Progress in Physics" , vol. 1, Birkhatiser, Boston. COLLET P., ECKMANN J.P. and KOCH H. [1981] - Period doubling bifurcations for families of maps of RI, J. Stat. Phys., 25 , p. 1 - 15. LANFORD O.E. [1980] - Universal properties of maps of an interval. Comm. Math. Phys., 76, p. 211-254.
COLLET P., ECKMANN J.P. and
COLLET P., LEBOWITZ J. and PORZIO A. [1987] - Dimension spectrum of dynamical systems. J. Stat. Phys., 47, p. 609-644. COLLET P. and LESNE A. [1989] - Renormalization - group analysis of some dynamical systems with noise. J. Stat. Phys, 57, p. 967-992. \/ V COLLET P. and ECKMANN J.P. [1989] - Instabilities and fronts in extended systems. Princeton University Press, Princeton. COLLINS [1984] - Renormaiization. Cambridge Univ. Press, Cambridge. COMBES
.3 .M .
[ 1980] - Wavetets. Springer, Berlin.
COMBES J.M., GROSSMANN A. and TCHAMITCHIAN P.,
eds. [1988] -
Wavelets.
Springer, Berlin. V CONIGLIO A. [1982] - Cluster structure near percolation threshold. Phys. Rev, Lett., 46, P. 250. COTTON J.P. [1980 ] - J. Phys. Lett. (Paris), 41, p. L231. COULLET P. and TRESSER C. [1978a] - Itérations d'endomorphismes et groupe de renormalisation. C.R. Acad. Sci. (Paris), 287, p. 577. COULLET P. and TRESSER C. [1978b] - Itérations d'endomorphismes et groupe de renormalisation. J. de Phys. C, 5, p. 25-28. COULLET P. and TRESSER C. [1980] - Critical transition to stochasticity for some dynamical systems. J. Physique, 41, p. L255-L258. CRUTCHFIELD J., FARMER J. and HUBERMAN B. [1982] - Fluctuations and simple
chaotic dynamics. Phys. Reports, 92, p. 45. CRUTCHFIELD J., NAUENBERG M. and RUDNICK J. [1981] - Scaling for external noise at the onset of chaos. Phys. Rev. Lett., 46, p. 933. CURRY J. and YORKE J.A. [1977] - The structure of attractors in dynamical systems. Series "Lecture Notes in Math." vol. 668, Springer, Berlin. CVITANOVIG' P.,
ed. [1989] - Universality in chaos. 2nd edition, Adam Hilger, Bristol.
DE ARCANGELIS L. [1988] - Fractals and multifractals in physics. In Disorder and mixing: convection, diffusion and reaction in random materials and processes, edited by E. Guyon, J.P. Nadal and Y. Pomeau. NATO ASI Series E, vol. 152, Kluwer Academic
Publishers, Dordrecht. DE GENNES P.G. [1972] - Phys. Lett. A, 38, p. 331. DE GENNES P.G.
[1975] - Collapse of polymer chains in poor solvents. J. Phys. Lettres,
36, p. L55-57, DE GENNES P.G. Press, Ithaca.
[1984] - Scaling concepts in polymer physics. 2nd edition. Cornell Univ ,
334
Bibliography
eds. DELL ) .ANTONIO G.F. and D'ONOFRIO B.M., hamiltonian systems. World Scientific, Singapore.
[1987] - Recent advances in
DE MASI A. and PRESUTTI E., eds. [1989] - Lectures on collective behauiour of particle systems. Carr Reports in Mathematical Physics, 5. [1932] - Sur les courbes définies par des équations différentielles à. la surface du tore. J. Math. Pures et Appl., 11, p. 333-375.
DENJOY A.
DENJOY A. p. 5-7.
[1946] - Les trajectoires â la surface du tore. C.R. Acad. Sc. Paris, 223,
DE QUEIROZ S.L. [1989 ] - Coarse-grained Flory approximation for a polymer chain at the O-point in two dimensions. Phys. Rev. A , 39, p. 430-433. DERRIDA B. and LUCK J.M. [1983) - Diffusion on a random lattice: weak disorder expansion in arbitrary dimension. Phys. Rev. B, 28, p. 7183-7190. DES CLOIZEAUX J. [1975] - J. Phys. (Paris), 36, p. 281.
G., ZALLEN R. and ADLER J., processes, Adam Hilger, Bristol.
DEUTSCHER
eds. [1983] - Percolation structures and
DEVANEY R. [1989] - An introduction to chaotic dynamical systems., 2nd edition, Addison-Wesley, Redwood City. DEVANEY
R. [1990] -
Chaos, fractals and dynamics. Addison-Wesley, Menlo Park.
D'HUMIÉRES D., BEASLY M.R., HUBERMAN B.A. et LIBCHABER A. [1982]—Chaot states and routes to chaos in the forced pendulum. Phys. Rev. A, 12, p. 3483. DOMB C., GREEN M.S. and LEBOWITZ J.L., eds. [1972-88] - Phase transitions and critical phenomena. Proceedings (every year). Academic Press, New York. DOOB J.L. [1953] - Stochastic processes. Wiley, New York. DOTSENKO VIK. [1994] - An introduction to the theory of spin glasses and neural networks. World Scientific, Singapore. DOUADY A. [1986] - Julia sets and the Mandelbrot set. In The beauty of fractals, p 161173, edited by 11.0. Peitgen and P.J. Richter, Springer, Berlin. V V DOUKHAN P.
[1995] - M ixingproperties and examples. Springer, Berlin.
V DROSSEL B. and SCHWABL F. [1992] - Self-organized forest-fire model. Phys. Rev. Lett. , 69, p.1629-1632. DUBOIS M. and BERGE. P. [1981] - Instabilités de couche limite dans un fluide en convection; évolution vers la turbulence. J. Phys. (Paris), 42, p. 167.
and BERGE. P. [1981] - Experimental evidences associated with a subharmonic bifurcation. Phys. Rev. Lett., 51, p. 1446.
DUBOIS M., RUBIO A.
and SCHWARTZ J.L. [1958] - Linear operators. Interscience Publishers, New York ,
DUNFORD N.
DUPLANTIER B. [1986] - Polymer network of fixed topology: renormalization, exact critical exponent 7 in 2 - d and d-.1.-- 4 - c. Phys. Rev. Lat., 57, p. 941-944. DURETT R. [1986] - Multidimensional random walks in random environments with subclassical limiting behavior. Commun. Math. Phys., 104, p. 87-102.
335
Bibliography
F.J. [1951) The renormalization method in quantum electrodynamics. Proc. R. London Ser. A, 207, p. 395-401.
DYSON
-
F.J. [1969] - Existence of a phase-transition in a one-dimensional Ising ferromagnet. Commun. Math. Phys. , 12, p. 91-107.
DYSON
ECKMANN J.P. [1981]- Roads to turbulence in dissipative dynamical systems. Rev. Mod. Phys., 53, p. 643-654. ECKMANN J.P. and RUELLE D. [1985] - Ergodic theory of chaos and strange attractors. Rev. Mod. Phys., 57, p. 617-656. ECKMANN J.P., THOMAS L. and WITTWER P. sence of noise. J. Phys., 14 A, p. 3153.
[1981]
-
Intermittency in the pre-
EHRENFEST P. and EHRENFEST T. [1959] The conceptual foundations of the statistical approach in mechanics. Cornell Univ. Press, Ithaca; published by Dover (London) in 1990. -
EINSTEIN A. [19051 On the movement of small particles suspended in a stationary liquid demanded by the molecular-kinetic theory of heat. Ann. Physik. 17. -
A.
[1926] Investigations on the theory of the brownian motion. Published in 1956 by Dover, London.
EINSTEIN
ELLIS R.S.
-
[1985] - Entropy, large deviations and statistical mechanics. Springer, Berlin.
EPSTEIN H. [1986] New proofs of the existence of the Feigenbaum fixed point. Commun. Math. Phys., 106, p. 395-426. -
EPSTEIN H. and LASCOUX J. [1981] — Analyticity of the Commun. Math. Phys., 81, p. 437-453.
Feigenbaum function.
ESCANDE D.F. and DOVEIL F. [1981] Renormalization method for computing the threshold of the large stochastic instability in two degrees of freedom hainiltonian systems. J. Stat. Phys., 26, p. 257. -
ESSAM J.W. [1980] FALCONER, K.
-
[1990]
Percolation theory. Rep. Prog. Phys., 43, p. 833. -
Fractal geometry. Wiley, New York.
FAMILY F. [1984] Polymer statistics and universality: principles and applications of cluster renormalization. In Random walks and their applications in the physical and biological sciences, edited by M.F. Schlesinger and B.J. West, AIP conf. 109, New York, p. 3. -
FARMER J.D., OTT E. and YORKE Physica D, 7, p. 153-180. FEDER
J.
J.A. [1983] -
The dimension of chaotic attractors.
[1988] - Fractals. Pergamon, New York.
Universality in complex discrete dynamical systems. Los [19771 FEIGENBAUM M. Alamos theoretical division annual report, p. 98-102. -
[1978] Quantitative universality transformations. J. Stat. Phys., 19, p. 25-52.
FEIGENBAUM M.
-
for a
class
of
non-linear
[1979a] The universal metric properties of non-linear transformations. J. Stat. Phys., 21, p. 669-706.
FEIGENBAUM M.
FEIGENBAUIvI M. [1979b]
-
-
The onset spectrum of turbulence. Phys. Lett. A, 74, p. 375.
Bibliography
336
FEIGENBAUM M.
[1980a] - Universal behavior in non linear systems. Los Alamos Science,
1, P. 4. [1980b] - The transition to aperiodic behaviour in turbulent systems. Commun. Math. Phys., 77, p. 65-86.
FEIGENBAUM M.
FEIGENBAUM M. [1983] — Universal behavior in non linear systems. Physica D, 7, p. 16. FEIGENBAUM M. [1987] — Scaling spectra and return times of dynamical systems. J. Stat.
Phys., 46, p. 925-932. [1982] - Quasi-periodicity dissipative systems: a renormalization-group analysis. Physica D, 5, p. 370-386.
FEIGENBAUM M., KADANOFF L. and SHENKER S.
in
FELLER W. [1971] - An introduction to probability theory and its apptications. Wiley, New
York. FEYNMAN R.P. and HIBBS A.R. McGraw Hill, New York.
[1965] — Quantum mechanics and path integrals.
FISCHER K.H. and HERTZ J.A. [1991] —
Spin glasses.
Cambridge
Univ.
Press,
Cambridge. FISHER D.S. [1984] — Random walks in random environments. Phys. Rev. A , 30, p. 960. FISHER M. [1974] - The renormalization-group and the theory of critical behavior. Rev. Mod. Phys., 46, p. 597-616. FLORY P.
[1941 ]- J. Am. Chem, Soc., 63, P. 3083.
FLORY P.
[1969] — Statistics of chain molecules. Interscience Publishers, New York.
FLORY P.
[1971] — Principles of polymer chemistry. Cornell Univ. Press, Ithaca.
FORSTER D. [1978] — Hydrodynamic singularities and the Proceedings of Stat. Phys. 13, Adam Hilger, Bristol,
renormalization-group.
FORSTER D., NELSON D.R. and STEPHEN M.J. [1977] - Large-distance properties of a randomly stirred fluid. Phys. Rev. A, 16, p. 732-749. FREIDLIN M.L. and WENTZELL J. (1984) - R a n do m perturbations of dynamical systems. Springer, Berlin. FRIEDMAN Z. and FELSTEINER J.
[1977] — Phys. Rev. B, 23, p. 429.
FRIS CH U. [1995] — Turbulence: the legacy of A.N. Kolmogorov. Cambridge Univ. Press, Cambridge.
[1985] - Fully developed turbulence and intermittency. Proceedings of Int. School on Turbulence and predictability in geophysical fluid dynamics and climate dynamics, edited by M. Ghil, R. Benzi and G. Parisi, Course 88, p. 84-88
FRISCH U. and PARIS! G.
[1978] - A simple dynamical model of FRISCH U., SULEM P.L. and NELKIN M. intermittent fully developed turbulence. J. Fluid. Mech., 87, p. 719-736. GALL AVOTTI, G. [1973] — Ising model and Bernoulli scheme in one dimension. Commun. Math, Phys., 32, p. 183-190. GARDINER C.W [1985] - Handbook of stochastic methods. Springer Series in Synergetics,
vol. 13, 2nd edition, Springer, Berlin.
337
Bibliography
GARLAND T.H. [1987] - Fascinating Fibonacci: mystery and magic in numbers. Dayle Seymour, Palo Alto. GAWEDSKI K.
[1985]
GAWEDZKI K. [1986]
-
-
Block-spin renormatization. World Scientific, Singapore.
Rigorous renormalization-group at work. Physica A, 140, p. 78-84.
GAWLINSKI E.T. and REDNER S. [1983] Monte Carlo renormalization-group for continuum percolation with excluded volume interactions. J. Phys. A, 16, p. 1063. -
VGEFEN Y., MANDELBROT B.B. and AHARONY A. [1980] - Critical phenomena on fractals. Phys. Rev. Lett., 45, p. 855-858.
CELL-MANN M. and Low F.E. [1954] Phys. Rev., 95, p. 1300-1312.
Quantum electrodynamics at small distances.
-
GEORGI H. [1982] - Lie algebras in particle physics. Frontiers in Physics, Benjamin, Reading, Mass.
GIBBS J. [1902] - Elementary principles in statistical mechanics. New Haven. Published in 1981 by Ox Bow Press. GLEICK
J.
[1987]
-
Chaos, making a new science. Cardinal, Sphere books Ltd., London.
GNEDENKO B.V. [1973] - The Theory of probability. MIR, Moscou. Limit distributions for sums of GNEDENKO B.V. and KOLMOGOROV A.N. [1954] independent random variables. Addison-Wesley, Cambridge, Mass. -
Lectures on phase transitions and the renormaiization-group. GOLDENFELD N. [1992] Series "Frontiers in Physics" vol. 85. Addison-Wesley, Reading, Mass. -
GOLDENFELD N., MARTIN O., OONO Y. and FONG Lru [199 0 ] Anomalous dimensions and the renormalization group in a non linear diffusion process. Phys. Rev. Lett., 64, p. 1361-1364. -
-
GOLLUB J.P. and SWINNEY H.L. [1975] Rev. Lett., 35, p. 927.
-
Onset of turbulence in a rotating fluid. Phys.
COULD H., FAMILY F. and STANLEY H.E. [1983] - Kinetics of formation of randomly branched aggregates: a renormalization-group approach. Phys. Rev. Lett., 50, p. 686689. GOUYET J.F. [1996] - Physics and fractal structures. Springer, Berlin. GRASSBERGER P. and PROCACCIA I. [1983] - Measuring the strangeness of strange attractors, Physica D, 9, p. 189-208. Are three-frequency quasi-periodic GREBOGI C., OTT E. and YORKE J.A. [1983] orbits to be expected in typical non-linear systems? Phys. Rev. Lett., 51, p. 339. -
GREEN M.S., ed. [1971] - Critical phenomena. Proceedings of the congress "Enrico Fermi" , Academic Press, New York . GRIMMETT G.R. [1989)
-
Percolation. Springer, Berlin.
GUCKENIIEIMER J. and HOLMES P. [1983 ] Non linear oscillations, dynamical systems and bifurcations of vector fields. Springer, Berlin. -
eds. [1973] - Renormatization grotip in critical GLTNTON J.D. and GREEN M.S., theory proceedings of a conference. Temple University, phenomena and quantum field Philadelphia. -
338
Bibliography
HAKEN
H.,
ed.. [1974] - Cooperative effects, progress in synergetics. North-Holland,
Amsterdam. HAKEN H., ed. [1981 ] - Chaos and order in nature. Springer, Berlin. HAKEN H.,
ed. [1982 ] - Evolution of order and chaos. Springer, Berlin. Synergetics, an introduction. 3rd edition, Springer, Berlin ,
HAKEN H.
[1983a]
HAKEN H.
[198313 ] - Advanced synergetic& 3rd edition, Springer, Berlin.
HALMOS P. [1958] HALMOS P.
-
-
Measure theory. Chelsea, New York.
[1959) - Lectures on ergodic theory. Chelsea, New York,
\At HALPERIN B.I.
[1976]
-
Theory of
dynamic critical properties.
North-Holland,
Amsterdam. V HALSEY T., JENSEN M., KADANOFF L.P., PROCACCIA I. and SHRAIMAN B. [1986 tai measures and their singularities: the characterization of strange sets. Phys. Rey. A, 33, p. 1141-1151. [1962] - Group theory. Addison-Wesley, Cambridge, Mass.
HAMERMESH M.
HANNAN E.J. [1960 ]
-
Time series analysis. Methuen, London.
HAO B.L,
ed. [1984] - Chaos. World Scientific, Singapore.
HAO B.L.,
ed. [1988] - Directions in chaos, World Scientific, Singapore.
HAO B.L.,
ed. [1990] - Chaos II. World Scientific, Singapore.
HA.RFus A.B., MEIR Y. and AHARONY A. Phys. Rev, B, 36, p. 8752.
HAUSDORFF F.
[1987)
-
Diffusion on percolation clusters,
[1919] - Dimension und ausseres Mass. Math. Ann., 29, p. 157-179.
HAVLIN S. and BEN AVRAHAM D. physics , 36, p. 695-798.
[1987]
-
Diffusion in disordered media. Advances in
HELGASON [1978] - Differential geometry, Lie groups and symmetric spaces. Academic Press, New York.
eds. [1983 ] - Chaotic behaviour in deterministic HELLEMANN R.H. and loos G., systems. Summer School of Les Houches, North-Holland, Amsterdam. HÉNON M.
[1976] - A two-dimensional map with a strange attractor. Commun. Math.
Phys., 50, p. 69.
[1983] - The infinite number of generalized HENTSCHEL H.G. and PROCACCIA 1. dimensions of fractals and strange attractors, Physica D, 8, p. 435-444. [1980 ] - Sur la conjugaison différentiable rotations. Pub. Math. IHES 49, p. 5-234.
HERMAN M. HIDA T.
[1980]
-
des difféomorphismes à des
Brownian motion. Springer, Berlin.
Intermittency in the HIRSCH J.E., NAUENVERG M. and SCALAPINO D.J. [1982] presence of noise: a renormalization-group formulation. Phys. Lett. A, 87, p. 391. -
HIRSCH M.W. and PUGH C.0 [1970] - Stable manifolds and hyperbolic sets. Global Anal. Proc. Swap. Pure Math., 14. HIRSCH M.W. and SMALE S. [1974] - Differential equations, dynamical systems and linear algebra. Academic Press, New York.
Bibliography
339
HOHENBERG
F.C. and HALPERIN B.J.
[1977] - Theory of dynamic critical pheno-
mena. Rev. Mod. Phys., 49, p. 435-479.
HOLSCHNEIDER M. [1988] Phys., 50, p. 953-993. HOSHEN
J. and
-
On the wavelet transformation of fractal objects. J. Stat.
KOPELMAN R.
[1976] - Phys. Rev. B, 14, p. 3438.
Hu 13. [1982] - Introduction to the real-space renormalization-group methods in critical and chaotic phenomena. Phys. Reports, 91, p. 233 - 295.
HU B. and MAO J.M. [1982] - Period doubling: universality and critical-point order. Phys. Rev. A, 25, p. 3259-3261. Hu
B. and RUDNICK J.
[1982] - Exact solutions to the Feigenbaum renormalizationgroup equations for intermittency. Phys. Rev. Lett., 48, p. 1645-1648.
HLTBERMAN B.A. and Z1SOOK B. Rev. Lett., 46, p. 626 - 628.
[1981] - Power spectra of strange attractors. Phys.
HURST H .E. [1951] - Long-term storage capacity of reservoirs. Trans. A 116, p. 770.
IOOSS G. and JOSEPH D.D. Springer, Berlin.
FTE. SOC.
Civ. Eng.,
[1981] - Elementary stability and bifurcation theory.
ITZYKSON C. and ZUBER J,B. [1985] - Quantum field theory. M c Graw Hill, New York. ISICHENKO M.B. [1992] Percolation, statistical topography, and transport in random media. Rev. Mod. Phys., 64, p. 961-1043. -
ISING
E.
ITZYKSON
[1925] Beitrag zur Theorie des Perromagnetismus. Z. Phys., 31, p. 252.
C. and
ZUBER J.B. [1985] - Quantum field theory. McGraw Bill,
New York.
V JENSEN M.H., BAK P. and BOHR T. [1983] - Complete devil's staircase, fractal dimension and universality of mode-locking structures. Phys. Rev. Lett., 60, p. 1637.
G. [1975] - The renormalization group: a probabilistic view. Nuovo Cimento, 26 B, p. 99.
JONA-LASINIO
JUNKER L. and RAND D. [1983] Universal properties of maps of the circle with fsingularities. Commun. Math. Phys., 90, p. 273 - 292. -
JUG G. [1987] - Polymer coil-globule transition by real-space renormalization. J. Phys. A., 20, p. L503-L508. JULIA G. [1918] - Mémoire sur l'itération des fonctions rationnelles. J. Math. Pures et Appt., 4, p. 47. KADANOFF L.P.
[1966] - Scaling laws for Ising models near T. Physics, 2, p. 263-272.
[1975] - Variational principles and approximate renormalization group calculations. Phys. Rev, Lett., 34, p. 1005 - 1008.
KADANOFF L.P.
-
[1976] - Scaling, universality a,nd operator algebras. in Phase transitions and critical phenornersa V, edited by C. Domb and M.S. Green, Academic Press, New
KADANOFF L.P.
York. KADANOFF L.P.
p. 1641.
[1981] - Scaling for a critical RAM trajectory. Phys. Rev. Lett., 47,
340
Bibliography
KADANOFF L.P.
[1990]
–
Scaling and universality in statistical physics, Physica A, 163,
p. 1-14, KADANOFF L.P., G6TZE W., HAMBLEN D., HECHT R., LEWIS E., RAYL M., PALCIAUSKAS V.V. and SWIFT J. [1967] - Static phenomena near critical points: theory and experiment. Rev. Mod. Phys., 39 p. 395-431. KA/ T. [1981] Universality of power spectra of a dynamical system with period-doubling sequence. Phys. Lett. A, 86, p. 263. –
KAPITULNIK A., AHARONY A., DEUTSCHER G. and STAUFFER D. similarity and correlations in percolation. J. Phys.. A, 16, p. L269. KARDAR M., PARISI G. and ZHANG Y.C. [1986] interfaces. Phys. Rev. Lett., 56, p. 889-892, KARLIN S. and TAYLOR New York.
H.M.
KARLIN S.an.d TAYLOR H.M. New York.
–
[1983]
–
Self-
Dynamic scaling of growing
A first course in stochastic processes. Academic Press,
A second course in stochastic processes. Academic Press,
KATOK A. and KIFER Y. [1986] Random perturbations of transformations of an interval. J. d'Analyse Math., 47, p. 194-237. –
KESTEN H.
[1982]
KHINCHIN A.I.
–
Percolation theory for mathematicians. Birkhaiiser, Boston.
[1949]
–
Mathematical foundations of statistical mechanics. Dover, New
York,
KHINCHIN A.I.
[1957]
–
Mathematical foundations of the information theory. Dover, New
York.
KIFER Yu.
[1986] Random perturbations of dynamical systems. Series "Prog. in Prob. and Stat." , Birkhaser, Boston. –
KIRKPATRICK S.
[1973] – Percolation and conduction. Rey. Mod. Phys., 45, p. 574.
KLAFTER J., RUBIN R.J. and SCHLESINGER M.F., eds. [1986] relaxation in random materials. World Scientific, Singapore.
–
Transport
and
KLEINERT H. [1990 ] – Path integrals in quantum mechanics, statistics and polymer physics. World Scientific, Singapore. KNIGHT
F.B.
[1981]
–
Essentials of brownian motion. AMS, Providence.
KOLMOGOROV A.N. [1956] Company, New York.
–
Foundations of the theory of probability. Chelsea Publ.
KOLMOGOROV Â.N. [1941 ] – The local structure of turbulence in incompressible viscous fluid for very large Reynolds numbers. C.R. Acad, Sci. USSR, 30, p. 301-305. English translation in Turbulence classic papers on statistical theory, edited by S.K. Friedlander and L. Topper, Interscience, New York, [1961] . On conservation of conditionally-periodic motions for a small change in Hamilton's function. Dokl. Acad. Sci. USSR, 44, p. 311.
KOLMOGOROV A.N. [1954] -
KOLMOGOROV A.N. [19621 - A refinement of previous hypothesis concerning the local structure of turbulence in incompressible viscous fluid for very large Reynolds numbers. J. Fluid Mech., 13, p. 82-85.
341
Bibliography
KOPELMAN R. [1986] - Rate processes on fractals: theory, simulations and experiments. J. Stat. Phys., 42, p. 185. KOZAK J.J. [1979] - Phase transitions as a problem in bifurcation theory. In Bifurcation theory, edited by O. Gurel and E. Rossler, Ann. N. Y. Acad. Sciences, 316, New York. KREMER K. and BINDER K. [1988] - Monte Carlo simulation of lattice models for macromolecules. Computer Physics Reports, 7, p. 259-310. KUPIAINEN A. [1994] - Renormalization of parabolic partial differential equations. Proceedings of the Xlth congress de of Mathematical Physics, (Paris, 18-23 July 1994) edited by D. Iagolnitzer. International Press, Cambridge, Mass. KURAMOTO E.
[1984] - Chaos and statistical methods. Springer, Berlin.
LANDAU L.D. [1944]
- On the problem of turbulence. Dokl. Akad. Nauk SSSR, 44, p. 339.
LANDAU L.D. [1950] - Collected papers of Landau, edited by D. ter Haar, Gordon and Breach, New York. LANDAU L.D. and LIFSCHITZ E.M. [1959] - Fluid mechanics. Pergamon, Oxford. LANFORD O.E. [1973] - Entropy and equilibrium states in classical statistical mechanics. In Statistical mechanics and mathematical problems, Series "Lecture Notes in Physics" vol. 20, Springer, Berlin, p. 1-113. LANFORD O.E. [1982 ] - A computer assisted proof of the Feigenbaum conjecture. Bull. Am. Math. Soc., 6, p. 427. LANFORD O.E. [1984] - Functional equations for circle homeomorphisms with golden ratio rotation number. J. Stat. Phys., 34, p. 57-73. LANG S.
[1962] - Introduction to differentiable manifolds. Wiley, New York.
LASOTA A. and MACKEY M.C. [1985] - Probabilistic properties systems. Cambridge Univ. Press, Cambridge.
of deterministic
LAVAL and GRESILLON D., eds. [1980] - Intrinsic stochasticity in plasmas. Les Editions de Physique, Courtabceuf, Orsay. LEE T.D. [1981] - Particle physics and introduction to field theory. Harwood Academic Pub!., London. LE GUILLOU J.C. and ZINN-JUSTIN J. [1977] - Critical exponents for the n-vector model in three dimensions from field theory. Phys. Rev. Lett., 39, p. 95-98. LE GUILLOU J.C. and ZINN-JUSTIN J. LEMARCHAND H. and VIDAL C. chimiques. Hermann, Paris.
[1989] - J. Phys. Lett. (Paris), 50, p. 1365.
[1988] - La réaction créatrice: dynamique des systèmes
LEONTIDIS E., FORREST B.M., WIDMANN A.H. and SUTER U.W. [1995] - Monte Carlo algorithm for the atomistic simulation of condensed polymer phases. J. Chem. Soc. Faraday Trans., 91, p. 2355-2368. LESIEUR M.
[1987] - Turbulence in fluids. Kluwer Academic Publishers, Dordrecht.
LES1EUR M. and METAIS 0. [1989] Academic Publishers, Dordrecht.
Turbulence and coherent structures. Kluwer
LESNE A. [1996] - Renormalizations. Proceedings of a congress organized by "European Women in Mathematics" 1HP, Paris, 14-15 Juin 1996.
342
Bibliography
LEVY P. [1948] Processus stochastiques et mouvement brownien. Gauthier-Villass, Paris (published again in 1965). -
Li T.Y. and YORKE J.A. [1975] - Period three implies chaos, Amer, Math. Monthly, 82, p. 985-992.
LIBCHABER A., LAROCHE C. and FAUVE S. [1982] Period doubling in mercury, a qualitative measurement. J. Phys. Lett. (Paris), 43, p. L211. -
LIBCHABER A. and MAURER J. [1980] Une expérience de Rayleigh-Bénard de géométrie réduite; multiplication, accrochage et démultiplication de fréquences. J. Phys. Coll. (Paris), 41, p. C3-51. -
LICHTENBERG A.J. and LIEBERMAN M.A. Springer, Berlin,
[1982 ]
-
Regular and stochastic motion.
LINSAY P.S. [1981] - Period doubling and chaotic behaviour in a driven anharmonic oscillator. Phys. Rev. Lett., 47, p. 1349. LORENZ E.N. [1963] - Deterministic non periodic flow. J. Atmospheric Science, 20, p. 130-141.
LUKACS E.
[1975]
Stochastic convergence. Academic Press, New York.
-
LUCK J.M. [1983] - Diffusion in a random medium: a renormalization-group approach. Nucl. Phys. B, 225, p, 169-184,
LUCK J.M. [1992]
-
Systèmes désordonnés unidimensionnels. Collection Aléa-Saclay,
CEA, Gif-sur-Yvette. LYAPUNOV A.M. [1906] - Sur la masse liquide homogène donnée d'un mouvement de rotation. Zap. Acad. Nauk, St. Petersbourg, 1, p. 1. MA S.K. [1973]
-
Introduction to the renormalization group. Rev. Mod. Plays., 45, p, 589.
MA S.K. [1976) - Modern theory of critical phenomena. Benjamin, Reading Mass.
MA S.K 11985] - Statistical mechanics. World Scientific, Singapore. Critical dynamics of ferromagnets in 6 MA S.K. and MAZENKO G.F. [1974] dimensions. Phys. Rev. Lett., 33, p. 1383-1385. -
E
Critical dynamics of ferromagnets in 6 - ( MA S.K. and MAZENKO G.F. [1975] dimensions: general discussion and detailed calculation. Phys. Rev. B, 11, p. 40774100. -
MAC
CoY B.M. and
WU T.T. [1973 ] - The two-dimensional Ising model. Oxford Univ.
Press, Oxford. MAC KAY R.S. [1983 ] A renormalization approach to invariant circles in area preserving maps. Physica D, 7, p. 283. -
V
MAC MULLEN C.T. [1994].- Complex dynamics and renormaazation. Princeton Univ.
Press, Princeton. MAC QUARRIE D.A.
[1973]
-
Statistical mechanics. Harper & Row, Ncw York.
MANDELBROT B. [1967] How long is the coast of Britain? Statistical similarity and fractional dimension. Science, 155, p. 636-638. -
[1976] Géométrie fractale de la turbulence. Dimension de flausdorff, dispersion et nature des singularités du mouvement des fluides. C.R Acad. Sci. (Paris), 282 A, p. 119.
MANDELBROT B.
343
Bibliography
MANDELBROT
B.
[1977] - Fractals:form, chance and dimension. Freeman, San Francisco.
MANDELBROT B. [19801- Fractal aspects of the iteration of zi-. Az(1 - z) for complex A and z. Annals NY Acad. Sciences, 357, p. 249-259. MANDELBROT B. [1982] - The Fractal geometry of Nature. Freeman, San Francisco.
4
MANDELBROT B. [1984] - Fractals in physics: squig clusters, diffusions, fractal measures and the unicity of fractal dimensionality. J. Seat. Phys., 34, p. 895.
B. [1986] - Fractals and multifractals: noise, turbulence and non-fractal patterns in physics. Martinus Nijhof, Dordrecht.
MANDELBROT
MANDELBROT B. [1988] - An introduction to multifractal distribution functions. In Fluctuations and pattern formation, edited by ILE. Stanley and N. Ostrowsky, Kluwer
Academic Publishers, Dordrecht. [1989] - Multifractal measures, especially for geophysicists. Pure Appl. Geophys.,131, p. 5-42.
MANDELBROT B.
MANDELBROT B. and EVERTZ C. J .G . [1991] - Exactly self-sirnilar left-sided multifractals. In Fractals and disordered systems, edited by A. Bunde and S. Havlin, Springer, Berlin, p. 323-344. MANDELBROT B. and EVERTZ C.J.G. [1992] Multifractal measures. Contribution in Chaos et fractals by 11.0. Peitgen, IL Jiirgens and D. Saupe, Springer, Berlin, p. 921. -
Physical properties of a new fractal model MANDELBROT B. and GIVEN J.A. [1984] of percolation clusters. Phys. Rev. Lett., 52, p. 1853. -
Fractional brownian motions, fracMANDELBROT B. and VAN NESS J.W. [1968] tional noises and applications. Soc. Ind. Appt. Math., 10, p. 442-437. -
MANDELBROT B. and WALLIS J.R. [1968] Water Resour. Res., 4, p. 909-918.
-
Noah, Joseph and operational hydrology.
Computer experiments with fractional MANDELBROT B. and WALLIS J.R. [1969] gaussian noises. Water Resour. Res., 5, p. 228-267. -
MA! É R.
[1987]
-
Erg odic theory and differentiable dynamics. Springer, Berlin.
MANNEVILLE P.and POMEAU Lett., 75 A, p. 1.
Y.
[1979] -
Y.
Intermittency and the Lorenz model. Phys.
Intermittent transition to turbulence in [1980] dissipative dynamical systems. Commun. Math. Phys., 74, p. 189-197.
MANNEVILLE P.and POMEAU MANNEVILLE P., POMEAU SET, Paris.
Y. [1981]
-
-
Intermittency and the Lorenz mode/. Physics ID-
E., PARIS! G., RUELLE D. and WINDEY P. [1983] Random walk in a random environment and 1/f noise. Phys. Rev. Left, 50, p. 1223-1225.
MARINARI
-
A.,
SENO F. and STELLA A.L. [1989] Real space renormalization group approach to the theta point of a linear polymer in 2 and 3 dimensions. Physica A, 156, p. 679-688.
MARITAN
MATTIS D.C.
-
[1988]
-
The theory of magnetism. Springer, Berlin.
MAXWELL J.C. [1890] On Boltzmann's theorem on the average distribution of energy in a system of material points. In The scientific papers of J. C. Maxwell, edited by W. Niven, Cambridge Univ. Press, Cambridge. Vol II, p. 713-741. -
344
Bibliography
MAY R.M. [1976] Simple mathematical models with very complicated dynamics. Nature, 261, p. 459-467. —
IVIAZENKO G.F. and VALLS O.T. [1982] — The real-space dynamic renormalizationgroup. In Real-space renormahzation, edited by T.W. Burkhardt and J.M.J. van
Leeuwen, Springer, Berlin. MENEVEAU C. and SREENIVASAN K.R. [1987] — Simple multifractal cascade model for fully developed turbulence. Phys. Rev. Lett., 59, p. 1424-1427. MEDINA E., HWA T., KARDAR M. and ZHANG Y.C. [1989 ] Burgers equation with correlated noise: renormalization-group analysis and applications to directed polymers and surface growth. Phys. Rev. A, 39, p. 3053-3075. -
METROPOLIS N., ROSENBLUTH A., ROSENBLUTH M., TELLER AAnd TELLER E. Equation of state calculations by fast computing machines. J. Chem. Phys., [1953 ] —
21, p. 1087-1093. MEYER Y.,
ed.. [1991] — Wavelets and applications. Series RMA, Masson, Paris.
MÉZARD, M., PARISI, G. and VIRASORO, M.A.
[1986]
—
Spin glass theory and
beyond. World Scientific, Singapore.
MILLER W.
[1972] — Symmetry groups and their applications. Academic Press, New York.
MONIN A.S. and YAGLOM A.M. Cambridge, Mass.
[1975]
—
Statistical fluids mechanics. MIT Press,
MOSER J. [1962] On invariant curves of area-preserving mappings of an annulus. /Yacht-. Akad. Wiss. Gottingen Math. Phys. la., 2, p. 1-20. -
MOSER J.
[1967] 169, p. 163.
-
Convergent series expansions of quasi-periodic motions. Math. Ann.,
[1973 ] — Stable and random motions in dynamical systems. Princeton Univ. Press, Princeton.
MOSER J.
[1986] — A Monte Carlo approach to fractal dimensions of infinite clusters, backbone and cutting bonds for percolation. J. Phys. A, 19, p. L275.
NAGATANI T.
[1987 ] — Renormalization-group approach to multifractal structure of growth probability distribution in diffusion-limited aggregation. Phys. Rev. A„ p. 5812-5819.
NAGATANI T.
Crossover effects in chemicalNAGATANI T., LEE J. and STANLEY H.E. [1992] dissolution phenomena: a renormalization-group study. Phys. Rev. A, 45, p. 24711-
2479. NAIMARK M.
[1967] — Linear differentia/ operators. Harrap, London.
Site-bond percolation by position-space NAKANISHI H. and REYNOLDS P.J. [1979) renormalization-group. Phys. Lett. A, 71, p. 252. —
NAUENBERG M. and RUDNICK J. [1981] Universality and the power spectrum at the onset of chaos. Phys. Rev. B, 24, p. 439. —
NAYFEH A.H.
[11 973]
—
Perturbation methods. Wiley, New York.
NELKIN M. [1989] What do we know about self-similarity in fluid turbulence? J. Stat. Phys., 54, p. 1-15. -
M. [1994] V NELKIN 43, p. 143-181.
-
Universality and scaling in fully developed turbulence. Adv. Phys.,
345
Bibliography
NEWHOUSE S., RUELLE D. and TAKENS F. [1978] - Occurrence of strange axiom-A attractors near quasi-periodic flow on Ttm , m > 3. Commun. Math. Phys., 64, p. 35.
NICOL'S G. and PRIGOGINE 1. [1989] New York. ONSAGER L.
—
Exploring complexity: an introduction. Freeman,
[1944] Crystal statistics: a two-dimensional model with an order-disorder Phys. Rev., 65, p. 117. -
transition.
Statistical physics of polymer solutions: conformation space Y. [1985] V OONOrenormalization-group approach. Adv. Chem. Phys., 61, p. 301-437. -
OPPENTIEINI A.V. and SCHAFER R.W. [1989] Prentice Hall, Englewood Cliffs N.J.
OSTLUND S. and Kim S [1985] Scripta, 19, p. 193-198.
-
-
Discrete time
and
signal processing.
Renormalization of quasi-periodic mappings. Physica
OTT E. [1981] - Strange attractors and chaotic motions of dynamical systems. Rev. Mod. Phys., 53, p. 655. The kinematics of mixing: stretching, chaos and transport. OTTINO J.M. [1989] Cambridge Univ. Press, Cambridge. -
PALADIN G. and VULPIANI A. Phys. Reports, 156, p. 147.
[1987] - Anomalous scaling laws in multifractal objects.
PEITGEN H.O., JÜRGENS H. and SAUPE D. Berlin.
PERKO L.
[1991 ] -
PERRIN, J.
[1916]
PIETRONERO L.,
[1992] - Chaos and fractals. Springer,
Differentia/ equations and dynamical -
Atoms.
systems. Springer, Berlin.
Constable, London.
ed. [1989] - Fractals physical origin and properties. Plenum Press, New
York.
E.,
eds. [1986] - &actals in physics. North-Holland,
M. and BERGENSEN B. Scientific, Singapore.
[1994] - Equilibrium statistical physics. World
PIETRONERO L. and TOSATTI
Amsterdam. PLISCHKE
POINCARÉ
H.
[1880]
-
Sur les courbes définies par des équations différentielles. C.R. Acad.
Sci. (Paris), 90, p. 673-675. POINCARÉ H.
[1892]
-
Les Méthodes nouvelles de la mécanique céleste I, If, III. Gauthier-
Villars, Paris. eds. [1988] - Disorder and mixing: convection, diffusion and reaction in random materials and processes. NATO ASI Series E, vol. 157, Kluwer Academic Publishers, Dordrecht .
POMEAU
Y., GUYON E. and NADAL J.P.,
InterRoux J.C., Rossi A., BACHELART S. and VIDAL C. [1981] mittent behaviour in the Belousov-Zhabotinsky reaction. J. Phys. Lett. (Parts), 42,
POMEAU Y,
—
p. L271. PRIVMAN V., ed. [1990] - Finite size scaling and numerical simulation bf statistical systems. World Scientific, Singapore. PYNNE R. and RISTE T.,
Plenum Press, New York.
eds. [1987] - Time-dependent effects in disordered materials.
346
Bibliography
A., eds. [1985] -
V PYNNE R. and SKELITORP
Scaling phenomena in disordered systems.
Plenum Press, New York,
G. [1961]
RACAH
Group theory and spectroscopy. CERN, Genève.
-
R. and SOULETIE Amsterdam.
J. [1982) -
RAMMAL
Magnetism of metals ans alloys. North-Holland,
[1983] Random walks on fractal structures and and TOULOUSE G. percolation clusters. J. Phys. Lett., 44, p. 13.
RAMMAL
R.
-
D., OSTLUND S., SETHNA J. and SIGGIA E. [1982] Universal transition from quasiperiodicity to chaos in dissipative systems . Phys. Rev. Lett., 49, p. 132.
RAND
RAND
D.,
RENYI
A. [1970]
REVUZ
D. [1975j
E.
[1983] Quasi-periodicity dissipative systems: a renormalization analysis. Physica D, 8, p. 303. OSTLUND S., SETHNA J. and SIGGIA
in
Probability theory. North-Holland, Amsterdam.
-
Markov chains. North-Holland, Amsterdam ,
P.J., KLEIN W.
REYNOLDS
-
and STANLEY H.E.
[1977] - J. Phys. C, 10, p. L167.
P.J., STANLEY H.E. and KLEIN W. [1980] - Large-cell Monte Carlo renormalization-group for percolation. Phys. Rev. B, 21, p. 1223-1245.
REYNOLDS
L.F.
[1922] Press, Cambridge.
RICHARDSON
V.
RIVASSEAU
[1991]
-
-
Weather prediction by numerical process. Cambridge Univ.
,From perturbative to constructive
renormafization. Princeton
Press, Princeton.
Univ.
RUELLE
D. [1978a] -
Statistical mechanics, rigorous results. Benjamin, New York.
RUELLE
D. [1978b]
Thermodynamic formalism. Addison-Wesley, London.
RUELLE
D. [1980]
RUELLE
D. [1989a] -
-
-
Strange attractors. Math. Intelligesricer, 2, p. 126-137.
D.
Chaotic evolution and strange attractors. Cambridge Univ. Press. of differentiable dynamics
[1989b] Elements Academic Press, London.
RUELLE
-
and bifurcation theory.
D. [1991] The turbulent fluid as a dynamical system. In New perspectives in turbulence, edited by L. Sirovich, Springer, Berlin, p. 123-138.
RUELLE
-
D. and SINAI Y. [1986 ] back. Physica A, 140, p. 1-8.
RUELLE
-
From dynamical systems to statistical mechanics and
On the nature of turbulence. and TAKENS F. [1971] Phys., 20, p. 167-192 and Commun. Math. Phys., 23, p. 343-344.
RUELLE
RYDER
D.
-
L. [1985]
-
Quantum
D.H. and
SATTINGER
field theory. Cambridge
WEAVER 0.
Commun. Math.
Univ. Press, Cambridge.
[1986] - Lie groups and algebras. Springer, Berlin.
Scaling theory for noisy and MARTIN P.C. [1981] period-doubling transition to chaos. Phys. Rev. Lett., 46, p. 935.
SCHRAIMAN
B.,
SCHULMAN,
L.S.
WAYNE
[1981]
C.E.
-
-
Techniques and applications of path integration. Wiley, New
York. Deterministic chaos. Physik - Verlag, Weinheim.
SCHUSTER
H.Q.
SCHWARTZ
L. [1978] - Théorie des distributions. Hermann, Paris.
[1984]
-
Bibliography
347
SHAPIRo B. [1979] - Real - space renormalization in the percolation problem. J. Phys. C, 12, p. 3185. [1982] - Scaling behaviour in a map of a circle into itself. Physica D, 5,
SHENKER S.J.
p. 405. SHENKER S.J. and KADANOFF L.P.
[1982] - Critical behaviour of a KAM trajectory.
J. Stat. Phys., 27, p. 631. SHIRKOV D.V., KAZAKOV
D.
AND VLADIMIROV A. , eds. [1988]
World Scientific,
Singapore. SHIRKOV D.V. AND PRIEZZHEV V.B. , eds. [1992] - Renormalization group. Proceedings of 1991 Dubna conference World Scientific, Singapore.
Analogs of renormalization-group SHLESINGER M.F. and HUGUES B.D. [1981] transformations in random process. Physica A, 109, p. 597 608. —
-
SHUR M. [1986]
—
Global stability of dynamical systems, Springer, Berlin.
SIERPINSKI W. [1915] - Sur une courbe cantorienne dont tout point est un point de rami fi cation. C. R. Acad. Paris, 160, p. 302, SINAI Y.G. [1976a]
—
SINAI Y.G. [1976b] -
Introduction to ergodic theory. Princeton Univ. Press, Princeton.
Self-similar probability distributions. Th. Prob. Appt. 21, p. 64-80.
SINAI YA.G. [1982] - Limit behavior
of one-dimensional random walks in random
environments. Th. Prob. Appl., 27, p. 247 258. -
SIROVICH L., cd, [1991] SMALE S.
—
New perspectives in turbulence. Springer, Berlin.
[1967] — Differentiable dynamical systems. Bull. AMS, 73, p. 747 817. -
SOKAL A.D. [1989] Monte Carlo methods in statistical mechanics: foundations and new algorithms. Lectures for the "33e cycle de Physique en Suisse Romande" Lausanne. —
[1968] - Dependence of critical properties on dimensionality of spins. Phys. Rev. Lett., 20, p. 589.
STANLEY H.E.
[1971] An introduction to phase transitions and critical phenomena. Oxford Univ. Press, Oxford.
STANLEY H.E.
—
ed. [1975] — Cooperative phenomena near phase transitions. MIT Press, Cambridge, Mass.
STANLEY H.E.,
[1991] - Fractals and rnteitifractais: the interplay of physics and geometry. In Fractals and disordered systems, edited by A. Bunde and S. Havlin, Springer, Berlin,
STANLEY H.E.
p. 1-50.
[1988] STANLEY H.E. and MEAKIN P. chemistry. Nature, 335, p. 405-409.
Multifractal
phenomena in physics
and
STANLEY H.E. and OSTROWSKY N., eds. [1988] — Random fluctuations and pattern growth: experiments and models. Kluwer Academic Publishers, Dordrecht. STANLEY H.E., REYNOLDS P.J., REDNER S. and FAMILY F. [1982] Position-space renormafization group models of linear polymers, branched polymers and gels. In Realspace renorrnalization, edited by T.W. Burkhardt and J.M. van Leeuwen, Springer, Berlin, p. 169 206. —
-
STAUFFER D.
[1979]
—
Scaling theory of percolation clusters. Phys. Rep., 34, p. 1 74. -
348
Bibliography
STAUFFER D.
[1985] - An introduction to percolation theory. Taylor Sz Francis, London.
STAUFFER D.and AHARONY A. Francis, London.
[1992] - Introduction to percolation theory. Taylor &
STAUFFER D. and STANLEY H.E. [1990] - From Newton to Mandelbrot: a primer in theoretical physics. Springer, Berlin. STEWART H.B. [1986] - Nonlinear dynamics and
STOCKMAYER
W.H.
chaos. Wiley, New York.
[1944] - J. Chem. Phys., 12, p. 125.
STUECKELBERG E.G. and PETERMANN A. [19531 - La normalisatio n des constantes dans la théorie des quanta. Melt). Phys. Acta, 26, p. 499-520. SWENDSEN, R. [1982] - Monte Carlo renormalization-group. In Real-space renorrnaiization, edited by T.W. Burkhardt and J.M.J. van Leeuwen, Springer, Berlin, p 57. SWENDSEN, R.
[1984] - Monte Carlo renormalization-group. J.Stat.Phys., 34, p. 951-973.
SWINNEY H.L. and GOLLUB J.P. to turbulence, Springer, Berlin,
[1981]
-
Hydrodynamic instabilitie.s and the transition
[1994] - Field-theory renormalization approach to the Kardar-Parisi-Zhang equation. Phys. Rev. E, 49, p. 5046-5057.
TAO SUN and PLISCHKE M.
TEMAM
R. [1979]
-
Navier-Stokes equations. North-Holland, Amsterdam.
TENNEKES Hand LUMLEY J.L. [1972] - A first course in turbulence. MIT Press, Cambridge, Mass.
THOM
R. [1975]
TINKHAM M.
-
Structural stability and morphogenesis. Benjamin, Heading, Mass.
[1964] - Group theory and quantum mechanics. Mc Graw Hill, New York.
TYSON J.J.
[1976] - The Belousov-nabotinsky reaction. Biomathernatics" , Springer, Berlin.
Series "Lecture Notes in
VAN KAMPEN, N.G. [1981] - Stochastic processes in physics and chemistry. NorthHoHand, Amsterdam. VELTMAN M.
11994] - Diagramrnatica. Cambridge Univ. Press, Cambridge.
VICSEK T. and KERTESZ J. [1981] Monte Carlo renormalization-group approach to percolation on a continuum.: test of universality. J. Phys. A, 14, p. L31. -
VIDAL C. and PACAULT A. Springer, Berlin.
[1981] - Nonlinear phenomena in chemical dynamics.
VON KOCH H. [1904] Sur une courbe continue sans tangente, obtenue par une construction géométrique élémentaire. Arkiv ffir Mathernatik, Astronomische, Physik, 1, p. 681-704. -
VuL E.B. and
KHANIN K.M. [1982] - On the unstable manifold of Feigenbaum fixed point. Usp. Mat. Nauk., 37, p. 173.
WALLACE D.J. and ZIA R.P.K. [1974] - Gradient flow and the renormaliza.tion-group. Phys. Lett. A, 48, p. 325. WAX N., ed. [1954] - Selected papers on noise and stochastic processes. Dover, New York. WEGMANN K. and ROESSLER O.E. [1978 ] - Different kinds of chaos in the BelousovZhabotinsky reaction. Z. Naturforsch., 33a, p. 1179.
Bibliography
349
WEINBERG S. [1995] - The
quantutn theory of fields. Cambridge Univ. Press, Cambridge.
WEISSMAN M.B. [1993] - What is a spin glass? A glimpse via mesoscopic noise. Rev. Mod. Phys., 65, p. 829-839. WHITTAKER E.T.
WIENER N.
[1944] - Analytical
dynamics.
Cambridge Univ. Press, Cambridge,
[1976] - Collected works. Edited by P. Massani, MIT Press, Cambridge, Mass.
WIG GINS S. [1990] - Global bifurcations and chaos. Collection "Applied Math. Sc.", vol. 73, Springer, Berlin ,
[1971a] - The renormalization.-group and critical phenomena renormalization and the Kadanoff scaling picture. Phys. Rev. B, 4, p. 3174-3184.
WILSON K.G.
[197113] - The renormalization-group and critical phenomena II: phase space cell analysis of critical behavior. Phys. Rev. B, 4, p. 3184-3205.
WILSON K.G.
[1975a] - Renormalization-group methods. Adv. in Maths., 16, p. 170.
WILSON K.G.
[1975b] - The renormalization-group: critical phenomena and the Kondo problem. Rev. Mod. Phys., 47, p. 773-840.
WILSON K.G.
WILSON K.G. [1983] - The renormalization group and critical phenomena. Rev. Mod. Phys., 55, p. 583-600,
WILSON K. and KOGUT J. [1974] - The renormalization-group and the f-expansion. Physics Rep. , 12, P. 75-200. YAKHOT V. and ORSZAG S.A. [1986) Renormalization group analysis of turbulence. J. Scientific Computing, 1, p. 3. YOSIDA K.
[1971)- Functional analysis. Springer, Berlin.
YOUNG P., ed. [1996] - Spin glasses and random fields. World Scientific, Singapore. ZAKHAROV V.E., Lvov V.S. and FA LKOVICII G. [1992] - Kolmogorov spectra of turbulence. Springer Series in Nonlinear Dynamics, Berlin. ZHANG S-Y.
[1991)- Bibliography on chaos, World Scientific, Singapore,
ZINN-JUSTIN J.
[1990] - Quantum field theory, Clarendon, Oxford.
ZINN-JUSTIN J. [1993] - Quantum field theory and critical phenomena. Oxford University Press, Oxford,