ON A NONHIERARCHICAL VERSION OF THE GENERALIZED RANDOM ENERGY MODEL 1. BY ERWIN BOLTHAUSEN AND NICOLA KISTLER Universität Zürich

Size: px
Start display at page:

Download "ON A NONHIERARCHICAL VERSION OF THE GENERALIZED RANDOM ENERGY MODEL 1. BY ERWIN BOLTHAUSEN AND NICOLA KISTLER Universität Zürich"

Transcription

1 The Annals of Applied Probability 2006, Vol. 16, No. 1, 1 14 DOI: / Institute of Mathematical Statistics, 2006 ON A NONHIERARCHICAL VERSION OF THE GENERALIZED RANDOM ENERGY MODEL 1 BY ERWIN BOLTHAUSEN AND NICOLA KISTLER Universität Zürich We introduce a natural nonhierarchical version of Derrida s generalized random energy model. We prove that, in the thermodynamical limit, the free energy is the same as that of a suitably constructed GREM. 1. Introduction and inition of the model. The generalized random energy model (GREM for short), introduced by Derrida [1], plays an important role in spin glass theory. Originally invented as a simple model which exhibits replica symmetry breaking at various levels, it has become clear that more interesting models, like the celebrated one of Sherrington Kirkpatrick, exhibit GREMlike behavior in the large N limit. Despite the spectacular recent progress in understanding the SK-model (see [4, 5, 7]), many issues have not been clarified at all, the most prominent one being the so-called ultrametricity. [A metric d is called an ultrametric if the strengthened triangle condition holds: d(x,z) max(d(x, y), d(y, z)). Equivalently, two balls are either disjoint or one is contained in the other.] The GREM is of limited use to investigate this because it is hierarchically organized from the start. This favorable situation allows for a complete solution, fully confirming the so-called Parisi theory (we refer the reader to the detailed study [2] where it is also pointed out that, interestingly, the emerging ultrametricity of the Gibbs measure does not necessarily coincide with the starting hierarchical organization). Yet, from the considerations on the GREM, one gets little clue on why many systems should be ultrametric in the limit. [In Talagrand s recent proof of the Parisi formula, ultrametricity plays no apparent rôle, and it seems to be quite delicate to prove ultrametricity by Talagrand s method. This is quite curious as, on the other hand, ultrametricity plays a crucial rôle in the physicists nonrigorous derivation of the free energy, be that using the replica trick or the cavity method.] We present here a simple and, as we think, natural generalization of the GREM which has no built in ultrametric structure. We, however, show that, in the limit, the model is ultrametrically organized. In this paper we address only the free energy. The more delicate investigation of the ultrametricity of the Gibbs distribution will be investigated in a forthcoming paper. Received October 2004; revised uly Supported in part by a grant from the Schweizerische Nationalfonds, contract no /1. AMS 2000 subject classifications. 60G60, 82B44. Key words and phrases. Spin glasses, disordered systems, ultrametricity. 1

2 2 E. BOLTHAUSEN AND N. KISTLER Throughout this paper, we fix a number n N, and consider the set I = {1,...,n}, as well as a collection of positive real numbers {a } I such that a = 1. I For convenience, we put a = 0. The relevant subset of I will be only the ones with positive a-value. For A I, we set P A ={ A : a > 0}, P = P I. For n N,weset N ={1,...,2 N }. We also fix positive real numbers γ i,i I, satisfying n γ i = 1, i=1 and write N i = γi N where, for notational convenience, we assume that 2 γin is an integer. For N N, we will label the spin configurations σ as σ = (σ 1,...,σ n ), σ i N i, that is, we identify N with N 1 n N. For I, ={j 1,...,j k },j 1 < j 2 < <j k, we write N, = k s=1 j s N, and for σ N, we write σ for the projected configuration (σ j ) j N,. Our spin glass Hamiltonian is ined as (1) X σ = P X σ, where Xσ, P,σ N, are independent centered Gaussian random variables with variance a N. The X σ are then Gaussian random variables with variance N (Gaussian always means centered Gaussian through this note), but they are correlated. E will denote expectation with respect to these random variables. A special case is when P ={I}, that is, when only a I 0, in which case it has to be one. Then the X σ are independent, that is, one considers simply a set of 2 N independent Gaussian random variables with variance N. This is the standard random energy model. The generalized random energy model is a special case, too: It corresponds to the situation where the sets in P are nested, meaning that P consists of an increasing sequence of subsets. Without loss of generality, we may assume that in this case (2) P ={ m :1 m k}, m ={1,...,n m }, where 1 n 1 <n 2 < <n k n. In the GREM case, the natural metric on N coming from the covariance structure d(σ,σ ) = E ( (X σ X σ ) 2)

3 NONHIERARCHICAL GREM 3 is an ultrametric. In the more general case (1) considered here, this metric is not an ultrametric. To see this, take n = 3, P ={{1, 2}, {1, 3}, {2, 3}}, that is, where (3) X σ = X σ {1,2} 1,σ 2 + X σ {1,3} 1,σ 3 + X σ {2,3} 2,σ 3, with a = 1/3 for P. Then for a,b,b,c,c N/3,b b,c c, one has d ( (a,b,c),(a,b,c ) ) = d ( (a,b,c ), (a, b,c ) ) = 2N/3, whereas d ( (a, b, c), (a, b,c ) ) = N, contradicting ultrametricity. Any of our models can be coarse-grained in many ways into a GREM. For that consider strictly increasing sequences of subsets of I : = A 0 A 1 A K = I. We do not assume that the A i are in P. We call such a sequence a chain T = (A 0,A 1,...,A K ). We attach weights â Aj to these sets by putting (4) â Aj = a B. B P Aj \P Aj 1 Evidently K j=1 â Aj = 1, and if we assign random variables X σ (T), according to (1), we arrive after an irrelevant renumbering of I at a GREM of the form (2). In particular, the corresponding metric d is an ultrametric. We write tr( ) for averaging over N (i.e., the coin-tossing expectation if we identify N with {H,T} N ). For a function x : N R, set Z N (β, x) = tr exp[βx], F N (β, x) = 1 N log( Z N (β, x) ), and ine the usual finite N partition function, and free energy by Z N (β) = Z N (β, X), F N (β) = F N (β, X), f N (β) = E ( F N (β, X) ), where X is interpreted as random function N R. For any chain T, we attach to our model a GREM (X σ (T)) σ N, as explained above, and then f N (T,β) = E ( F N ( β,x(t) )), f(t,β) = lim f N(T,β). N For a GREM, the limiting free energy is known to exist, and can be expressed explicitly, but in a somewhat complicated way (see [1, 3]). Our main result is that our generalization of the GREM does not lead to anything new in N limit, shedding hopefully some modest light on the universality of ultrametricity.

