Energy of flows on Z 2 percolation clusters
|
|
- Moses Daniels
- 5 years ago
- Views:
Transcription
1 Energy of flows on Z 2 percolaton clusters Chrstopher Hoffman 1,2 Abstract We show that f p > p c (Z 2 ), then the unque nfnte percolaton cluster supports a nonzero flow f wth fnte q energy for all q > 2. Ths extends the work of Grmmett, Kesten, and Zhang and Levn and Peres n dmensons d 3. As an applcaton of our technques we exhbt a graph that has transent percolaton clusters, but does not admt exponental ntersecton tals. Ths answers a queston asked by Benjamn, Pemantle, and Peres. Keywords : percolaton, energy, electrcal networks, exponental ntersecton tals. Subject classfcaton : Prmary: 60J45; Secondary: 60J10, 60J65, 60J15, 60K35. 1 Department of Mathematcs, Unversty of Maryland, College Park, MD, Research supported n part by an NSF postdoctoral fellowshp 1
2 1 Introducton Consder Bernoull bond percolaton on Z d wth parameter p. Recall that ths s the ndependent process on Z d whch retans an edge wth probablty p and deletes an edge wth probablty 1 p. For all d > 1, there exsts a crtcal parameter p c (Z d ) < 1 such that f p < p c, then a.s. there s no connected component wth nfntely many edges. If p > p c, then a.s. there s a unque connected component wth nfntely many edges [1]. Ths component s called the unque nfnte cluster. Kesten proved that p c (Z 2 ) = 1/2 [9]. The phase where p > p c s called supercrtcal Bernoull percolaton. We consder only the supercrtcal case. Let G = G(E, V ) be the graph wth vertex set V and edge set E. Consder each undrected edge on G as two drected edges, one n each drecton. Let vw be the drected edge from v to w. A flow f on G wth source v 0 s an nonnegatve edge functon such that the net flow out of any vertex v v 0 s zero: w f(v 0 w) w f(wv 0 ) = 0. The strength of a flow f from the orgn s the amount flowng from 0: w f(0w) w f(w0). A multsource flow f on G s the sum (or ntegral) of flows on G. The q energy of a flow (or multsource flow) f on G s E q (f) = e E f(e) q. The energy of a flow s the 2 energy of the flow. Note that f a multsource flow on G has fnte q energy then t s the sum (or ntegral) of flows wth fnte q energy. Grmmett, Kesten and Zhang proved that f d 3 and p > p c (Z d ), then smple random walk on the nfnte percolaton cluster, C (Z d, p), s a.s. transent [6]. They proved ths result by constructng a flow on the percolaton cluster wth fnte energy, whch s equvalent to transence of smple random walk on the cluster. Grmmett, Kesten, and Zhang showed that there exsts a tree n C (Z d, p) where the branches bfurcate at farly regular ntervals. Ths tree gves rse to a flow n a natural way. It s then easy to bound the energy of ths flow. Benjamn, Pemantle and Peres [3] gave an alternatve proof of Grmmett, Kesten and Zhang s result. They constructed unpredctable processes on Z. They used them to create a measure on the collecton of paths n Z d whch emanate from 0. For d 3 the measure µ they created has exponental ntersecton tals. That s, there exsts C and a θ < 1 such that for 2
3 all n µ µ { (ϕ, ψ) : ϕ ψ n } Cθ n, where ϕ ψ s the number of edges n the ntersecton of ϕ and ψ. We say that a graph G admts exponental ntersecton tals f there exsts a measure µ on paths on G wth exponental ntersecton tals. Then they proved that any graph that admts exponental ntersecton tal has transent percolaton clusters for some p < 1. They asked whether the converse s true. We show that t s not. Levn and Peres adapted the approach of Benjamn et al. to show that for d 3 these flows have fnte q energy a.s. for q > d/(d 1) [10]. Ths result s optmal snce Z d also supports flows of fnte q energy f and only f q > d/(d 1) [11]. In ths paper we wll use the method of Grmmett, Kesten, and Zhang to extend Levn and Peres s result to d = 2. Theorem 1.1 For every p > p c (Z 2 ) and q > 2 there exsts a flow on C (Z 2, p) wth fnte q energy a.s. Levn and Peres also proved a result usng a generalzaton of the energy of a flow. For any d 2 and α > 0, let H d,α (u) = u d/(d 1) /[log(1 + u 1 )] α for u > 0 and H d,α (0) = 0. Levn and Peres proved that f d 3 then C (Z d, p) supports a flow of fnte H d,α energy for any α > 2. (That s e H d,α (f(e)) <.) Hoffman and Mossel sharpened ths result by showng that C (Z d, p) supports a flow of fnte H d,α energy for d 3 and α > 1 [8]. Ths last result s optmal because there exsts a flow of fnte H d,α energy on Z d f and only f α > 1 [12]. We wll extend ths result of Levn and Peres to Z 2. Theorem 1.2 For every p > 1/2 and α > 2 there exsts a flow on C (Z 2, p) wth fnte H 2,α energy a.s. We are unable to prove a verson of Hoffman and Mossel s results for d = 2, but we conjecture that t s true. Conjecture 1.1 For every p > 1/2 and α > 1 there exsts a flow on C (Z 2, p) wth fnte H 2,α energy a.s. 3
4 Ths would requre a new approach as the Grmmett et al. method cannot be extended to reach ths concluson and the Benjamn et al. approach says nothng about graphs, lke Z 2, that do not admt exponental ntersecton tals. Häggström and Mossel used Benjamn, Pemantle and Peres s approach to extend the Grmmett, Kesten, and Zhang result n another way. They defned two classes of subgraphs of Z 3 and showed these subgraphs admt exponental ntersecton tals. Thus smple random walk on the nfnte percolaton cluster of those subgraphs s transent [7]. On certan subgraphs of Z 3 where Häggström and Mossel showed that smple random walk on the nfnte percolaton cluster s transent t s clear that the Grmmett, Kesten, and Zhang approach wll not work. We gve an example of a graph where the Grmmett et al. approach works but the Benjamn et al. approach does not. More specfcally we prove the followng. Theorem 1.3 There exsts a graph G whch has transent percolaton clusters but does not admt exponental ntersecton tals. To do ths we construct a graph G whch s the drect product of a tree and Z. The subset of G whch projects onto a branch of the tree s a subgraph of Z 2. On the percolaton cluster restrcted to that subset we construct a flow of fnte H 2,3 energy. Integratng these flows over all branches gves a multsoure flow of fnte energy on the percolaton cluster of G. Thus smple random walk on the nfnte percolaton cluster of G s transent. Then we show that ths graph does not support exponental ntersecton tals. 2 Flows on C (Z 2, p) We proceed usng the method of Grmmett, Kesten, and Zhang. We wll fnd a tree n C (Z 2, p). The branches of ths tree splt nto two at farly regular ntervals. Wth ths tree we wll assocate a flow. Snce we have control on how often the branches of the tree bfurcate we wll be able bound the q energy of the flow. Ths method allows us to show that there exst flows on C (Z 2, p) of fnte q energy for all q > 2. Frst we ntroduce some notaton. A path P s a sequence of open drected edges where the end of one edge s the begnnng of the next edge. A path P connects x and 4
5 y f x and y are endponts of edges n P. We wrte x y f there exsts an open path from x to y. We wrte x f x s part of the unque nfnte cluster. If x y then we let D(x, y) be the length of the shortest open path from x to y. We use the taxcab metrc on Z 2, (x, y), (x, y ) = x x + y y. Let β > 2, ρ 1, and b be constants whch wll be defned later. Let a = 20ρb. Let X k () = (β k, (β/2) k ) for all, 2 k 1 < 2 k 1, and k 1. Defne X k () =.5(X k+1 (2) + X k+1 (2 1)). The tree n the percolaton cluster that we wll construct wll have the followng propertes. For each and k there wll be one branch gong from near X k () to near X k (). Ths branch wll then bfurcate near X k+1 (2). One of the branches goes toward X k+1 (2), whle the other branch goes toward X k+1 (2 1). Defne L(u, v) to be the elements n Z 2 whch are wthn 2 of the lne segment jonng u and v. Let B(k) be all (x, y) Z 2 such that x + y k. Defne T k () = B(ak) + ( L(X k (), X k ()) L(X k+1 (2), X k+1 (2 1)) ), where + represents Mnkowsk addton. Lemma 2.1 There exsts a functon K(a) such that T k () T k (j) = for all j and k > K(a). We also have that T k () T k+1 (j) = for all j 2 or j 2 1 and k > K(a). Proof: If T k () T k (j) s not empty the there exsts a pont n L(X k (), X k ()) L(X k+1 (2), X k+1 (2 1)) whch s wthn 2ak of a pont n L(X k (j), X k (j)) L(X k+1 (2j), X k+1 (2j 1)). 5
6 Wthout loss of generalty ths mples ether X k (), X k (j) 2ak or X k+1 (2), X k+1 (2j 1) 2ak. Those two dstances are at least (β/2) k. So the frst condton s satsfed f (β/2) K(a) > 2aK(a). The second condton s also satsfed wth the same choce of K(a) for the same reason. Our next goal s to gve a suffcent condton for there to be an open path from a pont near X k () to a pont near X k+1 (2). Our condton wll also mply that the path les entrely nsde T k () and has length bounded by C X k (), X k+1 (2). Fnd y 1 = y 1 (k, ) through y t = y t (k, ) such that 1. y 1 = X k (), 2. y t X k () bk y u, y u+1 8bk, for all 1 u t 1 4. y u L(X k (), X k ()), for all 1 u t 1 and 5. t β k+1 /4bk. Defne E u = E u (k, ) to be the event that 1. there exsts z 1 y u + B(bk) such that z 1, and 2. any two ponts z 2 (y u + B(bk)) and z 3 (y u+1 + B(bk)) whch are connected have D(z 2, z 3 ) ak/2. Ths mples that the shortest path connectng z 2 and z 3 les n y u + B(ak) T k (). If all the E u hold then there s a path from near X k () to near X k () nsde T k (). In a smlar manner we can fnd y 1 through y t such that 1. y 1 = X k+1 (2 1), 2. y t = X k+1 (2), 3. 4bk y u, y u+1 8bk, for all 1 u t 1 4. y u L(X k+1 (2 1), X k+1 (2)), for all 1 u t 1, 6
7 5. t 5ρβ k+1 /bk, and 6. there exst u and u such that y u = y u. Defne E u = E u(k, ) to be the event that 1. there exsts z 1 y u + B(bk) such that z 1, and 2. any two ponts n z 2 (y u + B(bk)) and z 3 (y u+1 + B(bk)) whch are connected have D(z 2, z 3 ) ak/2. Ths mples that the shortest path connectng z 2 and z 3 les n y u + B(ak) T k (). Defne E k () = ( u E u (k, )) ( u E u(k, )). In ths next lemma we show that f E k () holds for one k and then there exst a path from near X k () to near X k+1 (2) and a path from near X k () to near X k+1 (2 1). We also show that f E k () holds for all k suffcently large and all then there exsts a tree wth the desred propertes n C (Z 2, p). Ths mples that there exsts a flow of fnte q energy for all q > 1 + log 2 β. Lemma 2.2 If there exsts a K such that E k () holds for all k K and then there exsts a flow on C (Z 2, p) wth fnte q energy for all q > 1 + log 2 β. Proof: It causes no loss of generalty to assume that K > K(a). We construct a multsource flow that has a source near each X K (). We wll show that the multsource flow has fnte energy. Thus there exsts a flow wth fnte energy. Snce E k () holds for each k K and t s possble to pck ponts p k () such that p k () X k () + B(bk) and p k (). For each k and t s possble to pck ponts z u y u + B(bk) such that z u. It s also possble to select z u y u + B(bk) such that z u. We can also requre that there exst u and u such that z u = z u, z 1 = p k (), z 1 = p k+1 (2 1), and z t = p k+1 (2). The second condton n the defnton of E u mples that z u z u+1. Snce all the E u and E u hold we can pece together these paths to form paths P k () and P k() such that 1. P k () whch connects p k () and p k+1 (2) 2. P k() whch connects p k () and p k+1 (2 1) 3. P k (), P k() T k (), and 7
8 4. P k (), P k() (ak/2)(β k+1 /4bk) = 5ρβ k+1 /2. The unon of the P k () and the P k() does not necessarly form a tree. However t s easy to remove branches so that t does form a tree. Instead of dong ths we use the P k () and the P k() to defne a flow drectly. For each edge e assgn t mass f(e) = k, 1 2 k ( IPk ()(e) + I P k ()(e) ). Lemma 2.1, the fact that K K(a), and condton 3 on the P k () mples that f e P k () P k() and k > K(a) then f(e) 4(2 k ). If f(e) q + f(e) q < e P k () e P k () then f(e) q < s fnte. Thus the followng calculaton shows f has fnte q energy. f(e) q + (4(2 k )) q 5ρβ k+1 e P k () e P k () f(e) q C2 kq β k C2 k(q log 2 β) 2 k+1 2C2 k(q log 2 β 1) <. Now we show that wth probablty one there exsts a K so that E k () holds for all k > K and all. To do ths we need to bound the probabltes of E u and the E u. Ths requres one two theorems. The frst follows from the work of Russo [13], Seymour and Welsh [14], and Kesten [9]. Theorem 2.1 Gven p >.5 there exsts C 1 and α 1 so that P(B(k) ) < C 1 2 α 1k. The second s due to Antal and Psztora [2]. Theorem 2.2 [2] Let p >.5. Then there exsts ρ = ρ(p) [1, ), and constants C 2, and δ > 0 such that for all y P(0 y, D(0, y) > ρ y ) < C 2 2 δ y. 8
9 Lemma 2.3 There exsts an α > 0 such that for all k P(E u (k, )) > 1 C 3 2 αbk. Proof: By Theorem 2.1 the probablty that condton 1 n the defnton of E u (k, ) does not hold s less than C 1 2 α1bk. If condton 2 s not true then there exst two ponts that are connected but the dstance between them s large. Theorem 2.2 mples that P ( z 2 and z 3 such that D(z 2, z 3 ) > ak/2 = 10ρbk ρ z 2 z 3 ) < (bk) 2 C 2 2 2δbk. Thus P(E u (k, )) > 1 C 1 2 α1bk (bk) 2 C 2 2 2δbk > 1 C 3 2 αbk for an approprate choce of C 3 and α. We also get the same bound for P(E u). Lemma 2.4 For p >.5 there exsts b, C 4, and α > 1 such that for all k and P(E k ()) 1 C 4 2 α k. Proof: Choose b large enough so that α = αb log 2 β > 1. P(E k ()) 1 u P(E u (k, ) C ) u P(E u(k, ) C ) 1 5ρβ k+1 C 3 2 αbk 1 C 4 2 k log 2 β αbk 1 C 4 2 α k. Proof of Theorem 1.1: Gven p >.5 and q > 2 choose β so that β > 2 and q > 1 + log 2 β. The prevous lemma mples that lm n P(,k>n E k ()) = 1. Thus the Borel- Cantell lemma and Lemma 2.2 there exsts a flow of fnte q energy wth probablty 1. 9
10 3 A Refnement In ths secton we wll be concerned wth a generalzaton of the energy of a flow. For any functon H we defne the H energy of a flow f as E H (f) = e H(f(e)). We wll be workng wth a specal class of functons. For any α > 0, let H 2,α (u) = u 2 /[log(1 + u 1 )] α for u > 0 and H 2,α (0) = 0. The man result of ths secton s that for d = 2 there exsts a flow of fnte H 2,α energy on C (Z 2, p) for all α > 2. The proof s very smlar to the prevous secton. Let β > 1, ρ 1, and b be constants whch wll be defned later. Let a = 20ρb. Defne t k = 2 k k β. Let X k () = (t k, (t k )/2 k ) for 2 k and k 0. Then defne T k () as n secton 2. Lemma 3.1 For each β > 1 there exsts a functon K(a) such that T k () T k (j) = (1) for all j and k > K(a). We also have that T k () T k+1 (j) = (2) for all j 2 or j 2 1 and k > K(a). Proof: If T k () T k (j) s not empty the there exsts a pont n L(X k (), X k ()) L(X k+1 (2), X k+1 (2 1)) whch s wthn 2ak of a pont n L(X k (j), X k (j)) L(X k+1 (2j), X k+1 (2j 1)). Wthout loss of generalty ths mples ether X k (), X k (j) 2ak or X k+1 (2), X k+1 (2j 1) 2ak. Those two dstances are at least k β. So the frst condton s satsfed f K(a) β > 2aK(a). Ths can be acheved whenever β > 1. The second condton s also satsfed wth the same choce of K(a) for the same reason. 10
11 Pck the y 1,..., y t, y 1,..., y t as n secton 2. Ths can be done wth t t k+1 /4bk < 2 k 1 (k + 1) β /bk. Defne E u, E u, and E k () the same as n the prevous secton. Lemma 3.2 If E k () holds for all k K and all then there exsts a flow on C (Z 2, p) wth fnte H 2,α energy for all α > 1 + β. Proof: Agan we create a multsource flow wth fnte energy. We assume that K > K(a). Snce E k () holds for each k and t s possble to pck ponts p k () such that p k () X k () + B(bk) and p k (). We can also defne z u and z u as n the prevous secton. Snce E k () hold then there exsts paths P k () and P k() such that 1. P k () whch connects p k () and p k+1 (2) 2. P k() whch connects p k () and p k+1 (2 1) 3. P k (), P k() T k (), and 4. P k (), P k() (ak/2)(2 k 1 (k + 1) β /bk) < 5ρ2 k (k + 1) β. For each edge e assgn t mass f(e) = k, 1 2 k ( IPk ()(e) + I P k ()(e) ). Lemma 3.1 mples that f e P k () P k() and k > K(a) then If, e P k () f(e) 4(2 k ). (3) H 2,α (f(e)) + H 2,α (f(e)) < e P k () then H 2,α (f(e)) <. Thus the followng calculaton shows f has fnte H 2,α energy. e P k () H 2,α (f(e)) + H 2,α (f(e)) (4(2 k )) 2 e P k () [log(1 + (4(2 k )) 1 )] α 10ρ2k (k + 1) β 11 C(2 k )k β [ log(4(2 k ))] α
12 < C (2 k )k β [k 2] α 2k+1 C k β α Proof of Theorem 1.2: Gven p >.5 and α > 2 choose β so that β > 1 and α > 1 + β. Choose b so that Lemma 2.4 mples that lm n P(,k>n E k ()) = 1. Thus by Lemma 3.2 and the Borel-Cantell lemma there exsts a flow of fnte H 2,α energy wth probablty 1. 4 A graph wth transent percolaton clusters that do not admt exponental ntersecton tals In ths secton we wll construct a graph G. Usng the results of the prevous secton we are able to show that G has transent percolaton clusters. Then we wll show that G does not admt exponental ntersecton tals. Let b = 2 2 /5. Before we defne G we defne T = {(x, y) x N, y {0, 1} N, y = 0 for all such that b x} to be the tree whose branches splt at dstance b from the root. Thus a vertex (x, y) s dstance x from the root. The vertex (x, y) s connected to the vertex (x + 1, y). If x = b for some then the vertex (x, y) s also connected to the vertex (x + 1, ỹ), where ỹ = 1 and ỹ j = y j for all j. At dstance d from the root of T there are O(log d) 5 branches. Let G = {(x, y, z) (x, y) T, z Z, and z.6x}. Theorem 4.1 For all p > 1/2 smple random walk on the nfnte percolaton clusters on G s a.s. transent. Proof: We use the constructon n the prevous secton wth β = 1.5. To each y {0, 1} N corresponds G y = {(x, y, z) G y = y for all such that x < b and y = 0 else}, 12
13 a subset of G whch looks lke a wedge of Z 2. By the prevous secton we have wth postve probablty exhbted a flow, f y, on the nfnte percolaton cluster of G y. Ths flow has fnte H 2,3 energy. Defne the multsource flow F (e) = f y (e)dm, where m s (1/2, 1/2) product measure on {0, 1} N. Denote by T k () all branches (x, y, z) such that (x, z) T k (). Now we calculate the energy of F. e T k () F (e) 2 = ( e T k () = ( e T k () ) 2 f y (e)dm B e f y (e)dm where B e = (y y = y for all b < x) for e = (x, y, z). The last equalty s true because the defnton of f y the nequalty mples that f y (e) = 0 for all y / B e. Jensen s nequalty generates ( Snce m(b e ) < C(log e ) 5 e T k () X ) 2 ( ) fdm (m(x)) (f) 2 dm. X F (e) 2 e T k () e T k () C k 5 k 5 <. C C k 2 C f k 5 y (e) 2 dm B e C k 5 e T k () f y (e) 2 dm ) 2 f y (e) 2 dm (4(2 k )) 2 10ρ2 k (k + 1) 3 (4) Lne (4) s true by equaton (3) and condton 4 n the proof of Lemma 3.2. Thus f p >.5 nfnte percolaton clusters on G support flows of fnte energy and are transent. 13
14 Now we show that there s no measure on paths on G wth exponental ntersecton tals. We do ths as follows. Frst we defne a functon f(ψ, ϕ). We show that f µ s a measure on paths wth exponental ntersecton tals then fd(µ µ) s fnte. Then we show that for any measure on paths on G that the ntegral must be nfnte. Thus the graph G does not admt exponental ntersecton tals. It causes no loss of generalty to assume that µ s supported on transent paths. Let ψ ϕ be the number of edges that ψ and ϕ have n common. Let χ e (ψ, ϕ) be the event that e ψ ϕ. Defne f(ψ, ϕ) = If e ψ let l(e) be the largest number such that ψ l(e) = e. Let ψ be the path gven by edges ψ +1, ψ +2,... Notce that ψ ϕ =1 5. f e χ e (ψ, ϕ)( ψ ϕ ψ l(e) ϕ ) 5. (5) Lemma 4.1 If µ s a measure wth exponental ntersecton tals then fd(µ µ) <. Proof: Because µ has exponental ntersecton tals there exsts constants C and θ < 1 such that µ µ( ψ ϕ ) Cθ. Thus fd(µ µ) = = ψ ϕ =1 5 =1 5 d(µ µ) χ ψ ϕ d(µ µ) 5 µ µ( ψ ϕ ) 5 Cθ <. Ths next lemma s the man tool we wll use to show that fd(µ µ) = for any measure µ on paths n G. 14
15 Lemma 4.2 There exsts C such that for any µ and e G E( ψ ϕ ψ l(e) ϕ e ψ ϕ) > C log e. Proof: Let E n (e) be the set of all edges at dstance n from e. Snce e = ϕ l(e) and µ s supported on transent paths then there exsts a k > l(e) so that ϕ k E n (e). We can rewrte ths as P(e ψ \ ψ l(e) e ψ) 1. e E n(e) The expected number of ntersectons of ψ \ ψ l(e) and ϕ n E n (e) s E( ψ ϕ E n (e) ψ l(e) ϕ E n (e) e ψ ϕ) P(e ψ \ ψ l(e) e ψ) 2 e E n(e) 1/ E n (e). The last nequalty s true because of the Cauchy-Schwartz nequalty. Let e = (x, y, z), e = (x, y, z ) and e E n (e). Defne e = x + z. Then.5 e < x e. If n e /10 then.3x < x < 1.2x. As any nterval (j, 4j) has at most one b there can be at most 3 possble values for z. For each x and z there are at most two possble values for y. Thus for any e G and n e /10 we have that E n (e) 12n. Puttng these two facts together we get that E( ψ ϕ ψ l(e) ϕ e ψ ϕ) > e /10 n=1 1/12n > C log e. Theorem 4.2 G does not admt exponental ntersecton tals. Proof: We argue by contradcton. If there were a measure µ wth exponental ntersecton tals then Lemma 4.1 says that fd(µ µ) <. The followng calculaton shows that ths ntegral must be nfnte. fd(µ µ) χ e (ψ, ϕ)( ψ ϕ ψ l(e) ϕ ) 5 d(µ µ) (6) e χ e (ψ, ϕ)e( ψ ϕ ψ l(e) ϕ e ψ ϕ) 5 d(µ µ) (7) e χ e (ψ, ϕ)(c log j) 5 d(µ µ) (8) e e =j 15
16 j j j j (C log j) 5 (µ µ)(e ψ, e ϕ) e =j (C log j) 5 µ(e ψ) 2 e =j (C log j) 5 1 C j(log j) 5 (9) C j Lne (6) comes from lne (5). Lne (7) follows from Jensen s nequalty. Lne (8) follows from Lemma 4.2. Lne (9) s true because the number of e such that e = s bounded by C (log ) 5. Thus µ does not have exponental ntersecton tals. Proof of Theorem 1.3: Theorem 1.3 s a combnaton of Theorems 4.1 and 4.2. References [1] M. Azenman, H. Kesten, C. Newman (1987) Unqueness of the nfnte cluster and contnuty of connectvty functons for short and long range percolaton. Comm. Math. Phys. 111, no. 4, [2] P. Antal and A. Psztora (1996). On the chemcal dstance n supercrtcal Bernoull percolaton. Ann. Probab [3] I. Benjamn, R. Pemantle and Y. Peres (1998). Unpredctable paths and percolaton. Ann. Probab., to appear. [4] P. G. Doyle and E. J. Snell (1984). Random walks and electrcal networks. Carus Math. Monographs 22, Math. Assoc. Amer., Washngton, D. C. [5] G.R. Grmmett (1989). Percolaton. Sprnger, New York. [6] G. R. Grmmett, H. Kesten and Y. Zhang (1993). Random walk on the nfnte cluster of the percolaton model. Probab. Th. Rel. Felds 96, [7] O. Häggström and E. Mossel (1998). Nearest-neghbor walks wth low predctablty profle and percolaton n 2 + ɛ dmensons. Ann. Probab., to appear. 16
17 [8] C. Hoffman and E. Mossel (1998). Energy of flows on percolaton clusters. to appear n Potental Analyss. [9] H. Kesten (1980). The crtcal probablty of bond percolaton on the square lattce equals 1/2. Comm. Math. Phys. 74 no. 1, [10] D. Levn, Yuval Peres (1998). Energy and cutsets n nfnte percolaton clusters. Preprnt. [11] Lyons, T. (1983) A smple crteron for transence of a reversble Markov chan, Ann. Probab. 11, [12] F. Y. Maeda (1977). A remark on the parabolc ndex of nfnte networks. Hroshma J. Math. 7, [13] L. Russo (1978) A note on percolaton. Z. Wahrschenlchketstheore und Verw. Gebete 43 (1978), no. 1, [14] P. Seymour, D. Welsh (1978). Percolaton probabltes on the square lattce. Advances n graph theory (Cambrdge Combnatoral Conf., Trnty College, Cambrdge, 1977). Ann. Dscrete Math
APPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationMAT 578 Functional Analysis
MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More information6. Stochastic processes (2)
Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space
More information6. Stochastic processes (2)
6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
More informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationPROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 7, July 1997, Pages 2119{2125 S (97) THE STRONG OPEN SET CONDITION
PROCDINGS OF TH AMRICAN MATHMATICAL SOCITY Volume 125, Number 7, July 1997, Pages 2119{2125 S 0002-9939(97)03816-1 TH STRONG OPN ST CONDITION IN TH RANDOM CAS NORBRT PATZSCHK (Communcated by Palle. T.
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationCaps and Colouring Steiner Triple Systems
Desgns, Codes and Cryptography, 13, 51 55 (1998) c 1998 Kluwer Academc Publshers, Boston. Manufactured n The Netherlands. Caps and Colourng Stener Trple Systems AIDEN BRUEN* Department of Mathematcs, Unversty
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationSpectral Graph Theory and its Applications September 16, Lecture 5
Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph
More informationPHYS 705: Classical Mechanics. Newtonian Mechanics
1 PHYS 705: Classcal Mechancs Newtonan Mechancs Quck Revew of Newtonan Mechancs Basc Descrpton: -An dealzed pont partcle or a system of pont partcles n an nertal reference frame [Rgd bodes (ch. 5 later)]
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationPES 1120 Spring 2014, Spendier Lecture 6/Page 1
PES 110 Sprng 014, Spender Lecture 6/Page 1 Lecture today: Chapter 1) Electrc feld due to charge dstrbutons -> charged rod -> charged rng We ntroduced the electrc feld, E. I defned t as an nvsble aura
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationEvery planar graph is 4-colourable a proof without computer
Peter Dörre Department of Informatcs and Natural Scences Fachhochschule Südwestfalen (Unversty of Appled Scences) Frauenstuhlweg 31, D-58644 Iserlohn, Germany Emal: doerre(at)fh-swf.de Mathematcs Subject
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationAffine and Riemannian Connections
Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons
More informationPhysics 5153 Classical Mechanics. Principle of Virtual Work-1
P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introducton to Cluster Algebra Ivan C.H. Ip Updated: Ma 7, 2017 3 Defnton and Examples of Cluster algebra 3.1 Quvers We frst revst the noton of a quver. Defnton 3.1. A quver s a fnte orented
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationGeometry of Müntz Spaces
WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationTHE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.
THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY Wllam A. Pearlman 2002 References: S. Armoto - IEEE Trans. Inform. Thy., Jan. 1972 R. Blahut - IEEE Trans. Inform. Thy., July 1972 Recall
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationA note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationwhere a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets
5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationUniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity
Int. Journal of Math. Analyss, Vol. 6, 212, no. 22, 195-114 Unqueness of Weak Solutons to the 3D Gnzburg- Landau Model for Superconductvty Jshan Fan Department of Appled Mathematcs Nanjng Forestry Unversty
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationSubset Topological Spaces and Kakutani s Theorem
MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered
More informationThe path of ants Dragos Crisan, Andrei Petridean, 11 th grade. Colegiul National "Emil Racovita", Cluj-Napoca
Ths artcle s wrtten by students. It may nclude omssons and mperfectons, whch were dentfed and reported as mnutely as possble by our revewers n the edtoral notes. The path of ants 07-08 Students names and
More informationA permuted random walk exits faster
A permuted random wal exts faster Rchard Pymar Perla Sous Aprl 4, 013 Abstract Let σ be a permutaton of {0,..., n}. We consder the Marov chan X whch jumps from 0, n to σ( + 1) or σ( 1), equally lely. When
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora
prnceton unv. F 13 cos 521: Advanced Algorthm Desgn Lecture 3: Large devatons bounds and applcatons Lecturer: Sanjeev Arora Scrbe: Today s topc s devaton bounds: what s the probablty that a random varable
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
More informationOne Dimension Again. Chapter Fourteen
hapter Fourteen One Dmenson Agan 4 Scalar Lne Integrals Now we agan consder the dea of the ntegral n one dmenson When we were ntroduced to the ntegral back n elementary school, we consdered only functons
More informationSPECTRAL PROPERTIES OF IMAGE MEASURES UNDER THE INFINITE CONFLICT INTERACTION
SPECTRAL PROPERTIES OF IMAGE MEASURES UNDER THE INFINITE CONFLICT INTERACTION SERGIO ALBEVERIO 1,2,3,4, VOLODYMYR KOSHMANENKO 5, MYKOLA PRATSIOVYTYI 6, GRYGORIY TORBIN 7 Abstract. We ntroduce the conflct
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationModulo Magic Labeling in Digraphs
Gen. Math. Notes, Vol. 7, No., August, 03, pp. 5- ISSN 9-784; Copyrght ICSRS Publcaton, 03 www.-csrs.org Avalable free onlne at http://www.geman.n Modulo Magc Labelng n Dgraphs L. Shobana and J. Baskar
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More information