Brownian Bridge and Self-Avoiding Random Walk.
|
|
- Edgar Flowers
- 5 years ago
- Views:
Transcription
1 Brownian Bridge and Self-Avoiding Random Walk. arxiv:math/02050v [math.pr] 9 May 2002 Yevgeniy Kovchegov yevgeniy@math.stanford.edu Fax: November 2, 208 Abstract We derive the Brownian bridge asymptotics for a scaled self-avoiding walk conditioned on arriving to a far away point n a for a (Z,0,...,0), and outline the proof for all other a in Z d. Introduction.. Self-Avoiding Walks and Brownian Bridge. First we briefly introduce the notion of a self-avoiding walk based on the material rigorously presented in [4], and the notion of the Brownian Bridge followed by the history of the problem solved as well as that of the tools and ideas used in producing the results. We will conclude the introduction with the word description of the results of this research paper given in light of the chronological perspective, with the brief outline of the proofs that follow. Self-Avoiding Random Walk (SARW): An N-step self-avoiding walk (path) ω on Z d, beginning at 0 is a sequence of sites: ω(0) = 0,ω(),...,ω(N) with ω(j+) ω(j) = and ω(i) ω(j) for all i j. We let c N denote the number of N-step self-avoiding walks beginning at zero. It had been established that the limit representing the connective constant µ = lim N c N N exists due to a subadditivity property of logc N (see [4]). We also let c N (x,y) to be the number of N-step self-avoiding walks ω with ω(0) = x and ω(n) = y. The two-point function g β (x,y) (as defined below) is an important tool in the theory of self-avoiding walks: g β (x,y) c N (x,y)e βn = e β ω, N=0 ω:x y where the second sum is taken only over all self-avoiding walks ω : x y on the lattice. For the simplicity of notation (due to the shift-invariance property of c N (x,y) ) we denote g β (x) g β (0,x). The supercritical β > β c (d) is the one for which the equivalent sums above are finite. It was shown (see [4]) that for the supercritical β, the bubble diagram B d (β) x g β (x) 2
2 is finite. The significance of the bubble diagram is discussed in Section.5 of [4]. Since the radius of convergence e βc(d) =, it is apparent that the two-point function µ decays exponentially: g β (0,x) C β e c β x () for all β > β c (d) and some corresponding C β,c β > 0. The notion of a mass of a two-point function applies here as well. The mass m(β) is the rate of exponential decay of g β (x,y) in the direction of the first coordinate vector: m(β) = liminf n logg β (0,(n,0,...,0)). n It can be shown that the liminf above can be replaced by the limit. Brownian Bridge: defined as a sample-continuous Gaussian process B 0 on [0,] with mean 0 and EBs 0B0 t = s( t) for 0 s t. So, B0 0 = B0 = 0 a.s. Also, if B is a Brownian motion, then the process B t tb (0 t ) is a Brownian Bridge. For more details see [2], [7] and [8]. In a more general setting, we call the process B 0, a t Bt 0 +t a a Brownian Bridge connecting points zero and a..2 History of the Problem, the Results and Strategy of the Proof. The main goal of this paper is to show the derivation of the weak Brownian bridge asymptotics for a scaled self-avoiding walk conditioned on arriving to a far away point n a ( a Z d ). The technique used in the proofs originates from the methodology developed in the process of establishing a precise Ornstein-Zernike decay for a variety of spin systems and lattice field theories and the development of the renewal theory. It turned out that the technique developed by Ornstein and Zernike in 94 for the case of the classical fluid can be implemented in many classical models of statistical mechanics (self-avoiding walks, percolation, 2D Ising model and many other spin systems) for all noncritical temperatures. For this, for the given two-point function, one needs to construct a direct correlation function with a strictly greater rate of decay. This approach was implemented in in the case of the d-dimensional self-avoiding walks [6] giving the precise Ornstein-Zernike behavior of the two-point function g β (0,n a) connecting the origin to a point on an axis (the case a = ( a,0,...,0)) for all noncritical β. There the so called mass gap condition (or separation of mass)is proved. In that case, the two-point function with a different rate of decay is the generating function corresponding to the self-avoiding walks with all non-trivial (more than one) intersections with the hyper spaces {x = c} situated in between the origin and the destination point. The work of proving the Ornstein-Zernike behavior (the coefficient of order x d 2 near the decay exponent of the two-point function) was completed in [] for any supercritical value of the parameter β > β c (d). There the complete precise asymptotics () of the decay was derived in any direction a as the result of an extensive study of the geometric properties of corresponding equi-decay level sets, broadening the methodology of [6]. 2
3 The corresponding developments in subcritical bond percolation model followed the above advances in the theory of self-avoiding walks. In [], [3] and [4] some similar equi-decay level sets are studied, and corresponding Ornstein-Zernike asymptotics is produced. This technique was used in [3] together with the technical result of section.3 to produce a Brownian bridge asymptotics of a scaled percolation cluster conditioned on reaching a far away point, and also proving the shrinking of such clusters. In this paper, we follow up on the result of [3]. We prove the weak convergence of a scaled interpolation skeleton going through the regeneration points (see definition 4) of a self-avoiding walk, and terminating at a far away point n a to Time (d )-dimensional Brownian bridge as n. Later, the shrinking of the self-avoiding walk to the above interpolation skeleton is proved (see section 2.5). We prove the result for a = ( a,0,...,0) given an appropriate measure on such self-avoiding walks (see (6)). We outline the proof of the result for all other a in Z d..3 Asymptotic Convergence to Brownian Bridge. The following technical result was proved in [3]. Let X,X 2,... be i.i.d. random variables on Z d with the span of the lattice distribution equal to one (see [8], section 2.5), and let there be a λ > 0 such that the moment-generating function for all θ B λ. E(e θ X ) < Now, for a given vector a Z d, let X X i = [t i,y i ] f Z d when written in the new orthonormal basis such that a = [ a,0] f (in the new basis [, ] f R R d ). Also let P[ a X i ] > 0] =. We define the process [t,yn,k (t)] f to be the interpolation of 0 and [ t n a i, n Y i ] i=0,,...,k f, in Section 2.2 we will show that Technical Theorem. The process {Y n,k for some k such that [t k,y k ] f = n a} (2) conditioned on the existence of such k converges weakly to the Brownian Bridge (of variance that depends only on the law of X ). 2 The Main Result in SARW. In this section we work only with supercritical SARW (β > β c (d)). 2. Preliminaries. Here we briefly go over the definitions that one can find in [4]. We start with the decay rate τ β ( x): τ β ( x) lim n n logg β([n x]), 3
4 where the limit is always defined since g β ( x+ y) B d (β) g β( x) g β ( y) B d (β) B d (β). Now, τ β ( x) is the support function of the compact convex set K β n S d { r R d : r n τ β ( n)}, with non-empty interior int{k β } containing point zero. Let ω(j) = (ω (j),...,ω d (j)) be a self-avoiding path defined for j [a,b] N, a b Z +. Definition. We call ω a bridge if ω (a) < ω (j) ω (b) for all a < j b. If x = ω(a) is the initial point and y = ω(b) is the final point, we write ω : x b y. For x Z d, we define the cylindrical two-point function h( x) e β ω, where h( x) = δ 0 ( x) for all x {0} Z d. ω:0 b x Definition 2. We say that k N (ω (a) < k < ω (b)) is a break point of ω if there exists r [a,b] such that ω (j) k whenever j r and ω (j) > k whenever j > r. Definition 3. A bridge ω : x b y (where, as before, x = ω(a) and y = ω(b)) is called irreducible if it has no break points. In that case we write ω : x ib y. Now, for x Z d, we define the irreducible two-point function f( x) e β ω, with f( x) = δ 0 ( x) for all x {0} Z d. ω:0 ib x 2.2 SARW and Regeneration Structures. It turned out that if counting the bridges between the origin and a point k = (k x,k y ) N Z d, that f and h satisfy the recurrence equation (see [4]): h( k) = k x i= l Z d f(i,l)h(k x i,k y l), (3) 4
5 which together with h(0, k) = δ 0 ( k) (for k Z d ) are called the Ornstein-Zernike equations. Now, for any r Z d, we define H n ( r) e r k h(n, k) and F n ( r) e r k f(n, k), (4) k Z d k Z d as well as the corresponding mass m H ( r) lim n + n logh n( r) and m F ( r) lim n + n logf n( r). The Ornstein-Zernike asymptotics has been proved for the cylindrical two-point function h( ) (see [6] and []), using the mass gap condition, e.g. existence of a point r o Z d, inside a neighborhood of points with finite mass m H, such that m H ( r o ) > m F ( r o ). It was also shown (see [], Section 2) that the mass gap condition with the renewal theorem ([4], Appendix B) imply that exp{ nm H ( r o )}F n ( r o ) is a probability distribution (where r o is as above): exp{ nm H ( r o )}F n ( r o ) =. (5) n N As it was mentioned in the introduction, the mass gap condition was crucial in obtaining the Ornstein-Zernike decay (see []): Theorem. For all d 2 and β > β c (d), g β (x) = ψ β ( x )e τβ(x) x x d 2 (+o()) uniformly in x, where ψ β ( ) is analytic on the unit circle. 2.3 Measure Q r0 (x). We notice that substituting the sum F n ( r o ), as defined in (4), into (5) we obtain (after some simple manipulations) an enhanced version of (5): x N Z d f( x)e x ( mh( ro), ro) =, where r o ( m H ( r o ), r o ) K β as it was shown in [], Section 3. Now, let for x N Z d, Q r0 ( x) f( x)e x r 0. Due to the equation above, Q r0 ( ) is a probability measure on N Z d. It is similar to the regeneration measure, defined for the subcritical bond percolation model in Section 4 of [4], and later used in [3] for derivation of Brownian Bridge assymptotics for that model. The mass gap condition implies the exponential decay of Q r0 ( x). 5
6 2.4 The Result For a = (,0,...,0). We fix a Z d. We let for a supercritical constant β and all n N, P n ( ) to be a law on a set of self-avoiding random paths ω, conditioned on ω being a bridge between 0 and n a (ω : 0 b n a). More precisely, we define P n as P n (ω : 0 b n a) exp( β ω ) exp( β ω ) =. (6) exp( β ω ) h(n a) ω:0 b n a For now, we let a = [,0] (,0,...,0) and r o = (Z +,0,...,0) K β. Here, we define the regeneration points in a way, similar to that, used to define the regeneration points for the case of Bernoulli bond percolation model: Definition 4. Given a self-avoiding path ω, and a break point b. We say that ω(t b ) is the corresponding regeneration point if T b = max{t : ω (t) = b}. In a very important step, we notice that given the Ornstein-Zernike equations (3) above and the definition of probability distribution P n ( ), we can explicitly write (in terms of measure Q ro ) the probability of the walk passing through the particular regeneration points s x, (s 2 x +x 2 ),..., (s k x +...+x k ), where are all x i Z + Z d : P n [s,...,s k are reg. pts. ] =... h(n a) = = ω:0 ib s e β ω h(n a) f(x )...f(x k ) where s 0 0 and s k x +...+x k +x k = n a. κ ω:s k ib s k e β ω Q ro (x )...Q ro (x k ) ς +...+ς Q κ=n a r o (ς )...Q ro (ς κ ), (7) We recall that the moment generating function (the Laplace transform) under the measure Q ro ( ) is finite in a neighborhood of zero: E r0 (e θ X ) < for all θ B λ(0). We use the brackets [, ] R R d to denote the coordinates of R d vectors for the simplicity of notation. Obviously a = [,0]. We want to prove that the process corresponding to the last d coordinates in the new basis of the scaled ( times along a n and n times in the orthogonal d dimensions) interpolation of regeneration points of the self-avoiding path ω conditioned on ω : 0 b n a converges weakly to the Brownian Bridge B o (t) (with variance that depends only on measure Q r0 ) where t represents the scaled down first coordinate. Let X,X 2,... be i.i.d. random variables distributed according to Q r0 law. We interpolate 0,X,(X +X 2 ),...,(X +...+X k ) and scale by n n along < a > < a > to get the process [t,y n,k (t)]. The technical theorem (2) implies the following 6
7 Theorem 2. The process {Y n,k for some k such that X +...+X k = n a} conditioned on the existence of such k converges weakly to the Brownian Bridge(with variance that depends only on measure Q r0 ). Now, let for y,...,y k Z d with positive increasing first coordinates, γ(y,...,y k ) be the last (d ) coordinates in the new basis of the scaled ( n n ) interpolation of points 0,y,...,y k (where the first coordinate is time). Notice that γ(y,...,y k ) C o [0,] d as a function of scaled first coordinate whenever y k = n a. By the important observation (7) we ve made before, for any function F( ) on C[0,] d, k x +...+x k =n a F(γ(x,x +x 2,..., k i= x i)) P n [0 hr 0 x ; regeneration points: x,x +x 2,..., k x i = x] i= = k = e r 0 n a k k F(γ(x,x +x 2,..., x i ))f(x )...f(x k ) x +...+x k =n a i= k F(γ(x,x +x 2,..., x i ))Q r0 (x )...Q r0 (x k ). x +...+x k =n a i= Therefore, for any A C[0,] d P p [γ(regeneration points of ω) A ω : 0 b n a] = = k k x +...+x k =n a I A(γ(x,x +x 2,..., k i= x i))f(x )...f(x k ) k x +...+x k =n a f(x )...f(x k ) x +...+x k =n a I A(γ(x,x +x 2,..., k i= x i))q r0 (x )...Q r0 (x k ) k x +...+x k =n a Q r 0 (x )...Q r0 (x k ) = P[Y n,k A for the k such that X +...+X k = n a k such that X +...+X k = n a]. Hence, we have proved the following Corollary. The process corresponding to the last d coordinates of the scaled ( n n ) interpolation of regeneration points of the self-avoiding path ω (with the scaled first coordinate denoting the time interval) conditioned on ω : 0 b n a converges weakly to the Brownian Bridge (with variance that depends only on measure Q r0 ). 7
8 2.5 Shrinking of the Self-Avoiding Walks. Here we again let a = [,0] (,0,...,0) and r o = [Z +,0] K β. In the way of proving that the scaled walk ω : 0 b n a shrinks, we shell need to show that the consequent regeneration points are situated relatively close to each other: Lemma. for n large enough. P p [max i x i x i > n /3, x i - reg. points 0 b n a] < n Proof. Since r o = [ r o,0] K β and therefore for all [v,v 2 ] Z d, Hence, by the pseudo-linearity of τ β ( ), Now, by the convexity of τ β ( ), r o [v,v 2 ] = r o [v,0] τ β ([v,0]) τ β ([v,v 2 ]) r o [,0] = τ β ([,0]) and r o 2 = τ β ( r o ). τ β ( a) = [τ β (),0] = [ r o,0] = r o. τ β ( a) τ β ( a x n ) ( x n ) x x τ β( a) for x Z d ( x 0), and therefore τ β (n a) τ β (n a x) = x τ β( a) τ β ( a x n ) ( x n ) x τ β ( a) = r x. Thus, since Q r0 ( x) decays exponentially and therefore f( x)e τ β(n a) τ β (n a x) Q r0 ( x) and also decays exponentially. Hence by Ornstein-Zernike result (Theorem ), P p [n /3 < x, x-first reg. point 0 b n a] = n /3 < x f( x) h(n a x) h(n a) < n 2 for n large enough. So, since the number of the regeneration points is no greater than n, for n large enough. P p [max i x i x i > n /3, x i - reg. points 0 b n a] < n 8
9 Now, it is really easy to check that there is a constant λ f > 0 such that f( x) > e λ f x for all x such that f( x) 0 (here we only need to connect points zero and x with an S - shaped irreducible bridge). Hence, due to the exponential decay () of the two point function g β (x,y), for a given ǫ > 0, P p [ the walk {ω(i)} i=0,..., ω( x) [R,B d ǫ n (0)] 0 ib x] < C β e λ f x c β ǫ n, and therefore, summing over the regeneration points, we get P p [ the scaled walk {ω(i)} i=0,..., ω( x) ǫ-neighbd. of [0,] γ( reg. points ) 0 b n a] for n large enough due to the lemma above. < n +nc βe λ f x c β ǫ n We can now state the main result for a = [,0]: Main Theorem. The process corresponding to the last d coordinates of the scaled ( n n ) interpolation of regeneration points of the self-avoiding path ω (with the scaled first coordinate denoting the time interval) conditioned on ω : 0 b n a converges weakly to the Brownian Bridge (with variance that depends only on measure Q r0 ). Also for a given ǫ > 0 P p [ the scaled walk {ω(i)} i=0,..., ω( x) ǫ-neighbd. of [0,] γ( reg. points ) 0 b n a] 0 as n. 2.6 General Case. Now, weturnourattentiontoall a Z d notontheaxis. Itturnedoutthatthemaintheorem of section 2.5 holds for all a in Z d. In a more direct approach used in the corresponding developments in percolation (see Section 4 of [4]) and finite range Ising models (see [5]), we can replicate the same recurrence structures, as those in section 2., in a given direction (say a), yielding the same renewal relations (as in section 2.2). The technique is simpler than that used in percolation and finite range Izing models. We choose a direction vector r K β, we define the corresponding notions of a bridge in the direction r and the r-regeneration points: Definition 5. We call ω an r-bridge if ω(a) r < ω(j) r ω(b) r for all a < j b. If x = ω(a) is the initial point and y = ω(b) is the final point, we write ω : x b( r) y. 9
10 Similarly, we define the cylindrical two-point function h r ( x) e β ω, where h r ( x) = δ 0 ( x) for all x < r >. ω:0 b( r) x Definition 6. We say that ω(k) Z d (a < k < b) is an r-regeneration point of ω if there exists N [a,b] such that ω(j) r ω(k) r whenever j N and ω(j) r > ω(k) r whenever j > N. Definition 7. An r-bridge ω : x b y (where, as before, x = ω(a) and y = ω(b)) is called ω(k) r-irreducible if it has no r-regeneration points. In that case we write ω : x ib( r) y. We again redefine the corresponding irreducible two-point function f r ( x) e β ω, with f r ( x) = δ 0 ( x) for all x < r >. ω:0 ib( r) x The generalized Ornstein-Zernike recurrence equations also hold here: by counting the r-bridges between the origin and a lattice point k < r > < r >, we establish h r ( k) = f r ( m)h r ( k m), (8) where, in the sum, all m Z d. 0< m r k r As in [4], we can replicate all the regeneration structures, and in particular show the existence of a positive λ such that Q r r 0 ( x) f r ( x)e x r 0 is a probability measure whenever r 0 B λ( r) K β. Taking an appropriate r (say r = τ β ( a)), we can show, as it was done in [3] for percolation clusters in subcritical phase, the skeleton convergence and shrinking of the scaled self-avoiding walks, conditioned on arriving to n a. Whence the main theorem of section 2.5 would hold if we scale the walks by n a along < a > and by n in all orthogonal directions (along < a > ). Acknowledgements The author wishes to thank A.Dembo and D.Ioffe for providing him with valuable and insightful comments and suggestions concerning the matter of this research. 0
11 References [] K.S.Alexander, J.T.Chayes and L.Chayes, The Wulff Construction and Asymptotics of The Finite Cluster in Two-Dimensional Percolation. Communications in Math.Phys. 3 (990), -50. [2] P.Billingsley, Convergence of Probability Measures. John Wiley & Sons (968). [3] M.Campanino, J.T.Chayes and L.Chayes, Gaussian Fluctuations in the Subcritical Regime of Percolation. Prob.Th.Rel.Fields 88 (99), [4] M.Campanino and D.Ioffe, Ornstein-Zernike Theory For The Bernoulli Bond Percolation On Z d. (999) to appear Ann.Prob. [5] M.Campanino, D.Ioffe and Y.Valenik, Ornstein-Zernike Theory For The Finite Range Ising Model above T c. preprint (200). [6] J.T.Chayes and L.Chayes, Ornstein-Zernike Behavior for Self-Avoiding Walks at All Noncritical Temperatures. Communications in Math.Phys 05 (986), [7] R.M.Dudley, Real Analysis and Probability. Chapman & Hall (989). [8] R.Durrett, Probability: Theory and Examples (second edition) Duxbury Press (995). [9] G.R.Grimmett, Percolation (second edition) Springer, New York (999). [0] O.Hryniv, On local behaviour of the phase separation line in the 2D Ising model. Probab. Theoty Relat. Fields 0 (998), [] D.Ioffe, Ornstein-Zernike Behaviour and Analyticity of Shapes for Self-Avoiding Walks On Z d. Markov Processes and Related Fields 4 (998), [2] H.Kesten, Percolation Theory For Mathematicians. Birkhäuser, Boston (982). [3] Y.Kovchegov, Brownian Bridge Asymptotics for the Subcritical Bernoulli Bond Percolation. preprint (200) arxiv:math.pr/ [4] N.Madras and G.Slade, The Self-Avoiding Random Walk. Birkhäuser, Boston (993).
Finite Connections for Supercritical Bernoulli Bond Percolation in 2D
Finite Connections for Supercritical Bernoulli Bond Percolation in 2D M. Campanino 1 D. Ioffe 2 O. Louidor 3 1 Università di Bologna (Italy) 2 Technion (Israel) 3 Courant (New York University) Courant
More informationI forgot to mention last time: in the Ito formula for two standard processes, putting
I forgot to mention last time: in the Ito formula for two standard processes, putting dx t = a t dt + b t db t dy t = α t dt + β t db t, and taking f(x, y = xy, one has f x = y, f y = x, and f xx = f yy
More informationModern Discrete Probability Branching processes
Modern Discrete Probability IV - Branching processes Review Sébastien Roch UW Madison Mathematics November 15, 2014 1 Basic definitions 2 3 4 Galton-Watson branching processes I Definition A Galton-Watson
More informationP i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=
2.7. Recurrence and transience Consider a Markov chain {X n : n N 0 } on state space E with transition matrix P. Definition 2.7.1. A state i E is called recurrent if P i [X n = i for infinitely many n]
More informationList of Publications. Roberto H. Schonmann
List of Publications Roberto H. Schonmann (1) J.F.Perez, R.H.Schonmann: On the global character of some local equilibrium conditions - a remark on metastability. Journal of Statistical Physics 28, 479-485
More information6 Markov Chain Monte Carlo (MCMC)
6 Markov Chain Monte Carlo (MCMC) The underlying idea in MCMC is to replace the iid samples of basic MC methods, with dependent samples from an ergodic Markov chain, whose limiting (stationary) distribution
More informationCONSTRAINED PERCOLATION ON Z 2
CONSTRAINED PERCOLATION ON Z 2 ZHONGYANG LI Abstract. We study a constrained percolation process on Z 2, and prove the almost sure nonexistence of infinite clusters and contours for a large class of probability
More informationNon-Essential Uses of Probability in Analysis Part IV Efficient Markovian Couplings. Krzysztof Burdzy University of Washington
Non-Essential Uses of Probability in Analysis Part IV Efficient Markovian Couplings Krzysztof Burdzy University of Washington 1 Review See B and Kendall (2000) for more details. See also the unpublished
More informationON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS
Bendikov, A. and Saloff-Coste, L. Osaka J. Math. 4 (5), 677 7 ON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS ALEXANDER BENDIKOV and LAURENT SALOFF-COSTE (Received March 4, 4)
More informationAdvanced Topics in Probability
Advanced Topics in Probability Conformal Methods in 2D Statistical Mechanics Pierre Nolin Different lattices discrete models on lattices, in two dimensions: square lattice Z 2 : simplest one triangular
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More informationPrime numbers and Gaussian random walks
Prime numbers and Gaussian random walks K. Bruce Erickson Department of Mathematics University of Washington Seattle, WA 9895-4350 March 24, 205 Introduction Consider a symmetric aperiodic random walk
More informationConvergence Rates for Renewal Sequences
Convergence Rates for Renewal Sequences M. C. Spruill School of Mathematics Georgia Institute of Technology Atlanta, Ga. USA January 2002 ABSTRACT The precise rate of geometric convergence of nonhomogeneous
More informationTheory and Applications of Stochastic Systems Lecture Exponential Martingale for Random Walk
Instructor: Victor F. Araman December 4, 2003 Theory and Applications of Stochastic Systems Lecture 0 B60.432.0 Exponential Martingale for Random Walk Let (S n : n 0) be a random walk with i.i.d. increments
More informationCRITICAL BEHAVIOUR OF SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 25, Number 2, October 1991 CRITICAL BEHAVIOUR OF SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS TAKASHI HARA AND GORDON SLADE ABSTRACT.
More informationarxiv:math/ v1 [math.pr] 21 Dec 2001
Monte Carlo Tests of SLE Predictions for the 2D Self-Avoiding Walk arxiv:math/0112246v1 [math.pr] 21 Dec 2001 Tom Kennedy Departments of Mathematics and Physics University of Arizona, Tucson, AZ, 85721
More informationRecurrence of Simple Random Walk on Z 2 is Dynamically Sensitive
arxiv:math/5365v [math.pr] 3 Mar 25 Recurrence of Simple Random Walk on Z 2 is Dynamically Sensitive Christopher Hoffman August 27, 28 Abstract Benjamini, Häggström, Peres and Steif [2] introduced the
More informationGärtner-Ellis Theorem and applications.
Gärtner-Ellis Theorem and applications. Elena Kosygina July 25, 208 In this lecture we turn to the non-i.i.d. case and discuss Gärtner-Ellis theorem. As an application, we study Curie-Weiss model with
More informationON THE ZERO-ONE LAW AND THE LAW OF LARGE NUMBERS FOR RANDOM WALK IN MIXING RAN- DOM ENVIRONMENT
Elect. Comm. in Probab. 10 (2005), 36 44 ELECTRONIC COMMUNICATIONS in PROBABILITY ON THE ZERO-ONE LAW AND THE LAW OF LARGE NUMBERS FOR RANDOM WALK IN MIXING RAN- DOM ENVIRONMENT FIRAS RASSOUL AGHA Department
More informationarxiv: v1 [math.pr] 24 Sep 2009
A NOTE ABOUT CRITICAL PERCOLATION ON FINITE GRAPHS GADY KOZMA AND ASAF NACHMIAS arxiv:0909.4351v1 [math.pr] 24 Sep 2009 Abstract. In this note we study the the geometry of the largest component C 1 of
More informationA NEW PROOF OF THE WIENER HOPF FACTORIZATION VIA BASU S THEOREM
J. Appl. Prob. 49, 876 882 (2012 Printed in England Applied Probability Trust 2012 A NEW PROOF OF THE WIENER HOPF FACTORIZATION VIA BASU S THEOREM BRIAN FRALIX and COLIN GALLAGHER, Clemson University Abstract
More informationarxiv: v1 [math.pr] 8 Oct 2014
Connective Constants on Cayley Graphs Song He, Xiang Kai-Nan and Zhu Song-Chao-Hao School of Mathematical Sciences, LPMC, Nankai University Tianjin City, 300071, P. R. China Emails: songhe@mail.nankai.edu.cn
More information= F (b) F (a) F (x i ) F (x i+1 ). a x 0 x 1 x n b i
Real Analysis Problem 1. If F : R R is a monotone function, show that F T V ([a,b]) = F (b) F (a) for any interval [a, b], and that F has bounded variation on R if and only if it is bounded. Here F T V
More informationON AN INVARIANCE PRINCIPLE FOR PHASE SEPARATION LINES
ON AN INVARIANCE PRINCIPLE FOR PHASE SEPARATION LINES LEV GREENBERG AND DMITRY IOFFE Abstract. We prove invariance principles for phase separation lines in the two dimensional nearest neighbour Ising model
More informationRSW and Box-Crossing Property for Planar Percolation
March 9, 2016 11:55 ws-procs961x669 WSPC Proceedings - 9.61in x 6.69in Duminil-Copin page 1 1 RSW and Box-Crossing Property for Planar Percolation H. Duminil-Copin and V. Tassion Mathematics Department,
More informationThe range of tree-indexed random walk
The range of tree-indexed random walk Jean-François Le Gall, Shen Lin Institut universitaire de France et Université Paris-Sud Orsay Erdös Centennial Conference July 2013 Jean-François Le Gall (Université
More informationRandom Walks Conditioned to Stay Positive
1 Random Walks Conditioned to Stay Positive Bob Keener Let S n be a random walk formed by summing i.i.d. integer valued random variables X i, i 1: S n = X 1 + + X n. If the drift EX i is negative, then
More informationHigh-dimensional graphical networks of self-avoiding walks
High-dimensional graphical networks of self-avoiding walks Mark Holmes, Antal A. Járai, Akira Sakai, Gordon Slade Department of Mathematics University of British Columbia Vancouver, BC V6T Z2, Canada November
More informationPacking-Dimension Profiles and Fractional Brownian Motion
Under consideration for publication in Math. Proc. Camb. Phil. Soc. 1 Packing-Dimension Profiles and Fractional Brownian Motion By DAVAR KHOSHNEVISAN Department of Mathematics, 155 S. 1400 E., JWB 233,
More informationBrownian Motion. 1 Definition Brownian Motion Wiener measure... 3
Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................
More informationLecture 1 Measure concentration
CSE 29: Learning Theory Fall 2006 Lecture Measure concentration Lecturer: Sanjoy Dasgupta Scribe: Nakul Verma, Aaron Arvey, and Paul Ruvolo. Concentration of measure: examples We start with some examples
More informationPACKING-DIMENSION PROFILES AND FRACTIONAL BROWNIAN MOTION
PACKING-DIMENSION PROFILES AND FRACTIONAL BROWNIAN MOTION DAVAR KHOSHNEVISAN AND YIMIN XIAO Abstract. In order to compute the packing dimension of orthogonal projections Falconer and Howroyd 997) introduced
More informationPoint Sets and Dynamical Systems in the Autocorrelation Topology
Point Sets and Dynamical Systems in the Autocorrelation Topology Robert V. Moody and Nicolae Strungaru Department of Mathematical and Statistical Sciences University of Alberta, Edmonton Canada, T6G 2G1
More informationPlan 1. This talk: (a) Percolation and criticality (b) Conformal invariance Brownian motion (BM) and percolation (c) Loop-erased random walk (LERW) (d
Percolation, Brownian Motion and SLE Oded Schramm The Weizmann Institute of Science and Microsoft Research Plan 1. This talk: (a) Percolation and criticality (b) Conformal invariance Brownian motion (BM)
More informationGeneral Glivenko-Cantelli theorems
The ISI s Journal for the Rapid Dissemination of Statistics Research (wileyonlinelibrary.com) DOI: 10.100X/sta.0000......................................................................................................
More information(x k ) sequence in F, lim x k = x x F. If F : R n R is a function, level sets and sublevel sets of F are any sets of the form (respectively);
STABILITY OF EQUILIBRIA AND LIAPUNOV FUNCTIONS. By topological properties in general we mean qualitative geometric properties (of subsets of R n or of functions in R n ), that is, those that don t depend
More informationAn Introduction to the Schramm-Loewner Evolution Tom Alberts C o u(r)a n (t) Institute. March 14, 2008
An Introduction to the Schramm-Loewner Evolution Tom Alberts C o u(r)a n (t) Institute March 14, 2008 Outline Lattice models whose time evolution is not Markovian. Conformal invariance of their scaling
More informationAsymptotic efficiency of simple decisions for the compound decision problem
Asymptotic efficiency of simple decisions for the compound decision problem Eitan Greenshtein and Ya acov Ritov Department of Statistical Sciences Duke University Durham, NC 27708-0251, USA e-mail: eitan.greenshtein@gmail.com
More information< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1
List of Problems jacques@ucsd.edu Those question with a star next to them are considered slightly more challenging. Problems 9, 11, and 19 from the book The probabilistic method, by Alon and Spencer. Question
More informationGEOMETRIC AND FRACTAL PROPERTIES OF SCHRAMM-LOEWNER EVOLUTION (SLE)
GEOMETRIC AND FRACTAL PROPERTIES OF SCHRAMM-LOEWNER EVOLUTION (SLE) Triennial Ahlfors-Bers Colloquium Gregory F. Lawler Department of Mathematics Department of Statistics University of Chicago 5734 S.
More informationAn exponential family of distributions is a parametric statistical model having densities with respect to some positive measure λ of the form.
Stat 8112 Lecture Notes Asymptotics of Exponential Families Charles J. Geyer January 23, 2013 1 Exponential Families An exponential family of distributions is a parametric statistical model having densities
More informationIntroduction to self-similar growth-fragmentations
Introduction to self-similar growth-fragmentations Quan Shi CIMAT, 11-15 December, 2017 Quan Shi Growth-Fragmentations CIMAT, 11-15 December, 2017 1 / 34 Literature Jean Bertoin, Compensated fragmentation
More informationDiffusion of wave packets in a Markov random potential
Diffusion of wave packets in a Markov random potential Jeffrey Schenker Michigan State University Joint work with Yang Kang (JSP 134 (2009)) WIP with Eman Hamza & Yang Kang ETH Zürich 9 June 2009 Jeffrey
More informationBregman superquantiles. Estimation methods and applications
Bregman superquantiles. Estimation methods and applications Institut de mathématiques de Toulouse 2 juin 2014 Joint work with F. Gamboa, A. Garivier (IMT) and B. Iooss (EDF R&D). 1 Coherent measure of
More informationMET Workshop: Exercises
MET Workshop: Exercises Alex Blumenthal and Anthony Quas May 7, 206 Notation. R d is endowed with the standard inner product (, ) and Euclidean norm. M d d (R) denotes the space of n n real matrices. When
More informationContinued fractions for complex numbers and values of binary quadratic forms
arxiv:110.3754v1 [math.nt] 18 Feb 011 Continued fractions for complex numbers and values of binary quadratic forms S.G. Dani and Arnaldo Nogueira February 1, 011 Abstract We describe various properties
More informationOn the number of ways of writing t as a product of factorials
On the number of ways of writing t as a product of factorials Daniel M. Kane December 3, 005 Abstract Let N 0 denote the set of non-negative integers. In this paper we prove that lim sup n, m N 0 : n!m!
More informationTopics in Stochastic Geometry. Lecture 4 The Boolean model
Institut für Stochastik Karlsruher Institut für Technologie Topics in Stochastic Geometry Lecture 4 The Boolean model Lectures presented at the Department of Mathematical Sciences University of Bath May
More informationGARCH processes continuous counterparts (Part 2)
GARCH processes continuous counterparts (Part 2) Alexander Lindner Centre of Mathematical Sciences Technical University of Munich D 85747 Garching Germany lindner@ma.tum.de http://www-m1.ma.tum.de/m4/pers/lindner/
More informationLecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.
1 Markov chain: definition Lecture 5 Definition 1.1 Markov chain] A sequence of random variables (X n ) n 0 taking values in a measurable state space (S, S) is called a (discrete time) Markov chain, if
More informationA regeneration proof of the central limit theorem for uniformly ergodic Markov chains
A regeneration proof of the central limit theorem for uniformly ergodic Markov chains By AJAY JASRA Department of Mathematics, Imperial College London, SW7 2AZ, London, UK and CHAO YANG Department of Mathematics,
More informationNatural boundary and Zero distribution of random polynomials in smooth domains arxiv: v1 [math.pr] 2 Oct 2017
Natural boundary and Zero distribution of random polynomials in smooth domains arxiv:1710.00937v1 [math.pr] 2 Oct 2017 Igor Pritsker and Koushik Ramachandran Abstract We consider the zero distribution
More informationRegression and Statistical Inference
Regression and Statistical Inference Walid Mnif wmnif@uwo.ca Department of Applied Mathematics The University of Western Ontario, London, Canada 1 Elements of Probability 2 Elements of Probability CDF&PDF
More informationChapter 7. Markov chain background. 7.1 Finite state space
Chapter 7 Markov chain background A stochastic process is a family of random variables {X t } indexed by a varaible t which we will think of as time. Time can be discrete or continuous. We will only consider
More information2 The Curie Weiss Model
2 The Curie Weiss Model In statistical mechanics, a mean-field approximation is often used to approximate a model by a simpler one, whose global behavior can be studied with the help of explicit computations.
More informationHOPF S DECOMPOSITION AND RECURRENT SEMIGROUPS. Josef Teichmann
HOPF S DECOMPOSITION AND RECURRENT SEMIGROUPS Josef Teichmann Abstract. Some results of ergodic theory are generalized in the setting of Banach lattices, namely Hopf s maximal ergodic inequality and the
More informationMeasure-theoretic probability
Measure-theoretic probability Koltay L. VEGTMAM144B November 28, 2012 (VEGTMAM144B) Measure-theoretic probability November 28, 2012 1 / 27 The probability space De nition The (Ω, A, P) measure space is
More informationTheorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension. n=1
Chapter 2 Probability measures 1. Existence Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension to the generated σ-field Proof of Theorem 2.1. Let F 0 be
More informationSuperconcentration inequalities for centered Gaussian stationnary processes
Superconcentration inequalities for centered Gaussian stationnary processes Kevin Tanguy Toulouse University June 21, 2016 1 / 22 Outline What is superconcentration? Convergence of extremes (Gaussian case).
More informationEUROPHYSICS LETTERS OFFPRINT
EUROPHYSICS LETTERS OFFPRINT Vol. 62 Number 2 pp. 182 188 Rigorous nonperturbative Ornstein-Zernike theory for Ising ferromagnets M. Campanino, D. Ioffe and Y. Velenik Published under the scientific responsability
More informationGaussian Processes. 1. Basic Notions
Gaussian Processes 1. Basic Notions Let T be a set, and X : {X } T a stochastic process, defined on a suitable probability space (Ω P), that is indexed by T. Definition 1.1. We say that X is a Gaussian
More informationEuler Characteristic of Two-Dimensional Manifolds
Euler Characteristic of Two-Dimensional Manifolds M. Hafiz Khusyairi August 2008 In this work we will discuss an important notion from topology, namely Euler Characteristic and we will discuss several
More informationPROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS
PROBABILITY: LIMIT THEOREMS II, SPRING 218. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please
More informationAsymptotics for posterior hazards
Asymptotics for posterior hazards Pierpaolo De Blasi University of Turin 10th August 2007, BNR Workshop, Isaac Newton Intitute, Cambridge, UK Joint work with Giovanni Peccati (Université Paris VI) and
More informationLecture 2. We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales.
Lecture 2 1 Martingales We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales. 1.1 Doob s inequality We have the following maximal
More informationA classification of gapped Hamiltonians in d = 1
A classification of gapped Hamiltonians in d = 1 Sven Bachmann Mathematisches Institut Ludwig-Maximilians-Universität München Joint work with Yoshiko Ogata NSF-CBMS school on quantum spin systems Sven
More informationLimit shapes outside the percolation cone
jointly with Tuca Auffinger and Mike Hochman Princeton University July 14, 2011 Definitions We consider first-passage percolation on the square lattice Z 2. x γ - We place i.i.d. non-negative passage times
More information3 Statistical physics models
3 Statistical physics models 3.1 Percolation In Werner s St. Flour lectures he discusses percolation in the first section and then in more detail in section 10. In the article by Kager and Nienhuis percolation
More informationn! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4.1 (*. Let independent variables X 1,..., X n have U(0, 1 distribution. Show that for every x (0, 1, we have P ( X (1 < x 1 and P ( X (n > x 1 as n. Ex. 4.2 (**. By using induction
More informationFunctional central limit theorem for super α-stable processes
874 Science in China Ser. A Mathematics 24 Vol. 47 No. 6 874 881 Functional central it theorem for super α-stable processes HONG Wenming Department of Mathematics, Beijing Normal University, Beijing 1875,
More informationNON-UNIVERSALITY OF THE NAZAROV-SODIN CONSTANT
NON-UNIVERSALITY OF THE NAZAROV-SODIN CONSTANT Abstract. We prove that the Nazarov-Sodin constant, which up to a natural scaling gives the leading order growth for the expected number of nodal components
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationHigh temperature regime in spatial random permutations. Lorenzo Taggi, TU Darmstadt (Joint work with Volker Betz, TU Darmstadt)
High temperature regime in spatial random permutations Lorenzo Taggi, TU Darmstadt (Joint work with Volker Betz, TU Darmstadt) /8 Definition: Nearest neighbor SRP with forced long cycle Set Λ L = [0, L]
More informationarxiv:math/ v1 [math.oa] 10 Feb 2000
On the K-property of quantized Arnold cat maps arxiv:math/0002080v [math.oa] 0 Feb 2000 I S.V. Neshveyev Abstract We prove that some quantized Arnold cat maps are entropic K-systems. his result was formulated
More informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More informationIntroduction to Dynamical Systems
Introduction to Dynamical Systems France-Kosovo Undergraduate Research School of Mathematics March 2017 This introduction to dynamical systems was a course given at the march 2017 edition of the France
More informationarxiv: v2 [math.pr] 26 Aug 2017
CONSTRAINED PERCOLATION, ISING MODEL AND XOR ISING MODEL ON PLANAR LATTICES ZHONGYANG LI arxiv:1707.04183v2 [math.pr] 26 Aug 2017 Abstract. We study constrained percolation models on planar lattices including
More informationAn Introduction to Stochastic Modeling
F An Introduction to Stochastic Modeling Fourth Edition Mark A. Pinsky Department of Mathematics Northwestern University Evanston, Illinois Samuel Karlin Department of Mathematics Stanford University Stanford,
More informationLecture 17 Brownian motion as a Markov process
Lecture 17: Brownian motion as a Markov process 1 of 14 Course: Theory of Probability II Term: Spring 2015 Instructor: Gordan Zitkovic Lecture 17 Brownian motion as a Markov process Brownian motion is
More information(A n + B n + 1) A n + B n
344 Problem Hints and Solutions Solution for Problem 2.10. To calculate E(M n+1 F n ), first note that M n+1 is equal to (A n +1)/(A n +B n +1) with probability M n = A n /(A n +B n ) and M n+1 equals
More informationFall, 2003 CIS 610. Advanced geometric methods. Homework 3. November 11, 2003; Due November 25, beginning of class
Fall, 2003 CIS 610 Advanced geometric methods Homework 3 November 11, 2003; Due November 25, beginning of class You may work in groups of 2 or 3 Please, write up your solutions as clearly and concisely
More informationESTIMATION THEORY. Chapter Estimation of Random Variables
Chapter ESTIMATION THEORY. Estimation of Random Variables Suppose X,Y,Y 2,...,Y n are random variables defined on the same probability space (Ω, S,P). We consider Y,...,Y n to be the observed random variables
More information4 Sums of Independent Random Variables
4 Sums of Independent Random Variables Standing Assumptions: Assume throughout this section that (,F,P) is a fixed probability space and that X 1, X 2, X 3,... are independent real-valued random variables
More informationEntropy and Ergodic Theory Lecture 15: A first look at concentration
Entropy and Ergodic Theory Lecture 15: A first look at concentration 1 Introduction to concentration Let X 1, X 2,... be i.i.d. R-valued RVs with common distribution µ, and suppose for simplicity that
More informationChapter 7. Basic Probability Theory
Chapter 7. Basic Probability Theory I-Liang Chern October 20, 2016 1 / 49 What s kind of matrices satisfying RIP Random matrices with iid Gaussian entries iid Bernoulli entries (+/ 1) iid subgaussian entries
More informationBrownian intersection local times
Weierstrass Institute for Applied Analysis and Stochastics Brownian intersection local times Wolfgang König (TU Berlin and WIAS Berlin) [K.&M., Ann. Probab. 2002], [K.&M., Trans. Amer. Math. Soc. 2006]
More informationRenormalization: An Attack on Critical Exponents
Renormalization: An Attack on Critical Exponents Zebediah Engberg March 15, 2010 1 Introduction Suppose L R d is a lattice with critical probability p c. Percolation on L is significantly differs depending
More informationlim n C1/n n := ρ. [f(y) f(x)], y x =1 [f(x) f(y)] [g(x) g(y)]. (x,y) E A E(f, f),
1 Part I Exercise 1.1. Let C n denote the number of self-avoiding random walks starting at the origin in Z of length n. 1. Show that (Hint: Use C n+m C n C m.) lim n C1/n n = inf n C1/n n := ρ.. Show that
More informationCritical behavior of the massless free field at the depinning transition
Critical behavior of the massless free field at the depinning transition Erwin Bolthausen Yvan Velenik August 27, 200 Abstract We consider the d-dimensional massless free field localized by a δ-pinning
More informationKarhunen-Loève decomposition of Gaussian measures on Banach spaces
Karhunen-Loève decomposition of Gaussian measures on Banach spaces Jean-Charles Croix jean-charles.croix@emse.fr Génie Mathématique et Industriel (GMI) First workshop on Gaussian processes at Saint-Etienne
More informationThe parabolic Anderson model on Z d with time-dependent potential: Frank s works
Weierstrass Institute for Applied Analysis and Stochastics The parabolic Anderson model on Z d with time-dependent potential: Frank s works Based on Frank s works 2006 2016 jointly with Dirk Erhard (Warwick),
More information7 Convergence in R d and in Metric Spaces
STA 711: Probability & Measure Theory Robert L. Wolpert 7 Convergence in R d and in Metric Spaces A sequence of elements a n of R d converges to a limit a if and only if, for each ǫ > 0, the sequence a
More informationPercolation and Random walks on graphs
Percolation and Random walks on graphs Perla Sousi May 14, 2018 Contents 1 Percolation 2 1.1 Definition of the model................................... 2 1.2 Coupling of percolation processes.............................
More informationThere is no isolated interface edge in very supercritical percolation
There is no isolated interface edge in very supercritical percolation arxiv:1811.12368v1 [math.pr] 29 Nov 2018 Raphaël Cerf November 30, 2018 Abstract Zhou Wei We consider the Bernoulli bond percolation
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationNodal lines of random waves Many questions and few answers. M. Sodin (Tel Aviv) Ascona, May 2010
Nodal lines of random waves Many questions and few answers M. Sodin (Tel Aviv) Ascona, May 2010 1 Random 2D wave: random superposition of solutions to Examples: f + κ 2 f = 0 Random spherical harmonic
More informationA Note on the Central Limit Theorem for a Class of Linear Systems 1
A Note on the Central Limit Theorem for a Class of Linear Systems 1 Contents Yukio Nagahata Department of Mathematics, Graduate School of Engineering Science Osaka University, Toyonaka 560-8531, Japan.
More informationSpectral representations and ergodic theorems for stationary stochastic processes
AMS 263 Stochastic Processes (Fall 2005) Instructor: Athanasios Kottas Spectral representations and ergodic theorems for stationary stochastic processes Stationary stochastic processes Theory and methods
More informationGaussian Fields and Percolation
Gaussian Fields and Percolation Dmitry Beliaev Mathematical Institute University of Oxford RANDOM WAVES IN OXFORD 18 June 2018 Berry s conjecture In 1977 M. Berry conjectured that high energy eigenfunctions
More information9. Banach algebras and C -algebras
matkt@imf.au.dk Institut for Matematiske Fag Det Naturvidenskabelige Fakultet Aarhus Universitet September 2005 We read in W. Rudin: Functional Analysis Based on parts of Chapter 10 and parts of Chapter
More information