4 4 E. BOLTHAUSEN AND N. KISTLER THEOREM 1. (5) f(β) = lim f N(β) N exists and is also the almost sure limit of F N (β). f(β)isthefreeenergyofagrem. More precisely, there exists a chain T such that (6) f(β)= f(t,β), β 0. f(t,β)is minimal in the sense that (7) f(β)= min f(s,β), S the minimum being taken over all chains S. The fact that free energy is self-averaging, meaning that f(β)(if the limit exists) is also the almost sure limit of the F N, is a simple consequence of the Gaussian concentration inequality. We write F N as a function of the standardized variables Xσ / a N. As log e a i log e a i max a i a i, a i,a i R, i i i we get that F N (β), regarded as a function of the collection (Xσ / a N),isLipschitz continuous with Lipschitz constant β/ N. By the usual concentration of measure estimates for Gaussian distributions (see, e.g., Proposition 2.18 of [6]), we have P[ F N (β) EF N (β) >ɛ] 2exp [ ɛ2 ] (8) 2β 2 N. Using the Borel Cantelli lemma, one sees that if lim N f N (β) exists, then the F N (β) converge almost surely to this limit, too, and if lim N F N (β) exists almost surely, then the limit is nonrandom and equals lim N f N (β). As for the strategy of the proof, the existence of the limit is established through a quite standard application of the second moment method, akin to that originally exploited by Derrida in his seminal paper [1]; this allows to express the limiting free energy in terms of a variational problem, which we then solve inductively. For the reader s convenience, we briefly describe the mechanism which lies behind Theorem 1 for the Hamiltonian (3), but we allow for general (positive) variances a 12,a 13,a 23, and general γ i. It is best to count the number of configurations σ which reach a certain energy level λn. It is evident that only an exponentially small portion of the total number 2 N of configurations achieve this, roughly formulated (we will be more precise later), #{σ : X σ λn} 2 N e ρ(λ)n, ρ(λ)>0.

5 NONHIERARCHICAL GREM 5 The free energy is obtained by the Legendre transform of ρ. In order to determine ρ(λ), we count individually for each of the three parts in (3) how many configurations reach respective levels (9) ˆρ(λ 1,λ 2,λ 3 ) 1 N log #{ σ : X {1,2} σ 1,σ 2 λ 1 N, X {1,3} σ 1,σ 3 λ 2 N, X {2,3} σ 2,σ 3 λ 3 N } + log 2, with λ 1 + λ 2 + λ 3 = λ. Evidently, (10) ρ(λ) = inf ˆρ(λ 1,λ 2,λ 3 ). λ 1 +λ 2 +λ 3 =λ It turns out that one can get ˆρ by computing expectations inside the logarithm, provided only some naturally ined restrictions on the λ i are satisfied. For small λ, it is easily seen that one has an equipartition property, and that the optimal λ 1,λ 2,λ 3 are proportional to the respective variances, that is, λ 1 = a 12 λ, λ 2 = a 13 λ, λ 3 = a 23 λ, and from that one obtains (11) ρ(λ) = λ 2 /2, which is the same as if the X σ would be uncorrelated. Increasing λ, we, however, encounter restrictions from the structure of the Hamiltonian. First of all, λ 1 has to be such that there are any σ 1,σ 2 with X σ {1,2} 1,σ 2 λ 1 N = a 12 λn.thereare2 (γ 1+γ 2 )N pairs (σ 1,σ 2 ), and as the X σ {1,2} 1,σ 2 are independent, the restriction is [ 2 (γ 1+γ 2 )N exp λ2 ] a 12 N 1. 2 (We are not considering any log-corrections.) This leads to the restriction (12) 2(γ1 + γ 2 ) log 2 λ a 12 for the validity of (11), and there are two similar restrictions coming from X {1,3} and X {2,3}. Even if these three restrictions are satisfied, it can be that there are simply totally not enough triples (σ 1,σ 2,σ 3 ) left. A necessary condition for this is certainly that the expected number of #{σ : X σ λn} is not exponentially decaying, which is simply the condition that λ 2log2. The somewhat astonishing fact is that these are the only conditions one has to take into considerations for the validity of (11). Now, there are two cases: (13) CASE 1. λ 2 log 2 implies the other ones, that is, γ i + γ j min 1. 1 i<j 3 a ij

6 6 E. BOLTHAUSEN AND N. KISTLER In that case, we are simply left with the restriction λ 2log2, and the free energy is f(β)= sup λ 2log2 (βλ λ 2 /2), which is the free energy of an REM. In that case the internal structure of the model is irrelevant, at least for the free energy. CASE 2. smallest one. (13) is violated. For initeness, assume that (γ 1 + γ 2 )/a 12 is the In that case, (11) is only correct in the region (12). For λ larger, there is no (σ 1,σ 2 ) with X σ {1,2} 1,σ 2 a 12 λn (with probability close to 1), the maximum of the X σ {1,2} 1,σ 2 being at m 12 N (± log-corrections), where m 12 = 2(γ 1 + γ 2 )a 12 log 2. Therefore, one has to restrict in (10) toλ s with λ 1 = m 12. The only configurations σ for which X σ λn have to satisfy (14) X σ {1,2} 1,σ 2 m 12 N, but there are now only subexponentially many (σ 1,σ 2 ) left which achieve this feat, and the difference to λn hastobemadebythefield Y σ1,σ 2 (σ 3 ) = X σ {1,3} 1,σ 3 + X σ {2,3} 2,σ 3, 1 σ 3 2 γ3n, restricting (σ 1,σ 2 ) to the few which satisfy (14). There is an upper limit λ max for λ s such that there are any σ 3 with Y(σ 3 ) (λ m 12 )N. λ max N m 12 N is simply the maximum of 2 γ3n independent Gaussians with variance (a 13 + a 23 )N, that is, λ max m 12 = 2γ 3 (a 13 + a 23 ) log 2. The situation is similar to the one in the GREM with the only difference that, for (σ 1,σ 2 ) (σ 1,σ 2 ), the fields Y σ 1,σ 2 and Y σ 1,σ 2 are not independent, except when σ 1 σ 1 and σ 2 σ 2. It is, however, fairly evident that, among the (σ 1,σ 2 ) for which X σ {1,2} 1,σ 2 m 12 N there will be no pairs with such a partial overlap, with probability close to 1, and therefore, it is quite natural one can handle the field Y σ1,σ 2 as if it would come from a second level of a two-level GREM. In fact, it turns out that, in the Case 2, the tree of Theorem 1 is {{1, 2}, {1, 2, 3}}, and we replace our model with the coarse grained one with Hamiltonian X α 1 + X α 1,α 2, where #α 1 = 2 (γ 1+γ 2 )N, var(x ) = a 12 N, #α 2 = 2 γ3n, var(x ) = (a 13 + a 23 )N. This way of reasoning works for the general case. There are two issues which might be somewhat surprising. The first is that expressions (9) can always be evaluated by computing expectations inside the logarithm, provided one keeps some

