ON THE SPEED OF A PLANAR RANDOM WALK AVOIDING ITS PAST CONVEX HULL. By Martin P.W. Zerner

 Julian Floyd
 4 months ago
 Views:
Transcription
1 ON THE SPEED OF A PLANAR RANDOM WALK AVOIDING ITS PAST CONVEX HULL By Martn P.W. Zerner Abstract. We consder a random walk n R 2 whch takes steps unformly dstrbuted on the unt crcle centered around the walker s current poston but avods the convex hull of ts past postons. Ths model has been ntroduced and studed by Angel, Benjamn and Vrág. We show a large devaton estmate for the dstance of the walker from the orgn, whch mples that the walker has postve lm nf speed. 1. Introducton Angel, Benjamn and Vrág ntroduced and studed n [1] the followng model of a random walk (X n ) n 0 n R 2, whch they called the rancher. The walker starts at the orgn X 0 = 0. Suppose t has already taken n steps (n 0) and s currently at X n. Then ts next poston X n+1 s unformly dstrbuted on the unt crcle centered around X n but condtoned so that the straght lne segment X n, X n+1 from X n to X n+1 does not ntersect the convex hull K n of the past postons {X 0, X 1,..., X n }, see Fgure 1. Note that (X n ) n 0 s not Markovan snce n general one needs to know the whole hstory of the process n order to determne the transton probabltes for the next step. Ths makes ths model more dffcult to analyze than a Markovan random walk, a property t shares wth many other selfnteractng processes, see [1] and also [2] for references. We do not clam that ths model s of partcular mportance or that ts defnton s very natural. However, n the class of all selfnteractng processes t seems to be among the few models whch are at least partally analyzable and stll have some strkng propertes. Several such propertes have been conjectured by Angel, Benjamn and Vrág n [1]. Based on smulatons and heurstcs, the authors of [1] beleve 2000 Mathematcs Subject Classfcaton. 60K35. Secondary 60G50, 52A22. Key words: convex hull, large devatons, law of large numbers, random walk, self avodng, speed. Current address: Mathematsches Insttut, Unverstät Tübngen, Auf der Morgenstelle 10, D Tübngen, Germany. Emal: 1
2 2 RANDOM WALK AVOIDING ITS CONVEX HULL X2 X3 X =0 0 K 2 X 1 Fgure 1. Three steps of the walk. X 3 s unformly dstrbuted on the bold arc of the crcle wth radus 1, centered n X 2. e.g. that the drecton of the walk converges,.e. that X n / X n converges P a.s. to a random drecton, see [1, Conjecture 1]. Moreover, f we denote by w n as a measure for transversal fluctuatons the maxmal dstance of a pont n K n from the lne X 0, X n, then Angel, Benjamn and Vrág conjecture that w n grows lke n 3/4, see [1, Conjecture 2]. As far as results are concerned, the only major rgorous result whch has been proved so far for ths model to the best of our knowledge s that the walk has postve lm sup speed,.e. there s a constant c > 0 such that P a.s. lm sup X n /n > c as n, see [1, Theorem 1]. Here (Ω, F, P ) s the underlyng probablty space. The purpose of the present paper s to mprove ths result by showng the followng. Theorem 1. There s a constant c 1 > 0 such that 1 (1) lm sup n n log P [ X n c 1 n] < 0 and consequently, (2) lm nf n X n n c 1 P a.s.. In partcular, (2) proves [1, Conjecture 4]. We expect but were not able to prove that the speed lm X n /n exsts and s P a.s. constant, as conjectured n [1, Conjecture 5]. Let us now descrbe how the present artcle s organzed. The next secton ntroduces general notaton and gves a short overvew of the proof. In Secton 3 we ntroduce some sub and supermartngales, whch enable us n Secton 4 to bound exponental moments of the tme t takes the dameter of the convex hull K n to ncrease. From ths we deduce n Secton 5 estmates
3 RANDOM WALK AVOIDING ITS CONVEX HULL 3 γ := ext tme from +1 after τ σ +1 := ext tme from Kτ +n X τ Z,n,n +n Y D R,n X τ γd τ dτ X k() Fgure 2. General notaton for the dameter of K n smlar to the ones clamed n Theorem 1 for X n and show how ths mples Theorem Notaton and outlne of proof We denote by d n the dameter of K n. Snce (K n ) n s an ncreasng sequence of sets, (d n ) n s nondecreasng. The ladder tmes τ at whch the process (d n ) n 0 strctly ncreases are defned recursvely by τ 0 := 0 and τ +1 := nf{n > τ : d n > d τ } ( 0). It follows from [1] that P a.s. τ < for all 0. In Secton 4 we wll reprove ths fact by showng that the dfferences := τ +1 τ ( 0), between two successve fnte ladder tmes have some fnte exponental moments. Note that τ 1 = 1 snce d 0 = 0 and d 1 = 1 and observe that the τ s are stoppng tmes wth respect to the canoncal fltraton (F n ) n 0 generated by (X n ) n 0. Snce the dameter of a bounded convex set s the dstance between two of ts extremal ponts there s for all 1 wth τ < a (P a.s. unque) 0 k() < τ such that d τ = X τ X k(), see Fgure 2. For x R 2 and r > 0 we denote by B(x, r) the closed dsk wth center x and radus r. If τ < then σ +1 := nf{n 0 X n / B(X τ, d τ ) B(X k(), d τ )}
4 4 RANDOM WALK AVOIDING ITS CONVEX HULL boundary of lens X k() X τ X τ+n Drft Fgure 3. Idealzed pcture, assumng d τ =. Whenever the walker crosses a wedge for the frst tme, whch occurs at a postve rate, t has n the next step a postve drft towards the boundary of the lens. s the ext tme of the walk from the large lens shaped regon shown n Fgure 2, whch we shall refer to as the lens created at tme τ. Observe that K τ s contaned n the lens created at tme τ. Moreover, (3) τ +1 σ +1 snce f σ +1 <, X σ+1 has a dstance from ether X τ or X k() greater than d τ. We have now ntroduced enough notaton to be able to outlne the dea of the proof of Theorem 1. Outlne of Proof. To show that ( X n ) n s growng at a postve rate we shall frst show that (d n ) n s dong so. To ths end we shall bound exponental moments of the s. Ths s the heart of the proof and done as follows. Suppose that d n s already qute large and that we have just reached a new ladder tme τ, at whch the dameter has ncreased. Due to (3) the dameter can stay constant only as long as the walk s hdng n the lens created at tme τ. However, there are two mechansms, correspondng to Lemmas 4 and 5, whch ensure that the walk cannot hde n the lens for too long. The frst one, descrbed n Lemma 4, works whle the walk s stll nsde a small ball around X τ, see Fgure 2. The radus of ths ball s chosen to be proportonal to d τ. Ths stuaton s depcted n an dealzed form n Fgure 3. In ths regme the followng happens: Whenever the walk crosses for the frst tme any of the wedgeshaped lnes shown n Fgure 3, t has a drft away from X k() towards the boundary of the lens. To see ths consder the two boundary lnes of the convex hull whch are emanatng from X τ+n n Fgure 3. Suppose we are to draw n Fgure 3 the lne gong from X τ+n to the left. In the pcture ths lne has slope 0,.e. t s parallel to X τ, X k(), but
5 RANDOM WALK AVOIDING ITS CONVEX HULL 5 of course t could have a dfferent slope. However, ths slope cannot be much smaller than 0 because X τ+n s close to X τ but far away from X k(). On the other hand, the lne emanatng from X τ+n to the rght must have n Fgure 3 a slope of at least 1. Together, these two lnes create a drft downwards and more mportantly to the rght towards the boundary of the lens. (If the left lne has a postve slope then the drft to the rght s even stronger.) So every tme the walker crosses for the frst tme such a helpful wedgeshaped lne t wll be pushed towards the next wedgeshaped lne. If the lttle ball around X τ was nfntely large ths would result n crossngs of the wedgeshaped lnes at a postve rate, whch would propel the walk out of the lens very fast,.e. ths mechansm alone would gve a fnte exponental moment of, see Lemma 4. However, snce the ball s sze s fnte and proportonal to d τ, the walk can escape from ths lttle ball before leavng the lense wth a probablty exponentally small n d τ. (Ths wll happen a fnte number of tmes.) Whenever ths occurs, we rely on the second mechansm, see Lemma 5. The lne X τ, X k(), whch s part of the convex hull, creates a postve drft out of the lens. Snce the dameter of the lens s of order d τ t wll take the walker a tme of order d τ to reach the boundary of the lens. In fact we shall show, see Lemma 5, that t s exponentally costly for the walk to stay n the lens for a tme longer than the order of d τ. Ths s enough to make sure that the walk s not slowed down too much by occasonally resstng the frst mechansm and gettng lost n the lens. To make ths dea precse we need to ntroduce more notaton. The pont Y := X τ + X k() ( 1) 2 wll serve as the center of K τ and the radus R,n := X τ +n Y ( 1, n 0) s the dstance of X τ +n from ths center. The orthogonal projecton of X τ +n onto the straght lne passng through X τ and X k() wll be called Z,n ( 1, n 0). The dstance of X τ +n from ths lne s denoted by D,n := X τ +n Z,n ( 1, n 0). For the followng defntons we assume, n 1 and τ + n < τ +1. In partcular, due to (3), we assume that at tme τ + n the walk has not yet left the lens created at tme τ. Ths mples that Z,n X τ, X k() and that X τ and X k() are stll boundary ponts of K τ +n, as shown n Fgures 2 and 4. Hence f we start n X τ +n and follow the two boundary lne segments emanatng from X τ +n we wll eventually reach X τ and X k(). The boundary lne segment whose contnuaton leads frst to K τ and then to X k() s called
6 6 RANDOM WALK AVOIDING ITS CONVEX HULL X τ X τ Y ϕ 1 ϕ 2 s 1,,n s X τ +n 2,,n Z,n ψ 1 ψ 2 s 1,,n X τ +n s2,,n X k() X k() Fgure 4. General notaton s 1,,n, whle the other lne segment startng n X τ +n s denoted by s 2,,n, see Fgure 4. The angle between s j,,n and X τ +n, Y s called ϕ j,,n [0, π] (j = 1, 2), see the left part of Fgure 4. Smlarly, the angle between s j,,n and X τ +n, Z,n s denoted by ψ j,,n [0, π] (j = 1, 2), see the rght part of Fgure 4. Occasonally, we wll dropped the subscrpts and n from ϕ and ψ. Snce K τ +n s convex, (4) ϕ 1 + ϕ 2 = ψ 1 + ψ 2 π. Furthermore, ϕ 1 ψ 1 s one of the angles n a rght angled trangle, namely the trangle wth vertces X τ +n, Y and Z,n. Hence, (5) ϕ 1 ψ 1 = ϕ 2 ψ 2 π/2. 3. Some sub and supermartngales The followng result shows that for every 1, both (R,n ) n and (D,n ) n (1 n < τ +1 τ ) are submartngales. Lemma 2. For all, n 1, P a.s. on {τ + n < τ +1 }, (6) (7) and E[R,n+1 R,n F τ +n] sn ϕ 1,,n + sn ϕ 2,,n 2π E[D,n+1 D,n F τ +n] sn ψ 1,,n + sn ψ 2,,n 2π sn ϕ 1,,n 2π sn ψ 1,,n 2π 0, 0 (8) E[D,n+1 D,n + R,n+1 R,n F τ +n] c 2 for some constant c 2 > 0.
7 X τ Xτ RANDOM WALK AVOIDING ITS CONVEX HULL 7 Z,n +n Y X τ +n X τ Z,n Fgure 5. The expected ncrement of R,n s small n the left fgure and large n the rght fgure. For D,n t s the other way round. Fgure 5 shows examples n whch the expected ncrements of R,n and D,n are close to 0, thus explanng, why we are not able to bound n (6) and (7) these expected ncrements ndvdually away from 0. Note however, that n both stuaton depcted n Fgure 5, f the expected ncrement of R,n or of D,n s small then the expected ncrement of the other quantty s large. Ths confrms that the expected ncrements of R,n and D,n cannot both be small at the same tme, see (8). Proof of Lemma 2. We fx, n 1 and drop them as subscrpts of ϕ j,,n and ψ j,,n (j = 1, 2). Then the followng statements hold on the event {τ + n < τ +1 }. Consder the angle between Y, X τ +n and X τ +n, X τ +n+1 whch ncludes s 2,,n. Ths angle s chosen unformly at random from the nterval [ϕ 2, 2π ϕ 1 ]. Hence we get by a change of bass argument usng Y, X τ +n for the frst bass vector, E[R,n+1 F τ +n] = 1 (2π ϕ 1 ) ϕ 2 1 2π ϕ 1 ϕ 2 2π ϕ1 ϕ 2 2π ϕ1 ϕ 2 1 R,n + 2π ϕ 1 ϕ 2 (R,n, 0) (cos ϕ, sn ϕ) dϕ R,n cos ϕ dϕ 2π ϕ1 ϕ 2 cos ϕ dϕ = R,n + sn ϕ 1 + sn ϕ 2 R,n + sn ϕ 1 + sn ϕ 2, 2π ϕ 1 ϕ 2 2π whch shows (6). Smlarly, (7) follows from E[D,n+1 F τ +n] = 1 (2π ψ 1 ) ψ 2 2π ψ1 ψ 2 D,n cos ψ dψ. For the proof of (8) we assume wthout loss of generalty ϕ 1 π/2. Indeed, otherwse ϕ 2 π/2 because of ϕ 1 + ϕ 2 π, see (4), and n the followng proof one only has to replace the subscrpt 1 by the subscrpt 2 and swap... Y......
8 8 RANDOM WALK AVOIDING ITS CONVEX HULL X τ and X k(). By (6) and (7), E[D,n+1 D,n + R,n+1 R,n F τ +n] sn ϕ 1 + sn ψ 1 (9). 2π We wll show that the rght sde of (9) s always greater than c 2 := (4π 2 ) 1. Assume that t s less than c 2. Then (10) sn ϕ 1, sn ψ 1 (2π) 1 and hence ϕ 1 (π/2) sn ϕ 1 1/4 by concavty of sn on [0, π/2]. Smlarly, (10) mples that ether ψ 1 1/4 or π ψ 1 1/4. Due to ϕ 1 ψ 1 π/2, see (5), the latter case s mpossble. Therefore, (11) ϕ 1 ψ 1 max{ ϕ 1, ψ 1 } 1/4. The angle α [0, π/2] between Z,n, X τ +n and X τ +n, X τ s less than or equal to ψ 1. Consequently, (12) sn ψ 1 sn α = X τ Z,n X τ X τ +n X τ Y Y Z,n d τ. However, snce Y, X τ +n K τ +n, (13) R,n = Y X τ +n d τ +n = d τ. Therefore, (12) sn ψ 1 d τ /2 Y Z,n d τ Y X τ +n = 1 2 sn ϕ 1 ψ 1 whch contradcts (10). We fx the constants (14) β := 1 + 4π 8 > 30 and γ := 1 2β < (11) = 1 4, Whenever τ < we denote the frst ext tme after τ from B(X τ, γd τ ) by γ +1 := nf{n > τ : X n X τ > γd τ } ( ), see Fgure 2. If 1 and n 0 then we shall call n good for f n = 0 or f (15) τ + n < τ +1 γ +1 and E[R,n+1 R,n F τ +n] 1 π 8 P a.s.. Ths means, n 1 s good for f at tme τ + n the walker has not yet left the ntersecton of the small ball around X τ and the lens shown n Fgure 2 and, roughly speakng, feels a substantal centrfugal force pushng t away from the center Y. Good tmes help the walker to leave the lens shortly after τ and closely to the pont X τ. Next we ntroduce an Azuma type nequalty for a certan famly of supermartngales, whch wll help make ths dea more precse.
9 RANDOM WALK AVOIDING ITS CONVEX HULL 9 Lemma 3. There are constants c 3 > 0, c 4 > 0 and 1 c 5 < such that P a.s. for all 1, n 0, where M,n := 1{τ + n < τ +1 } exp E [M,n F τ ] c 5 exp( c 4 n), ( c 3 n ) W,m m=1 and W,m := D,m 1 D,m + β(r,m 1 R,m ) + 4 1{m 1 s good for }. Proof. Fx 1. Frstly, we shall prove that for sutable c 4 > 0, (16) E [M,n+1 F τ +n] exp( c 4 )M,n P a.s. for all n 1, thus showng that (M,n ) n 1 s an exponentally fast decreasng submartngale. Snce W,m s F τ +mmeasurable (m 1), we have E [M,n+1 F τ +n] = M,n E[exp(c 3 W,n+1 ), τ + n + 1 < τ +1 F τ +n] M,n E[exp(c 3 W,n+1 ) F τ +n]. Therefore s suffces to show for the proof of (16) that on the event {τ + n < τ +1 }, E[exp(c 3 W,n+1 ) F τ +n] < 1 for some sutable c 3 > 0. However, snce the W,m s (m 1) are unformly bounded by a constant ths follows from the fact that on the event {τ + n < τ +1 }, E [W,n+1 F τ +n] = E[D,n D,n+1 + R,n R,n+1 F τ +n] ( + 4 π ) 8E[R,n R,n+1 F τ +n] + 1{n s good for } c 2 < 0 P a.s. by vrtue of defnton (15) and Lemma 2 (6), (8). Usng (16) for nducton over n we obtan by the tower property, E [M,n F τ ] exp( c 4 (n 1))E [M,1 F τ ] P a.s. for all n 1. Snce M,1 s bounded by a constant ths fnshes the proof. 4. Exponental moments of τ +1 τ. The next two lemmas provde tools needed to bound n Proposton 6 the tmes durng whch the dameter does not ncrease. The frst lemma shows that the walk cannot spend too much tme nsde the lens and the small ball around X τ shown n Fgure 2. Lemma 4. For all 1, n 0, P a.s. P [τ + n < τ +1 γ +1 F τ ] c 5 exp( c 4 n), where c 4 and c 5 are as n Lemma 3. The second lemma gves a frst crude upper bound for.
10 10 RANDOM WALK AVOIDING ITS CONVEX HULL Lemma 5. There s a fnte constant c 6 such that for all 1, n 0, P a.s. where c 4 and c 5 are as n Lemma 3. P [ > n F τ ] c 5 exp(c 4 (c 6 d τ n)), In the proof of both lemmas we wll use the fact that the sum n the defnton of M,n s n part telescopc,.e. n n (17) W,m = D,n + β(r,0 R,n ) + 4 1{m 1 s good for } m=1 snce D,0 = 0. Proof of Lemma 4. For n = 0 the statement s true snce c 5 1. Fx n 1. The statement follows from Lemma 3 and (17) once we have shown that on the event {τ + n < τ +1 γ +1 }, the rght hand sde of (17) s nonnegatve. Frst we wll show that on {τ + n < τ +1 γ +1 }, m=1 (18) D,n + β(r,n R,0 ) 2(D,n X τ Z,n ). Ths s done by brute force. For abbrevaton we set d := d τ, y := D,n and x := X τ Z,n and note that on {τ + n < τ +1 γ +1 } we have x, y [0, γd]. Observe that x and y play the role of cartesan coordnates of X τ +n, see Fgure 6. Usng R,0 = d/2 and R,n = (d/2 x) 2 + y 2 we see that (18) s equvalent to β (d/2 x) 2 + y 2 y 2x + βd/2. Both sdes of ths nequalty are nonnegatve snce x s less than γd, whch s tny compared to βd. Takng the square and rearrangng shows that (18) s equvalent to (19) x(4x 4y 2βd β 2 x + β 2 d) + y(y + βd β 2 y) 0. Snce x, y [0, γd] and βγ = 1/2, see (14), the terms β 2 d n the frst bracket and βd n the second bracket are the domnant terms, respectvely, whch shows that (19) and thus (18) holds. For the proof that the rght hand sde of (17) s ndeed nonnegatve on {τ + n < τ +1 γ +1 } t therefore suffces to show that, n 1 (20) D,n X τ Z,n 2 1{j s good for }. Both D,j and X τ Z,j can ncrease by at most 1 f j ncreases by 1. Therefore, the left hand sde of (20) s less than or equal to 2(#J,n ) where J,n := {0 j < n 0 m < j : D,m X τ Z,m D,j X τ Z,j }. j=0
11 RANDOM WALK AVOIDING ITS CONVEX HULL X k()... Y K τ K τ +3 ϕ 1 ψ1 Z X τ +3,3 x X τ y γd τ Fgure 6. More realstc and detaled than Fgure 3. The darkly shaded convex hull K τ at tme τ has been enlarged after three steps by the lghtly shaded part. j = 3 s good for snce t satsfes the suffcent crteron ψ 1,,3 π/4, see (22), whch corresponds to the fact that the dashed lne, whch ntersects the horzontal axs at an angle of π/4, does not ntersect Kτ o +3. j = 1 s also good for for the same reason, whle j = 2 mght be good for but fals to satsfy the suffcent condton (22), snce the correspondng dashed lne startng n X τ +2 would have ntersected Kτ o +2. Hence t suffces to show that the elements of J,n are good for. Note that j = 0 J,n s good for by defnton of beng good. So fx 1 j J,n. By Lemma 2 (6) t s enough to show that sn ϕ 1,,j 2 1/2, that s (21) ϕ 1,,j [π/4, 3π/4]. On the one hand, ϕ 1 ψ 1 s close to π/2, as can be seen n Fgure 6. More precsely, sn(ϕ 1 ψ 1 ) = Y Z,j Y X τ +j d τ /2 γd τ d τ /2 + γd τ Y X τ X τ Z,j Y X τ + X τ X τ +j = 1 2γ 1 + 2γ 1 2 = sn π 4. Snce 0 ψ 1 ϕ 1 ths mples ϕ 1 π/4, thus provng the frst part of (21). On the other hand, ϕ 1 ψ 1 π/2, see (5). Hence all that remans to be
12 12 RANDOM WALK AVOIDING ITS CONVEX HULL shown for the completon of the proof of (21) s that (22) ψ 1,,j π/4. Consder the half lne (dashed n Fgure 6) startng at X τ +j whch ncludes an angle of π/4 wth X τ +j, Z,j that contans s 1,,j. We clam that ths lne does not ntersect Kτ o +j. Ths would mply (22). To prove ths clam observe that for any c > 0 the set of possble values for X τ +m wth D,m X τ Z,m = c s a lne parallel to the half lne just descrbed. Snce j J,n the walker dd not cross between tme τ and tme τ + j 1 the dashed lne passng through X τ +j. Consequently, t suffces to show that the dashed lne does not ntersect Kτ o. If t dd ntersect Kτ o then ths would force the walker on ts way from X τ to X τ +j to cross the dashed lne strctly before tme τ + j, whch s mpossble as we just saw. Proof of Lemma 5. Agan, the statement s true for n = 0 snce c 5 1. For n 1, by the Pythagorean theorem and (13), D,n R,n d τ on the event {τ + n < τ +1 }. Thus on ths event the rght hand sde of (17) s greater than or equal to d τ + β(0 d τ ) + 0. Hence due to Lemma 3 and (17), P a.s. for all n 1, exp( c 3 (1 + β)d τ )P [τ + n < τ +1 F τ ] c 5 exp( c 4 n), whch s equvalent to the clam of the lemma wth c 6 := c 3 (1 + β)/c 4. The followng result s stronger than Lemma 5. Proposton 6. τ < P a.s. for all 0. Moreover, there are postve constants c 7, c 8 and fnte constants c 9 and c 10 1 such that for all 0 and n 0, P a.s., (23) (24) P [ n F τ ] c 9 exp( c 7 n) and E [exp(c 8 ) F τ ] c 10. Proof. (24) s an mmedate consequence of (23). For the proof of (23) choose (25) c 7 := γc 4 c 6 + γ and c 9 := c 5 e c 4 wth c 4, c 5 and c 6 accordng to Lemma 5. We only need to show that (23) holds for all 1 wth τ <. Indeed, the case = 0 s trval snce τ 0 = 0, τ 1 = 1 and hence 0 = 1. Moreover, snce (23) mples < P a.s., we then have τ = < as well. Fx 1 and n 0. We dstngush three cases: {n < γd τ }, {γd τ n < (c 6 + γ)d τ } and {(c 6 + γ)d τ n}.
13 RANDOM WALK AVOIDING ITS CONVEX HULL 13 Note that these events are elements of F τ and partton Ω. By defnton of γ +1, (26) γ +1 τ + γd τ snce the walker takes steps of length one. Therefore, on {n < γd τ }, P [ > n F τ ] On {γd τ n < (c 6 + γ)d τ }, P [ > n F τ ] P [τ + γd τ < τ +1 F τ ] Lemma 4 c 5 exp( c 4 (γ d τ 1)) (25) Fnally, on {(c 6 + γ)d τ n}, P [ > n F τ ] (26) = P [τ + n < τ +1 γ +1 F τ ] Lemma 4 c 5 exp( c 4 n) (25) c 9 exp( c 7 n). (26) P [τ + γd τ 1 < τ +1 γ +1 F τ ] c 9 exp( c 7 n). Lemma 5 c 5 exp(c 4 (c 6 d τ n)) (25) where the last nequalty can easly be checked. c 9 exp( c 7 n), 5. Lnear growth of the dameter and proof of Theorem 1 The followng result (wth m = 0) mples that (d n ) n has a postve lm nf speed. Lemma 7. There are constants c 11 > 0 and c 12 < such that for all 0 m n, E[exp(d m d n )] c 12 (n + 1) exp(c 11 (m n)). For the proof of ths lemma and of Theorem 1 we need the followng defnton: Gven n 0 let n := sup{ 0 τ n}. Note that (27) d τn = d n and n τ n n < τ n+1. Proof of Lemma 7. The case n = m s trval. So let 0 m < n and set (28) f(m, n) := n m > 0 and g(m, n) := c 8f(m, n) > 0, 2n 2 ln c 10 where c 8 and c 10 are accordng to Proposton 6. A smple unon bound yelds E[e dm dn ] I + II + III, where I := P [τ m+1 m f(m, n)n], II := P [τ m+1 m < f(m, n)n, n < m + g(m, n)n ] and III := E [exp (d m d n ), n m + g(m, n)n ],
14 14 RANDOM WALK AVOIDING ITS CONVEX HULL m n τ m m τ +1 m τ n n τ n +1 Fgure 7. see also Fgure 7. Here term I corresponds to the stuaton n whch after tme m the dameter does not ncrease for an untypcal long whle. Term II handles the case n whch the dameter does ncrease shortly after tme m, as t should, but not often enough n the remanng tme untl n. The thrd term III consders the orgnal random varable on the typcal event that the number of tmes at whch the dameter ncreases s at least proportonal to n wth a constant of proportonalty not too small. It suffces to show that each of these three terms decays as n n the way clamed n Lemma 7 wth constants c 11 and c 12 ndependent of n and m. As for the frst term, I P [ m f(m, n)n ] (23) c 9 (m + 1)e c 7 f(m,n)n (27) = m P [ m =, f(m, n)n ] =0 c 9 (n + 1)e c 7(m n)/2, whch s an upper bound lke the one requested n Lemma 7. The second term s estmated as follows. II (27) = P [ ] τ m+1 < m + f(m, n)n, n < τ n+1 τ m+ g(m,n)n (28) P [ τ m+ g(m,n)n τ m+1 n m f(m, n)n = f(m, n)n ] E [ exp ( ( c 8 τm+ g(m,n)n τ m+1 f(m, n)n ))] (29) = e c 8f(m,n)n k 1 = e c 8f(m,n)n E k 1 E [ exp ( c 8 ( τk+ g(m,n)n 1 τ k )), m + 1 = k ] g(m,n)n 2 =0 exp (c 8 k+ ), m + 1 = k. Note that { m + 1 = k} s the event that τ k s the frst tme after tme m at whch the dameter ncreases. Therefore, (30) { m + 1 = k} F τk. Moreover, the ncrements k+ are measurable wth respect to F τk++1. Consequently, by condtonng n (29) on F τk+ g(m,n)n 2 and applyng Proposton
15 RANDOM WALK AVOIDING ITS CONVEX HULL 15 1/2 X k() 1 Xτ X τ+u =X τ,0 τ +1 K τ Fgure 8. The event A occurs f the frst tral pont sampled les on the bold arc. 6 (24) wth = k + g(m, n)n 2 we conclude g(m,n)n 3 II e c8f(m,n)n c 10 E exp (c 8 ( k+ )), m + 1 = k. k 1 =0 Contnung n ths way we obtan by nducton after g(m, n)n 1 steps, II e c8f(m,n)n c g(m,n)n 1 10 e c8f(m,n)n c g(m,n)n 10 (28) = e (c 8/4)(m n), whch s agan of the form requred n Lemma 7. In order demonstrate that also the thrd term III behaves properly we wll show that the ncrements d τ+1 d τ, 1, have a unformly postve chance of beng larger than a fxed constant, say 1/2, ndependently of the past. To ths end, we may assume that the process (X n ) n s generated n the followng way: There are..d. random varables U n,k, n 0, k 0, unformly dstrbuted on the unt crcle centered n 0 such that X n+1 = X n + U n,k, where k s the smallest nteger such that X n, X n + U n,k does not ntersect K n. Then for any 1, by defnton of τ, (31) {d τ+1 d τ + 1/2} {d τ +1 d τ + 1/2} { U τ,0 Xτ X k() 1 } =: A. d τ 2 The reason for ncluson (31) s llustrated n Fgure 8: If A occurs then K τ and X τ + U τ,0 are separated by a slab of wdth 1/2. In partcular, the lne connectng X τ and X τ + U τ,0 does not ntersect K τ. Hence τ +1 = τ + 1 and X τ+1 = X τ +1 = X τ + U τ,0. Therefore, d τ +1 X τ +1 X k() X τ X k() + 1/2 = d τ + 1/2.
16 16 RANDOM WALK AVOIDING ITS CONVEX HULL It follows from (31) that for all 1 j 1 j 2, (32) j 2 1 j 2 1 d τj2 d τj1 1 1{d τ+1 d τ + 1/2} 1 1{A }. 2 2 =j 1 =j 1 Ths estmate wll be useful snce the random varables (33) 1{A } ( 1) are..d. wth P [A ] > 0. Indeed, let F n (n 0) be the σfeld generated by U m,k, 0 m < n, 0 k. Because of F n F n we have A j F τ for all 1 j <. Moreover, snce the unform dstrbuton on the unt crcle s nvarant under rotatons, (34) A s ndependent of F τ ( 1) and P [A Fτ ] = P [A ] s just the length of the bold crcle segment shown n Fgure 8 dvded by 2π. Ths mples (33). Now we estmate III by (27) III = E [ exp ( ) d τm d τn, n m + g(m, n)n ] E [ exp ( ) d τm+1 d τn, n ( m + 1) + g(m, n)n 1 ] [ ) ] E exp (d τk d τk+ g(m,n)n 1, m + 1 = k k 1 (35) (32) k 1 E exp 1 2 k+ g(m,n)n 2 =k 1{A }, m + 1 = k. As seen n (30), { m + 1 = k} F τk F τk. Therefore, after condtonng n (35) on F τk, we see wth the help of (34) for k and (33) that the rght hand sde of (35) equals [ ( E exp 1 g(m,n)n 1 1)] 2 A, whch decays as requred n Lemma 7, see (28). Lemma 7 drectly mples a weaker verson of Theorem 1 n whch X n s replaced by d n. For the full statement we need the followng addtonal argument. Proof of Theorem 1. (2) follows from (1) by the BorelCantell lemma. For the proof of (1) pck c 11 and c 12 accordng to Lemma 7 and choose c 13 > 0 and c 1 > 0 small enough such that (36) 2c 13 c 11 < 0 and 2c 1 c 11 (c 13 c 1 ) < 0.
17 RANDOM WALK AVOIDING ITS CONVEX HULL 17 We denote by M n := max{ X m m n} the walker s maxmal dstance from the orgn by tme n. Note that M n and d n are related va (37) M n d n 2M n for all n 0 because of X 0 = 0. By a unon bound for any n 0, (38) P [ X n c 1 n] P [ n c 1 n] + P [M n c 13 n] + P [B n ], where B n := { n < c 1 n, M n > c 13 n, X n c 1 n}. It suffces to show that each one of the three terms on the rght hand sde of (38) decays exponentally fast n n. As for the frst term, n P [ n c 1 n] (27) = P [ n =, c 1 n ] (23) c 9 (n + 1)e c 7c 1 n, =0 whch decays exponentally fast n n ndeed. So does the second term n (38) snce by Chebyshev s nequalty, P [M n c 13 n] (37) P [d n 2c 13 n] e 2c 13n E[e dn ] Lemma 7 c 12 (n + 1)e (2c 13 c 11 )n, whch decays exponentally fast due to the choce of c 13 n (36). Fnally, we are gong to bound the thrd term n (38), P [B n ]. Defne the ladder tmes (µ j ) j of the process (M n ) n 0 recursvely by µ 0 := 0 and µ j+1 := nf{n > µ j M n > M µj }. In analogy to ( n ) n for (τ ) we defne for (µ j ) j the ncreasng sequence (j n ) n by j n := sup{j 0 µ j n} and note that µ jn n < µ jn+1 and M n = X µjn. Hence on the event B n, X µjn X n X µjn X n = M n X n (c 13 c 1 )n. Snce the walker takes steps of length one, ths mples n µ jn (c 13 c 1 )n and therefore, on the event B n, (39) µ jn (1 c 13 + c 1 )n. On the other hand, on B n, (40) d n (27) = d τn = X τn X k(n) X n + X n X τn + X k(n) c 1 n + n + M n, where we used agan the fact that the steps have length one to estmate the second term and k( n ) n n to bound the thrd term. Therefore (40) can be estmated on B n from above by (37) (39) c 1 n + c 1 n + M µjn 2c 1 n + d µjn 2c 1 n + d (1 c13 +c 1 )n.
18 18 RANDOM WALK AVOIDING ITS CONVEX HULL Consequently, by Chebyshev s nequalty and Lemma 7, P [B n ] P [d n d (1 c13 +c 1 )n 2c 1 n] c 12 (n + 1)e (2c 1 c 11 (c 13 c 1 ))n, whch decays exponentally n n due to the choce of c 13 and c 1 n (36). References [1] O. Angel, I. Benjamn and B. Vrág. Random walks that avod ther past convex hull. Elect. Comm. n Probab. 8 (2003) [2] I. Benjamn and D.B. Wlson. Excted random walk. Elect. Comm. n Probab. 8 (2003) Department of Mathematcs Stanford Unversty Stanford, CA 94305, U.S.A.
Affine 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 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 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édTrotter theorem. The method was ntroduced n the paper Combnatoral complexty
More informationDECOUPLING THEORY HW2
8.8 DECOUPLIG THEORY HW2 DOGHAO WAG DATE:OCT. 3 207 Problem We shall start by reformulatng the problem. Denote by δ S n the delta functon that s evenly dstrbuted at the n ) dmensonal unt sphere. As a temporal
More informationarxiv: v1 [math.co] 1 Mar 2014
Unonntersectng 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 informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More information= 1.23 m/s 2 [W] Required: t. Solution:!t = = 17 m/s [W]! m/s [W] (two extra digits carried) = 2.1 m/s [W]
Secton 1.3: Acceleraton Tutoral 1 Practce, page 24 1. Gven: 0 m/s; 15.0 m/s [S]; t 12.5 s Requred: Analyss: a av v t v f v t a v av f v t 15.0 m/s [S] 0 m/s 12.5 s 15.0 m/s [S] 12.5 s 1.20 m/s 2 [S] Statement:
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 informationDirichlet s Theorem In Arithmetic Progressions
Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,
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 informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1s tme nterval. The velocty of the partcle
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 ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
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 multgraph.
More information6. Stochastic processes (2)
Contents Markov processes Brthdeath processes Lect6.ppt S38.45  Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuoustme and dscretestate stochastc process X(t) wth state space
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationTAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES
TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent
More informationA new construction of 3separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3separable matrces va an mproved decodng of Macula
More informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More informationGeometric drawings of K n with few crossings
Geometrc drawngs of K n wth few crossngs Bernardo M. Ábrego, Slva FernándezMerchant Calforna State Unversty Northrdge {bernardo.abrego,slva.fernandez}@csun.edu ver 9 Abstract We gve a new upper bound
More informationRandom Partitions of Samples
Random Parttons of Samples Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract In the present paper we construct a decomposton of a sample nto a fnte number of subsamples
More informationTopics in Probability Theory and Stochastic Processes Steven R. Dunbar. Classes of States and Stationary Distributions
Steven R. Dunbar Department of Mathematcs 203 Avery Hall Unversty of NebraskaLncoln Lncoln, NE 685880130 http://www.math.unl.edu Voce: 4024723731 Fax: 4024728466 Topcs n Probablty Theory and Stochastc
More informationAntivan der Waerden numbers of 3term arithmetic progressions.
Antvan der Waerden numbers of 3term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The antvan der Waerden number, denoted by aw([n], k), s the smallest
More informationSupplementary material: Margin based PU Learning. Matrix Concentration Inequalities
Supplementary materal: Margn based PU Learnng We gve the complete proofs of Theorem and n Secton We frst ntroduce the wellknown concentraton nequalty, so the covarance estmator can be bounded Then we
More informationGames of Threats. Elon Kohlberg Abraham Neyman. Working Paper
Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18023 Copyrght 2017
More informationA particle in a state of uniform motion remain in that state of motion unless acted upon by external force.
The fundamental prncples of classcal mechancs were lad down by Galleo and Newton n the 16th and 17th centures. In 1686, Newton wrote the Prncpa where he gave us three laws of moton, one law of gravty,
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationSelfcomplementing permutations of kuniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Selfcomplementng permutatons of kunform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
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 informationLine Drawing and Clipping Week 1, Lecture 2
CS 43 Computer Graphcs I Lne Drawng and Clppng Week, Lecture 2 Davd Breen, Wllam Regl and Maxm Peysakhov Geometrc and Intellgent Computng Laboratory Department of Computer Scence Drexel Unversty http://gcl.mcs.drexel.edu
More informationBayesian predictive Configural Frequency Analysis
Psychologcal Test and Assessment Modelng, Volume 54, 2012 (3), 285292 Bayesan predctve Confgural Frequency Analyss Eduardo GutérrezPeña 1 Abstract Confgural Frequency Analyss s a method for cellwse
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 615086 provdes approxmaton formulas for the PF for smple
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
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 informationThe Second AntiMathima on Game Theory
The Second AntMathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2player 2acton zerosum games 2. 2player
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationLecture 3 Stat102, Spring 2007
Lecture 3 Stat0, Sprng 007 Chapter 3. 3.: Introducton to regresson analyss Lnear regresson as a descrptve technque The leastsquares equatons Chapter 3.3 Samplng dstrbuton of b 0, b. Contnued n net lecture
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationP exp(tx) = 1 + t 2k M 2k. k N
1. Subgaussan tals Defnton. Say that a random varable X has a subgaussan dstrbuton wth scale factor σ< f P exp(tx) exp(σ 2 t 2 /2) for all real t. For example, f X s dstrbuted N(,σ 2 ) then t s subgaussan.
More informationThe Feynman path integral
The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space
More informationSupplement to Clustering with Statistical Error Control
Supplement to Clusterng wth Statstcal Error Control Mchael Vogt Unversty of Bonn Matthas Schmd Unversty of Bonn In ths supplement, we provde the proofs that are omtted n the paper. In partcular, we derve
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the faketest data; fxed
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
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 informationStat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j
Stat 642, Lecture notes for 01/27/05 18 Rate Standardzaton Contnued: Note that f T n t where T s the cumulatve followup tme and n s the number of subjects at rsk at the mdpont or nterval, and d s the
More informationarxiv: v2 [math.co] 27 Nov 2008
Stablty results for unquely determned sets from two drectons n dscrete tomography Brgt van Dalen arxv:0800316v [mathco] 7 Nov 008 Mathematsch Insttuut, Unverstet Leden, Nels Bohrweg 1, 333 CA Leden, The
More informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan nontrval lower bound for the set A/A, where A s a subset of the nterval [1,
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
KangweonKyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROWACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationSampling Theory MODULE VII LECTURE  23 VARYING PROBABILITY SAMPLING
Samplng heory MODULE VII LECURE  3 VARYIG PROBABILIY SAMPLIG DR. SHALABH DEPARME OF MAHEMAICS AD SAISICS IDIA ISIUE OF ECHOLOGY KAPUR he smple random samplng scheme provdes a random sample where every
More informationApproximate Smallest Enclosing Balls
Chapter 5 Approxmate Smallest Enclosng Balls 5. Boundng Volumes A boundng volume for a set S R d s a superset of S wth a smple shape, for example a box, a ball, or an ellpsod. Fgure 5.: Boundng boxes Q(P
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationCONDUCTORS AND INSULATORS
CONDUCTORS AND INSULATORS We defne a conductor as a materal n whch charges are free to move over macroscopc dstances.e., they can leave ther nucle and move around the materal. An nsulator s anythng else.
More informationPhysics 5153 Classical Mechanics. Principle of Virtual Work1
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 informationChapter 8. Potential Energy and Conservation of Energy
Chapter 8 Potental Energy and Conservaton of Energy In ths chapter we wll ntroduce the followng concepts: Potental Energy Conservatve and nonconservatve forces Mechancal Energy Conservaton of Mechancal
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 informationStrong Markov property: Same assertion holds for stopping times τ.
Brownan moton Let X ={X t : t R + } be a realvalued stochastc process: a famlty of real random varables all defned on the same probablty space. Defne F t = nformaton avalable by observng the process up
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture  30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
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 informationEXPANSIVE MAPPINGS. by W. R. Utz
Volume 3, 978 Pages 6 http://topology.auburn.edu/tp/ EXPANSIVE MAPPINGS by W. R. Utz Topology Proceedngs Web: http://topology.auburn.edu/tp/ Mal: Topology Proceedngs Department of Mathematcs & Statstcs
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationAmusing Properties of Odd Numbers Derived From Valuated Binary Tree
IOSR Journal of Mathematcs (IOSRJM) eiss: 78578, piss: 19765X. Volume 1, Issue 6 Ver. V (ov.  Dec.016), PP 557 www.osrjournals.org Amusng Propertes of Odd umbers Derved From Valuated Bnary Tree
More informationComplex Numbers Alpha, Round 1 Test #123
Complex Numbers Alpha, Round Test #3. Wrte your 6dgt ID# n the I.D. NUMBER grd, leftjustfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3dgt Test
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationWorkshop: Approximating energies and wave functions Quantum aspects of physical chemistry
Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:55: Copyrght 25 Dan Dll (dan@bu.edu) Department
More informationTHE CURRENT BALANCE Physics 258/259
DSH 1988, 005 THE CURRENT BALANCE Physcs 58/59 The tme average force between two parallel conductors carryng an alternatng current s measured by balancng ths force aganst the gravtatonal force on a set
More informationChapter 8 Indicator Variables
Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationSmarandacheZero Divisors in Group Rings
SmarandacheZero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zerodvsors n group rngs had become nterestng problem snce 1940 wth the
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationCONJUGACY IN THOMPSON S GROUP F. 1. Introduction
CONJUGACY IN THOMPSON S GROUP F NICK GILL AND IAN SHORT Abstract. We complete the program begun by Brn and Squer of charactersng conjugacy n Thompson s group F usng the standard acton of F as a group of
More informationOn the number of regions in an mdimensional space cut by n hyperplanes
6 On the nuber of regons n an densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general
More informationLecture 2: GramSchmidt Vectors and the LLL Algorithm
NYU, Fall 2016 Lattces Mn Course Lecture 2: GramSchmdt Vectors and the LLL Algorthm Lecturer: Noah StephensDavdowtz 2.1 The Shortest Vector Problem In our last lecture, we consdered short solutons to
More informationExperiment 1 Mass, volume and density
Experment 1 Mass, volume and densty Purpose 1. Famlarze wth basc measurement tools such as verner calper, mcrometer, and laboratory balance. 2. Learn how to use the concepts of sgnfcant fgures, expermental
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUMRATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sumrate
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 19982015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More informationTimeVarying Systems and Computations Lecture 6
TmeVaryng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationLecture Note 3. Eshelby s Inclusion II
ME340B Elastcty of Mcroscopc Structures Stanford Unversty Wnter 004 Lecture Note 3. Eshelby s Incluson II Chrs Wenberger and We Ca c All rghts reserved January 6, 004 Contents 1 Incluson energy n an nfnte
More informationOn the smoothness and the totally strong properties for nearness frames
Int. Sc. Technol. J. Namba Vol 1, Issue 1, 2013 On the smoothness and the totally strong propertes for nearness frames Martn. M. Mugoch Department of Mathematcs, Unversty of Namba 340 Mandume Ndemufayo
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 informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationEcon Statistical Properties of the OLS estimator. Sanjaya DeSilva
Econ 39  Statstcal Propertes of the OLS estmator Sanjaya DeSlva September, 008 1 Overvew Recall that the true regresson model s Y = β 0 + β 1 X + u (1) Applyng the OLS method to a sample of data, we estmate
More informationA PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY.
Proceedngs of the th Brazlan Congress of Thermal Scences and Engneerng  ENCIT 006 Braz. Soc. of Mechancal Scences and Engneerng  ABCM, Curtba, Brazl, Dec. 58, 006 A PROCEDURE FOR SIMULATING THE NONLINEAR
More information8.592J: Solutions for Assignment 7 Spring 2005
8.59J: Solutons for Assgnment 7 Sprng 5 Problem 1 (a) A flament of length l can be created by addton of a monomer to one of length l 1 (at rate a) or removal of a monomer from a flament of length l + 1
More informationDSGA 1002 Lecture notes 5 Fall Random processes
DSGA Lecture notes 5 Fall 6 Introducton Random processes Random processes, also known as stochastc processes, allow us to model quanttes that evolve n tme (or space n an uncertan way: the trajectory of
More informationMODELING TRAFFIC LIGHTS IN INTERSECTION USING PETRI NETS
The 3 rd Internatonal Conference on Mathematcs and Statstcs (ICoMS3) Insttut Pertanan Bogor, Indonesa, 56 August 28 MODELING TRAFFIC LIGHTS IN INTERSECTION USING PETRI NETS 1 Deky Adzkya and 2 Subono
More information10. Canonical Transformations Michael Fowler
10. Canoncal Transformatons Mchael Fowler Pont Transformatons It s clear that Lagrange s equatons are correct for any reasonable choce of parameters labelng the system confguraton. Let s call our frst
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multpleregresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationThis chapter illustrates the idea that all properties of the homogeneous electron gas (HEG) can be calculated from electron density.
1 Unform Electron Gas Ths chapter llustrates the dea that all propertes of the homogeneous electron gas (HEG) can be calculated from electron densty. Intutve Representaton of Densty Electron densty n s
More informationMEASUREMENT OF MOMENT OF INERTIA
1. measurement MESUREMENT OF MOMENT OF INERTI The am of ths measurement s to determne the moment of nerta of the rotor of an electrc motor. 1. General relatons Rotatng moton and moment of nerta Let us
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 19982014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More informationChapter 20 Duration Analysis
Chapter 20 Duraton Analyss Duraton: tme elapsed untl a certan event occurs (weeks unemployed, months spent on welfare). Survval analyss: duraton of nterest s survval tme of a subject, begn n an ntal state
More informationCS 468 Lecture 16: Isometry Invariance and Spectral Techniques
CS 468 Lecture 16: Isometry Invarance and Spectral Technques Justn Solomon Scrbe: Evan Gawlk Introducton. In geometry processng, t s often desrable to characterze the shape of an object n a manner that
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mt.edu 6.854J / 18.415J Advanced Algorthms Fall 2008 For nformaton about ctng these materals or our Terms of Use, vst: http://ocw.mt.edu/terms. 18.415/6.854 Advanced Algorthms
More informationkq r 2 2kQ 2kQ (A) (B) (C) (D)
PHYS 1202W MULTIPL CHOIC QUSTIONS QUIZ #1 Answer the followng multple choce questons on the bubble sheet. Choose the best answer, 5 pts each. MC1 An uncharged metal sphere wll (A) be repelled by a charged
More informationExercises of Chapter 2
Exercses of Chapter ChuangCheh Ln Department of Computer Scence and Informaton Engneerng, Natonal Chung Cheng Unversty, MngHsung, Chay 61, Tawan. Exercse.6. Suppose that we ndependently roll two standard
More informationCHAPTER 4. Vector Spaces
man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear
More information