7 NONHIERARCHICAL GREM 7 fairly trivial restrictions on the λ i. Second, it is not entirely evident why these restrictions finally always lead to tree structures. It is also interesting that the system always chooses from the many GREMs which can be obtained by coarse-grainings the one with minimal free energy. A similar behavior has already been obtained for the GREM itself in [2]. 2. Second moment estimates. We fix some notation: If (a N ) N N and (b N ) N N are two sequences of positive real numbers, we write a N b N if, for all ε>0, there exists N 0 (ε) N such that e εn b N a N e εn b N for N N 0. We also write a N b N if, for some δ>0, one has a N b N e δn, again for large enough N. In that case, we also write a N = (b N ). The same notation are used in the case of sequences of random variables, just meaning that the relations hold almost surely (and therefore N 0 may depend on ω). For A I (not necessarily in P ), we set γ(a) = γ i, i A α(a) = P A a A. We rewrite F N in terms of energy levels. For a collection λ = (λ ) P,λ R and A I, we set Clearly, N N,A (λ) = # { σ N,A : X σ λ N, P A }, N N (λ) = N N,I (λ). (15) {N N,A (λ) = 0} {N N (λ) = 0}. We express F N in terms of the N N (λ): F N (β) = 1 N log 2 N (βn) P (16) dλn N(λ) e βλ N R P P = 1 N log dλn N(λ) ( e βλ log N N log 2 + O R P N P We first want to take out the λ for which N N (λ) = 0forlargeN. As these are integer valued random variables, it is clear that EN N (λ) 1 implies N N (λ) = 0for large enough N, almost surely. It, however, turns out that this condition is not sufficient for our purpose, but remark that, if for some A I, one has EN N,A (λ) 1, then, by (15), one has N N (λ) = 0 for large enough N as well. ).

8 8 E. BOLTHAUSEN AND N. KISTLER LEMMA 2. (a) For any λ R P and A I, we have [ EN N,A (λ) 2 γ(a)n exp + (λ 2a P A where λ + = max(λ, 0). (b) There exists C>0such that EN N (λ) C2 N exp [ P for all λ R P, and all N. (c) Let λ R P. If for some A I one has + (λ )2 >γ(a)log 2, 2a P A )2 N (λ + ] )2 N 2a then P(N N (λ) 0) 1 and, in particular, N N (λ) = 0 for large enough N,almost surely. PROOF. (a) and (b) follow by standard Gaussian tail estimates, and in case (c), by (15), we have which proves (c). P ( N N (λ) 0 ) P ( N N,A (λ) 0 ) EN N,A (λ), ], Let { = λ R P : + (λ 2a P A )2 + ={λ : λ 0, P }. γ(a)log 2, A I }, (17) LEMMA 3. If λ int, then N N (λ) EN N (λ) exp [ N ( log 2 (λ + )2 /2a )]. P PROOF. The second relation is Lemma 2(a). For the proof of the first, it suffices to show that λ int implies (18) var N N (λ) (EN N (λ)) 2. In fact, from (18), Chebyshev s inequality and the Borel Cantelli lemma immediately imply (17).

9 NONHIERARCHICAL GREM 9 We abbreviate P(Xσ Nλ ) by p (N) (λ is kept fixed through this proof ). With this notation, EN N (λ) = 2 N P p (N): EN N (λ) 2 = P ( Xσ Nλ,X ) σ Nλ σ,σ N P = A I (σ,σ ) A P = A (N) A I P ( Xσ Nλ,X ) σ Nλ p (N) p (N) 2, P A P \P A where A (N) consists of those pairs (σ, σ ) which agree on A and disagree on I\A. For A =, 2 2N (N) 2 2N, and therefore, var N N (λ) = A (N) p (N) p (N) 2 + ((EN N (λ)) 2 ). A P A P \P A A (N) =2 γ(a)n i/ A 2 γ in (2 γ in 1) = 2 2N 2 γ(a)n + ( A (N) ). As by assumption, 2 γ(a)n [ p (N) exp ] + (λ )2 N, A, 2a P A P A we have, for any A, A (N) p (N) p (N) 2 2 2N p (N) 2, P A P \P A P proving var N N (λ) (EN N (λ)) 2. Let (19) (20) PROPOSITION 4. ψ(λ,β) = ( βλ λ2 ). 2a P The free energy as ined in (5) exists and is given as f(β)= sup λ + ψ(λ,β). PROOF. We show the lower bound for lim inf N F N (β) and the upper bound for lim sup N f N (β). By the self-averaging property (8), this proves the statement. We use the integral representation (16). If µ = (µ ), ν = (ν ) satisfy µ <ν for all, we write [µ, ν) ={λ : µ λ <ν, P }.

10 10 E. BOLTHAUSEN AND N. KISTLER If [µ, ν) +, we have lim inf F 1 N(β) lim inf N N N [µ,ν) log dλn N (λ) lim inf N e βλ N P 1 N log N N(ν) dλ e βλ N [µ,ν) P ( βµ ν2 ). 2a As this holds for arbitrary [µ, ν) +, lim inf N F N (β) sup λ + ψ(λ,β) follows. For the upper bound, let ε be an ε-neighborhood of. From Lemma 2(c), we have P (F N (β) 1 ) N log dλn N (λ)e β λ N 1, ε and therefore, lim sup N EF N(β) 1 N E log dλn N (λ)e β ε By ensen s inequality and Lemma 2(b), we have 1 N E log lim sup N lim sup N sup λ ε ψ(λ,β). dλn N (λ)e β ε λ N 1 N log dλen N (λ)e β ε [ 1 log 2N dλexp N ε N P λ N λ N 1. (βλ (λ+ )2 ) ] As ε>0 is arbitrary, lim sup N EF N (β) sup λ + ψ(λ,β) follows. 3. The optimization problem. We first discuss the special case of a GREM. Therefore, we assume that the sets in P are nested, that is, P ={ 1,..., m }, where 1 m. If A I, put l A = max{l : l A}. Evidently, follows from P A l A i=1 λ2 2a log 2 γ(a) λ 2 i 2a i log 2 γ ( la ). 2a

11 NONHIERARCHICAL GREM 11 Therefore, λ + is equivalent with l λ 2 i log 2 γ( l ), 1 l m, 2a i=1 i (and, of course, that all components are nonnegative). Therefore, we have proved the following: LEMMA 5. Assume that P is nested as above. Then { l λ 2 } f(β)= sup ψ(λ,β): i log 2 γ( l ), 1 l m. 2a i i=1 This lemma proves that, in our more general situation, for any chain T, the corresponding GREM free energy is an upper bound. COROLLARY 6. For any chain T, we have f(β) f(t,β), β 0. PROOF. For a given chain = A 0 A 1 A 2 A K = I, we consider + T which is obtained by dropping the conditions for the A s which are not in the chain. Then f(β)= sup ψ(λ,β) sup ψ(λ,β). λ + λ + T We claim that sup ψ(λ,β)= f(t,β), λ + T which proves the corollary. To see this equation, we write K ( ψ(λ,β)= βλ λ2 ) K = ψ j (λ j,β), say, 2a j=1 P Aj \P Aj 1 where λ j =(λ ) PAj \P Aj 1. Set { f j (β, t) = sup ψ j (λ j,β): P Aj \P Aj 1 j=1 } λ2 = t = β 2tâ j t, 2a where â j = P Aj \P Aj 1 a, that is, f j (β, s 2 /2â j ) = βs s 2 /2â j. We therefore see that { K sup ψ(λ,β) = sup λ + T j=1 ( = f(t,β), βs j s2 j 2â j ) l : j=1 sj 2 } log 2 γ(a l ), 1 l K 2â j

12 12 E. BOLTHAUSEN AND N. KISTLER the last equality by Lemma 5. In order to finish the proof of Theorem 1, it only remains to construct a chain T which satisfies f(β) f(t,β).then one has also equality by the above corollary. For B I,let α(b) = a P B and for B A,set ρ(b,a) 2log2(γ (A) γ(b)) =, α(a) α(b) ˆρ(B) = min A:A B,A B ρ(b,a). We construct a strictly increasing sequence of subsets A 0 = A 1 A 2 A K = I and parameters β 0 = 0 <β 1 <β 2 < <β K < by recursion. Assume that A 1 A 2 A k and 0 <β 1 <β 2 < <β k are constructed such that the following conditions are satisfied: C1(k) β j =ˆρ(A j 1 ), j k. C2(k) For j k and any A A j 1 which satisfies β j = ρ(a j 1,A), one has A A j,thatis,a j is maximal with β j = ρ(a j 1,A j ). For k = 0, the conditions are void. If A k = I, then the construction is finished, and we have K = k. Therefore, assume A k I. Then we set β k+1 =ˆρ(A k ), and prove first that β k+1 >β k. We claim that, for any A A k,a A k, one has 2log2 ( γ(a) γ(a k ) ) >β 2 k ( α(a) α(ak ) ). Indeed, because of 2 log 2(γ (A k ) γ(a k 1 )) = βk 2(α(A k) α(a k 1 )), 2log2 ( γ(a) γ(a k ) ) <βk 2 ( α(a) α(ak ) ) would contradict condition C1(k) and equality would contradict C2(k). It only remains to construct A k+1 which satisfies C2(k + 1). Assume there are two sets A,A A k,a,a A k satisfying (21) ρ(a k,a)= ρ(a k,a ) = β k+1. We claim that then also ρ(a k,a A ) = β k+1. Remark that α(a A ) α(a) + α(a ) α(a A ), γ(a A ) = γ(a)+ γ(a ) γ(a A ),

13 NONHIERARCHICAL GREM 13 and therefore, 2log2 ( γ(a A ) γ(a k ) ) βk+1 2 ( α(a A ) α(a k ) ) 2log2[γ(A)+ γ(a ) γ(a A ) γ(a k )] β 2 k+1 [α(a) + α(a ) α(a A ) α(a k )] = β 2 k+1 [α(a A ) α(a k )] 2log2[γ(A A ) γ(a k )] 0, the equality by (21), and the last inequality by the inition of β k+1. From the inition of β k+1, we therefore conclude that 2log2 ( γ(a A ) γ(a k ) ) = β 2 k+1( α(a A ) α(a k ) ). We therefore find a unique maximal set A k+1 A k which satisfies ρ(a k,a k+1 ) = β k+1, and so we have constructed β k+1 >β k,a k+1 A k,a k+1 A k such that C1(k + 1) and C2(k + 1) are satisfied. The construction terminates after a finite number of steps. We claim now that, with T = (,A 1,...,A K 1,I),wehave (22) f(β) f(β,t). Clearly, if β>0 is small enough, the maximum in (20) is attained in λ (1) (β) = a β for all, and therefore, f(β)= β2 2 for small β. This remains valid as long as (β 2 /2)α(A) γ(a) for all A, that is, for β β 1. For β k <β β k+1, we choose λ (k+1) (β) ined by { λ (k+1) (β) a β = m, for P Am \ P Am 1, 1 m k, (23) a β, for / P Ak. This choice (23) satisfies the side conditions in the range of β we are considering, and hence, (24) ψ ( λ (k+1) (β), β ) f(β). We show now that f(β,t) = ψ(λ (k+1) (β), β) for β k β β k+1. An elementary computation gives ψ ( λ (k+1) (β), β ) = β = β k i=1 k i=1 β i [α(a i ) α(a i 1 )] γ(a k ) log 2 + β2 ( 1 α(ak ) ) 2 β i â(a i ) γ(a k ) log 2 + β2 2 K i=k+1 â(a i ),

14 14 E. BOLTHAUSEN AND N. KISTLER where â(a i ) is ined by (4). This is exactly the free energy of the corresponding GREMasgivenin[1]. [It is, in fact, elementary to check that λ (k+1) (β) is the maximizing vector λ for the GREM corresponding to the above chain when β k β β k+1.] We have therefore proved Theorem 1. REMARK 7. We have, in fact, proved that f(β)= β k i=1 for β k β β k+1. β i [α(a i ) α(a i 1 )] γ(a k ) log 2 + β2 ( 1 α(ak ) ) 2 We wish to thank the referee for careful reading and valu- Acknowledgment. able comments. REFERENCES [1] DERRIDA, B. (1985). A generalization of the random energy model that includes correlations between the energies.. Phys. Lett [2] BOVIER, A. and KURKOVA, I. (2004). Derrida s generalized random energy models. I, II. Ann. Inst. H. Poincaré Probab. Statist MR [3] CAPOCACCIA, D., CASSANDRO, M. and PICCO, P. (1987). On the existence of thermodynamics for the generalized random energy model.. Statist. Phys MR [4] GUERRA, F. (2003). Broken replica symmetry bounds in the mean field spin glass model. Comm. Math. Phys MR [5] GUERRA, F.andTONINELLI, F. L. (2002). The thermodynamic limit in mean field spin glass models. Comm. Math. Phys MR [6] LEDOUX, M. (2002). The Concentration of Measure Phenomenon. Amer. Math. Soc., Providence, RI. MR MR [7] TALAGRAND, M. (2006). The Parisi formula. Ann. of Math INSTITUT FÜR MATHEMATIK UNIVERSITÄT ZÜRICH WINTERTHURERSTRASEE 190 CH-8057 ZÜRICH SWITZERLAND nkistler@amath.unizh.ch eb@math.unizh.ch

arxiv:math/ v1 [math.pr] 9 Mar 2006

arxiv:math/ v1 [math.pr] 9 Mar 2006 The Annals of Applied Probability 2006, Vol. 16, No. 1, 1 14 DOI: 10.1214/105051605000000665 c Institute of Mathematical Statistics, 2006 arxiv:math/0603212v1 [math.pr] 9 Mar 2006 ON A NONHIERARCHICAL

More information

The Sherrington-Kirkpatrick model

The Sherrington-Kirkpatrick model Stat 36 Stochastic Processes on Graphs The Sherrington-Kirkpatrick model Andrea Montanari Lecture - 4/-4/00 The Sherrington-Kirkpatrick (SK) model was introduced by David Sherrington and Scott Kirkpatrick

More information

1.1. MEASURES AND INTEGRALS

1.1. MEASURES AND INTEGRALS CHAPTER 1: MEASURE THEORY In this chapter we define the notion of measure µ on a space, construct integrals on this space, and establish their basic properties under limits. The measure µ(e) will be defined

More information

MOMENT CONVERGENCE RATES OF LIL FOR NEGATIVELY ASSOCIATED SEQUENCES

MOMENT CONVERGENCE RATES OF LIL FOR NEGATIVELY ASSOCIATED SEQUENCES J. Korean Math. Soc. 47 1, No., pp. 63 75 DOI 1.4134/JKMS.1.47..63 MOMENT CONVERGENCE RATES OF LIL FOR NEGATIVELY ASSOCIATED SEQUENCES Ke-Ang Fu Li-Hua Hu Abstract. Let X n ; n 1 be a strictly stationary

More information

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite

More information

A variational approach to Ising spin glasses in finite dimensions

A variational approach to Ising spin glasses in finite dimensions . Phys. A: Math. Gen. 31 1998) 4127 4140. Printed in the UK PII: S0305-447098)89176-2 A variational approach to Ising spin glasses in finite dimensions R Baviera, M Pasquini and M Serva Dipartimento di

More information

Maths 212: Homework Solutions

Maths 212: Homework Solutions Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then

More information

ON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS

ON 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 information

arxiv: v1 [math.pr] 11 Dec 2017

arxiv: v1 [math.pr] 11 Dec 2017 Local limits of spatial Gibbs random graphs Eric Ossami Endo Department of Applied Mathematics eric@ime.usp.br Institute of Mathematics and Statistics - IME USP - University of São Paulo Johann Bernoulli

More information

Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon Measures

Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon Measures 2 1 Borel Regular Measures We now state and prove an important regularity property of Borel regular outer measures: Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon

More information

MAJORIZING MEASURES WITHOUT MEASURES. By Michel Talagrand URA 754 AU CNRS

MAJORIZING MEASURES WITHOUT MEASURES. By Michel Talagrand URA 754 AU CNRS The Annals of Probability 2001, Vol. 29, No. 1, 411 417 MAJORIZING MEASURES WITHOUT MEASURES By Michel Talagrand URA 754 AU CNRS We give a reformulation of majorizing measures that does not involve measures,

More information

Zeros of lacunary random polynomials

Zeros of lacunary random polynomials Zeros of lacunary random polynomials Igor E. Pritsker Dedicated to Norm Levenberg on his 60th birthday Abstract We study the asymptotic distribution of zeros for the lacunary random polynomials. It is

More information

Homework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.

Homework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges. 2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >

More information

arxiv: v1 [math.fa] 14 Jul 2018

arxiv: v1 [math.fa] 14 Jul 2018 Construction of Regular Non-Atomic arxiv:180705437v1 [mathfa] 14 Jul 2018 Strictly-Positive Measures in Second-Countable Locally Compact Non-Atomic Hausdorff Spaces Abstract Jason Bentley Department of

More information

Construction of a general measure structure

Construction of a general measure structure Chapter 4 Construction of a general measure structure We turn to the development of general measure theory. The ingredients are a set describing the universe of points, a class of measurable subsets along

More information

GAUSSIAN MEASURE OF SECTIONS OF DILATES AND TRANSLATIONS OF CONVEX BODIES. 2π) n

GAUSSIAN MEASURE OF SECTIONS OF DILATES AND TRANSLATIONS OF CONVEX BODIES. 2π) n GAUSSIAN MEASURE OF SECTIONS OF DILATES AND TRANSLATIONS OF CONVEX BODIES. A. ZVAVITCH Abstract. In this paper we give a solution for the Gaussian version of the Busemann-Petty problem with additional

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

Packing-Dimension Profiles and Fractional Brownian Motion

Packing-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 information

STAT 7032 Probability Spring Wlodek Bryc

STAT 7032 Probability Spring Wlodek Bryc STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,

More information

arxiv:cond-mat/ v1 [cond-mat.dis-nn] 12 Jun 2003

arxiv:cond-mat/ v1 [cond-mat.dis-nn] 12 Jun 2003 arxiv:cond-mat/0306326v1 [cond-mat.dis-nn] 12 Jun 2003 CONVEX REPLICA SIMMETRY BREAKING FROM POSITIVITY AND THERMODYNAMIC LIMIT Pierluigi Contucci, Sandro Graffi Dipartimento di Matematica Università di

More information

HILBERT SPACES AND THE RADON-NIKODYM THEOREM. where the bar in the first equation denotes complex conjugation. In either case, for any x V define

HILBERT SPACES AND THE RADON-NIKODYM THEOREM. where the bar in the first equation denotes complex conjugation. In either case, for any x V define HILBERT SPACES AND THE RADON-NIKODYM THEOREM STEVEN P. LALLEY 1. DEFINITIONS Definition 1. A real inner product space is a real vector space V together with a symmetric, bilinear, positive-definite mapping,

More information

Problem set 1, Real Analysis I, Spring, 2015.

Problem set 1, Real Analysis I, Spring, 2015. Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n

More information

Estimates for probabilities of independent events and infinite series

Estimates for probabilities of independent events and infinite series Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences

More information

Entropy and Ergodic Theory Lecture 15: A first look at concentration

Entropy 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 information

PACKING-DIMENSION PROFILES AND FRACTIONAL BROWNIAN MOTION

PACKING-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 information

Lecture 5: Random Energy Model

Lecture 5: Random Energy Model STAT 206A: Gibbs Measures Invited Speaker: Andrea Montanari Lecture 5: Random Energy Model Lecture date: September 2 Scribe: Sebastien Roch This is a guest lecture by Andrea Montanari (ENS Paris and Stanford)

More information

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4 Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement

More information

A note on the convex infimum convolution inequality

A note on the convex infimum convolution inequality A note on the convex infimum convolution inequality Naomi Feldheim, Arnaud Marsiglietti, Piotr Nayar, Jing Wang Abstract We characterize the symmetric measures which satisfy the one dimensional convex

More information

Empirical Processes: General Weak Convergence Theory

Empirical Processes: General Weak Convergence Theory Empirical Processes: General Weak Convergence Theory Moulinath Banerjee May 18, 2010 1 Extended Weak Convergence The lack of measurability of the empirical process with respect to the sigma-field generated

More information

Notes 6 : First and second moment methods

Notes 6 : First and second moment methods Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative

More information

BALANCING GAUSSIAN VECTORS. 1. Introduction

BALANCING GAUSSIAN VECTORS. 1. Introduction BALANCING GAUSSIAN VECTORS KEVIN P. COSTELLO Abstract. Let x 1,... x n be independent normally distributed vectors on R d. We determine the distribution function of the minimum norm of the 2 n vectors

More information

5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.

5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing. 5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint

More information

Elementary Probability. Exam Number 38119

Elementary Probability. Exam Number 38119 Elementary Probability Exam Number 38119 2 1. Introduction Consider any experiment whose result is unknown, for example throwing a coin, the daily number of customers in a supermarket or the duration of

More information

CHAPTER 6. Differentiation

CHAPTER 6. Differentiation CHPTER 6 Differentiation The generalization from elementary calculus of differentiation in measure theory is less obvious than that of integration, and the methods of treating it are somewhat involved.

More information

Spin glasses and Stein s method

Spin glasses and Stein s method UC Berkeley Spin glasses Magnetic materials with strange behavior. ot explained by ferromagnetic models like the Ising model. Theoretically studied since the 70 s. An important example: Sherrington-Kirkpatrick

More information

17. Convergence of Random Variables

17. Convergence of Random Variables 7. Convergence of Random Variables In elementary mathematics courses (such as Calculus) one speaks of the convergence of functions: f n : R R, then lim f n = f if lim f n (x) = f(x) for all x in R. This

More information

Universality in Sherrington-Kirkpatrick s Spin Glass Model

Universality in Sherrington-Kirkpatrick s Spin Glass Model Universality in Sherrington-Kirkpatrick s Spin Glass Model Philippe CARMOA, Yueyun HU 5th ovember 08 arxiv:math/0403359v mathpr May 004 Abstract We show that the limiting free energy in Sherrington-Kirkpatrick

More information

Measure and integration

Measure and integration Chapter 5 Measure and integration In calculus you have learned how to calculate the size of different kinds of sets: the length of a curve, the area of a region or a surface, the volume or mass of a solid.

More information

Distance-Divergence Inequalities

Distance-Divergence Inequalities Distance-Divergence Inequalities Katalin Marton Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences Motivation To find a simple proof of the Blowing-up Lemma, proved by Ahlswede,

More information

Part III. 10 Topological Space Basics. Topological Spaces

Part III. 10 Topological Space Basics. Topological Spaces Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.

More information

arxiv: v1 [math.ds] 31 Jul 2018

arxiv: v1 [math.ds] 31 Jul 2018 arxiv:1807.11801v1 [math.ds] 31 Jul 2018 On the interior of projections of planar self-similar sets YUKI TAKAHASHI Abstract. We consider projections of planar self-similar sets, and show that one can create

More information

1 Sequences of events and their limits

1 Sequences of events and their limits O.H. Probability II (MATH 2647 M15 1 Sequences of events and their limits 1.1 Monotone sequences of events Sequences of events arise naturally when a probabilistic experiment is repeated many times. For

More information

3 Integration and Expectation

3 Integration and Expectation 3 Integration and Expectation 3.1 Construction of the Lebesgue Integral Let (, F, µ) be a measure space (not necessarily a probability space). Our objective will be to define the Lebesgue integral R fdµ

More information

Integration on Measure Spaces

Integration on Measure Spaces Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of

More information

Lecture Notes 3 Convergence (Chapter 5)

Lecture Notes 3 Convergence (Chapter 5) Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let

More information

Metric Spaces and Topology

Metric Spaces and Topology Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies

More information

Math 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012

Math 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012 Instructions: Answer all of the problems. Math 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012 Definitions (2 points each) 1. State the definition of a metric space. A metric space (X, d) is set

More information

A dyadic endomorphism which is Bernoulli but not standard

A dyadic endomorphism which is Bernoulli but not standard A dyadic endomorphism which is Bernoulli but not standard Christopher Hoffman Daniel Rudolph November 4, 2005 Abstract Any measure preserving endomorphism generates both a decreasing sequence of σ-algebras

More information

ON THE SET OF ALL CONTINUOUS FUNCTIONS WITH UNIFORMLY CONVERGENT FOURIER SERIES

ON THE SET OF ALL CONTINUOUS FUNCTIONS WITH UNIFORMLY CONVERGENT FOURIER SERIES PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 24, Number, November 996 ON THE SET OF ALL CONTINUOUS FUNCTIONS WITH UNIFORMLY CONVERGENT FOURIER SERIES HASEO KI Communicated by Andreas R. Blass)

More information

The deterministic Lasso

The deterministic Lasso The deterministic Lasso Sara van de Geer Seminar für Statistik, ETH Zürich Abstract We study high-dimensional generalized linear models and empirical risk minimization using the Lasso An oracle inequality

More information

Measurable Choice Functions

Measurable Choice Functions (January 19, 2013) Measurable Choice Functions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/choice functions.pdf] This note

More information

Lectures 2 3 : Wigner s semicircle law

Lectures 2 3 : Wigner s semicircle law Fall 009 MATH 833 Random Matrices B. Való Lectures 3 : Wigner s semicircle law Notes prepared by: M. Koyama As we set up last wee, let M n = [X ij ] n i,j= be a symmetric n n matrix with Random entries

More information

Chapter 6. Integration. 1. Integrals of Nonnegative Functions. a j µ(e j ) (ca j )µ(e j ) = c X. and ψ =

Chapter 6. Integration. 1. Integrals of Nonnegative Functions. a j µ(e j ) (ca j )µ(e j ) = c X. and ψ = Chapter 6. Integration 1. Integrals of Nonnegative Functions Let (, S, µ) be a measure space. We denote by L + the set of all measurable functions from to [0, ]. Let φ be a simple function in L +. Suppose

More information

An almost sure invariance principle for additive functionals of Markov chains

An almost sure invariance principle for additive functionals of Markov chains Statistics and Probability Letters 78 2008 854 860 www.elsevier.com/locate/stapro An almost sure invariance principle for additive functionals of Markov chains F. Rassoul-Agha a, T. Seppäläinen b, a Department

More information

The Heine-Borel and Arzela-Ascoli Theorems

The Heine-Borel and Arzela-Ascoli Theorems The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them

More information

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of

More information

. Find E(V ) and var(v ).

. Find E(V ) and var(v ). Math 6382/6383: Probability Models and Mathematical Statistics Sample Preliminary Exam Questions 1. A person tosses a fair coin until she obtains 2 heads in a row. She then tosses a fair die the same number

More information

arxiv:cond-mat/ v3 16 Sep 2003

arxiv:cond-mat/ v3 16 Sep 2003 replica equivalence in the edwards-anderson model arxiv:cond-mat/0302500 v3 16 Sep 2003 Pierluigi Contucci Dipartimento di Matematica Università di Bologna, 40127 Bologna, Italy e-mail: contucci@dm.unibo.it

More information

Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension. n=1

Theorem 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 information

Chapter 4. Measure Theory. 1. Measure Spaces

Chapter 4. Measure Theory. 1. Measure Spaces Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if

More information

Graphs with few total dominating sets

Graphs with few total dominating sets Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph

More information

Spanning and Independence Properties of Finite Frames

Spanning and Independence Properties of Finite Frames Chapter 1 Spanning and Independence Properties of Finite Frames Peter G. Casazza and Darrin Speegle Abstract The fundamental notion of frame theory is redundancy. It is this property which makes frames

More information

FIXED POINT THEORY FOR QUASI-CONTRACTION MAPS IN b-metric SPACES

FIXED POINT THEORY FOR QUASI-CONTRACTION MAPS IN b-metric SPACES Fixed Point Theory, 15(2014), No. 2, 351-358 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html FIXED POINT THEORY FOR QUASI-CONTRACTION MAPS IN b-metric SPACES A. AMINI-HARANDI Department of Mathematics,

More information

Normal Approximation for Hierarchical Structures

Normal Approximation for Hierarchical Structures Normal Approximation for Hierarchical Structures Larry Goldstein University of Southern California July 1, 2004 Abstract Given F : [a, b] k [a, b] and a non-constant X 0 with P (X 0 [a, b]) = 1, define

More information

ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES

ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XL 2002 ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES by Joanna Jaroszewska Abstract. We study the asymptotic behaviour

More information

Some Background Material

Some Background Material Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important

More information

Phase transitions in discrete structures

Phase transitions in discrete structures Phase transitions in discrete structures Amin Coja-Oghlan Goethe University Frankfurt Overview 1 The physics approach. [following Mézard, Montanari 09] Basics. Replica symmetry ( Belief Propagation ).

More information

Nonlinear time series

Nonlinear time series Based on the book by Fan/Yao: Nonlinear Time Series Robert M. Kunst robert.kunst@univie.ac.at University of Vienna and Institute for Advanced Studies Vienna October 27, 2009 Outline Characteristics of

More information

FLUCTUATIONS OF THE LOCAL MAGNETIC FIELD IN FRUSTRATED MEAN-FIELD ISING MODELS

FLUCTUATIONS OF THE LOCAL MAGNETIC FIELD IN FRUSTRATED MEAN-FIELD ISING MODELS FLUCTUATIOS OF THE LOCAL MAGETIC FIELD I FRUSTRATED MEA-FIELD ISIG MODELS T. C. DORLAS AD W. M. B. DUKES Abstract. We consider fluctuations of the local magnetic field in frustrated mean-field Ising models.

More information

Lecture 3: Probability Measures - 2

Lecture 3: Probability Measures - 2 Lecture 3: Probability Measures - 2 1. Continuation of measures 1.1 Problem of continuation of a probability measure 1.2 Outer measure 1.3 Lebesgue outer measure 1.4 Lebesgue continuation of an elementary

More information

Spring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures

Spring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures 36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1

More information

Chapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries

Chapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.

More information

Non-radial solutions to a bi-harmonic equation with negative exponent

Non-radial solutions to a bi-harmonic equation with negative exponent Non-radial solutions to a bi-harmonic equation with negative exponent Ali Hyder Department of Mathematics, University of British Columbia, Vancouver BC V6TZ2, Canada ali.hyder@math.ubc.ca Juncheng Wei

More information

The Rademacher Cotype of Operators from l N

The Rademacher Cotype of Operators from l N The Rademacher Cotype of Operators from l N SJ Montgomery-Smith Department of Mathematics, University of Missouri, Columbia, MO 65 M Talagrand Department of Mathematics, The Ohio State University, 3 W

More information

II - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define

II - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define 1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1

More information

AN ELEMENTARY PROOF OF THE TRIANGLE INEQUALITY FOR THE WASSERSTEIN METRIC

AN ELEMENTARY PROOF OF THE TRIANGLE INEQUALITY FOR THE WASSERSTEIN METRIC PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 136, Number 1, January 2008, Pages 333 339 S 0002-9939(07)09020- Article electronically published on September 27, 2007 AN ELEMENTARY PROOF OF THE

More information

CONVERGENCE OF THE STEEPEST DESCENT METHOD FOR ACCRETIVE OPERATORS

CONVERGENCE OF THE STEEPEST DESCENT METHOD FOR ACCRETIVE OPERATORS PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 127, Number 12, Pages 3677 3683 S 0002-9939(99)04975-8 Article electronically published on May 11, 1999 CONVERGENCE OF THE STEEPEST DESCENT METHOD

More information

Linear distortion of Hausdorff dimension and Cantor s function

Linear distortion of Hausdorff dimension and Cantor s function Collect. Math. 57, 2 (2006), 93 20 c 2006 Universitat de Barcelona Linear distortion of Hausdorff dimension and Cantor s function O. Dovgoshey and V. Ryazanov Institute of Applied Mathematics and Mechanics,

More information

Module 3. Function of a Random Variable and its distribution

Module 3. Function of a Random Variable and its distribution Module 3 Function of a Random Variable and its distribution 1. Function of a Random Variable Let Ω, F, be a probability space and let be random variable defined on Ω, F,. Further let h: R R be a given

More information

COS597D: Information Theory in Computer Science October 19, Lecture 10

COS597D: Information Theory in Computer Science October 19, Lecture 10 COS597D: Information Theory in Computer Science October 9, 20 Lecture 0 Lecturer: Mark Braverman Scribe: Andrej Risteski Kolmogorov Complexity In the previous lectures, we became acquainted with the concept

More information

Banach Spaces II: Elementary Banach Space Theory

Banach Spaces II: Elementary Banach Space Theory BS II c Gabriel Nagy Banach Spaces II: Elementary Banach Space Theory Notes from the Functional Analysis Course (Fall 07 - Spring 08) In this section we introduce Banach spaces and examine some of their

More information

AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES

AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES DUSTIN HEDMARK Abstract. A study of the conditions under which a topological space is metrizable, concluding with a proof of the Nagata Smirnov

More information

The Canonical Gaussian Measure on R

The Canonical Gaussian Measure on R The Canonical Gaussian Measure on R 1. Introduction The main goal of this course is to study Gaussian measures. The simplest example of a Gaussian measure is the canonical Gaussian measure P on R where

More information

Indeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )

Indeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( ) Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes

More information

Some Results Concerning Uniqueness of Triangle Sequences

Some Results Concerning Uniqueness of Triangle Sequences Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We

More information

Quadratic replica coupling in the Sherrington-Kirkpatrick mean field spin glass model

Quadratic replica coupling in the Sherrington-Kirkpatrick mean field spin glass model arxiv:cond-mat/0201091v2 [cond-mat.dis-nn] 5 Mar 2002 Quadratic replica coupling in the Sherrington-Kirkpatrick mean field spin glass model Francesco Guerra Dipartimento di Fisica, Università di Roma La

More information

Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing

Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 2, pp. 401 412 (2013) http://campus.mst.edu/adsa Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes

More information

Lectures 2 3 : Wigner s semicircle law

Lectures 2 3 : Wigner s semicircle law Fall 009 MATH 833 Random Matrices B. Való Lectures 3 : Wigner s semicircle law Notes prepared by: M. Koyama As we set up last wee, let M n = [X ij ] n i,j=1 be a symmetric n n matrix with Random entries

More information

Introduction and Preliminaries

Introduction 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 information

The main results about probability measures are the following two facts:

The main results about probability measures are the following two facts: Chapter 2 Probability measures The main results about probability measures are the following two facts: Theorem 2.1 (extension). If P is a (continuous) probability measure on a field F 0 then it has a

More information

Properly forking formulas in Urysohn spaces

Properly forking formulas in Urysohn spaces Properly forking formulas in Urysohn spaces Gabriel Conant University of Notre Dame gconant@nd.edu March 4, 2016 Abstract In this informal note, we demonstrate the existence of forking and nondividing

More information

Least singular value of random matrices. Lewis Memorial Lecture / DIMACS minicourse March 18, Terence Tao (UCLA)

Least singular value of random matrices. Lewis Memorial Lecture / DIMACS minicourse March 18, Terence Tao (UCLA) Least singular value of random matrices Lewis Memorial Lecture / DIMACS minicourse March 18, 2008 Terence Tao (UCLA) 1 Extreme singular values Let M = (a ij ) 1 i n;1 j m be a square or rectangular matrix

More information

Chapter 2 Metric Spaces

Chapter 2 Metric Spaces Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics

More information

A CRITERION FOR THE EXISTENCE OF TRANSVERSALS OF SET SYSTEMS

A CRITERION FOR THE EXISTENCE OF TRANSVERSALS OF SET SYSTEMS A CRITERION FOR THE EXISTENCE OF TRANSVERSALS OF SET SYSTEMS JERZY WOJCIECHOWSKI Abstract. Nash-Williams [6] formulated a condition that is necessary and sufficient for a countable family A = (A i ) i

More information

Regularity of the density for the stochastic heat equation

Regularity of the density for the stochastic heat equation Regularity of the density for the stochastic heat equation Carl Mueller 1 Department of Mathematics University of Rochester Rochester, NY 15627 USA email: cmlr@math.rochester.edu David Nualart 2 Department

More information

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous: MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is

More information

µ X (A) = P ( X 1 (A) )

µ X (A) = P ( X 1 (A) ) 1 STOCHASTIC PROCESSES This appendix provides a very basic introduction to the language of probability theory and stochastic processes. We assume the reader is familiar with the general measure and integration

More information

2. The Concept of Convergence: Ultrafilters and Nets

2. The Concept of Convergence: Ultrafilters and Nets 2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two

More information

Series of Error Terms for Rational Approximations of Irrational Numbers

Series of Error Terms for Rational Approximations of Irrational Numbers 2 3 47 6 23 Journal of Integer Sequences, Vol. 4 20, Article..4 Series of Error Terms for Rational Approximations of Irrational Numbers Carsten Elsner Fachhochschule für die Wirtschaft Hannover Freundallee

More information

Filtrations, Markov Processes and Martingales. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition

Filtrations, Markov Processes and Martingales. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition Filtrations, Markov Processes and Martingales Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition David pplebaum Probability and Statistics Department,

More information