A stochastic model for phylogenetic trees
|
|
- Dorcas Holland
- 5 years ago
- Views:
Transcription
1 A stochastic model for phylogeetic trees by Thomas M. Liggett ad Rialdo B. Schiazi Uiversity of Califoria at Los Ageles, ad Uiversity of Colorado at Colorado Sprigs October 10, 2008 Abstract We propose the followig simple stochastic model for phylogeetic trees. New types are bor ad die accordig to a birth ad death chai. At each birth we associate a fitess to the ew type sampled from a fixed distributio. At each death the type with the smallest fitess is killed. We show that if the birth (i.e. mutatio) rate is subcritical we get a phylogeetic tree cosistet with a iflueza tree (few types at ay give time ad oe domiatig type lastig a log time). Whe the birth rate is supercritical we get a phylogeetic tree cosistet with a HIV tree (may types at ay give time, oe lastig very log). 1 Itroductio The iflueza phylogeetic tree is peculiar i that it is very skiy: oe type domiates for a log time ad ay other type that arises quickly dies out. The the domiatig type suddely dies out ad is immediately replaced by a ew domiatig type. The models proposed so far are very complex ad make may assumptios. See for istace Koelle et al. (2006) ad va Nimwege (2006). We would like to use a simple stochastic model to model such a tree. The other motivatio for this work comes from the compariso betwee iflueza ad HIV phylogeetic trees. A HIV tree is characterized by a radial spread outward from a acestral ode, i sharp cotrast with a iflueza tree. Moreover, Korber et al. (2001) ote that the iflueza virus is less diverse worldwide tha the HIV virus is i Amsterdam aloe. However, both types of trees are supposed to be produced by the same basic mechaism: mutatios. Ca the same mathematical model produce two trees that are so differet? Our simple stochastic model will show a strikig differece i behavior depedig o the mutatio rate. We propose a model that has a birth ad death compoet ad a fitess compoet. For the death ad birth compoet we do the followig. If we have 1 types at a certai time t the there is creatio of a ew type (by mutatio) at rate λ. If there are 2 types the there is Partially supported by NSF grat DMS Partially supported by NSF grat DMS Key words ad phrases: phylogeetic tree, iflueza, HIV, stochastic model 2000 Mathematics Subject Classificatio: 60K35 1
2 death of oe type at rate. If oly oe type is left it caot die. That is, + 1 at rate λ 1 at rate if 2 Moreover, the i-th type that appears is associated to a radom variable F i (the fitess of type i). The radom variables F i are i.i.d. Every time there is a death evet the the type that is killed is the oe with the smallest F i. Sice all that matters is the raks of the fitesses, we might as well take their distributio to be uiform o [0, 1]. We give o specific rule o how to attach a ew type after a birth to existig types (i order to costruct a tree). Our results do ot deped o such a rule. Two atural possibilities are to either attach the ew type to the type which has the maximum fitess or to a type take at radom. Theorem 1. Take α (0, 1). If λ 1, the lim P(maximal types at times αt ad t are the same) = α, t while if λ > 1, the this limit is 0. We see that if λ < 1, the domiatig type (i.e. the fittest type) at time t has likely bee preset for a time of order t ad at ay give time there will ot be may types. This is cosistet with the observed structure of a iflueza tree. O the other had, if λ > 1, the the domiatig type at time t has likely bee preset for a time of order shorter tha t ad at ay give time there will be may types. This is cosistet with a HIV tree. 2 Proof of Theorem 1 The proof divides ito three cases, depedig o whether the birth ad death chai is positive recurret, ull recurret, or trasiet. We preset them i order of difficulty. 2.1 Case λ < 1 Let F 0,F 1,... be i.i.d. rvs with the type distributio, τ 1,τ 2,... be the (cotiuous) times betwee successive visits of the chai to 1, T = τ τ, σ 1,σ 2,... be the umber of ew types itroduced i cycles betwee successive visits to 1, ad S = 1 + σ σ. Note that the τ s ad σ s are ot idepedet of each other, but the sequece (τ 1,σ 1 ),(τ 2,σ 2 ),... is i.i.d. ad idepedet of the F sequece. Defie the usual reewal process N(t) correspodig to the τ s by {N(t) = } = {T t < T +1 }. For 0 < s < t, recallig that T N(t) t < T N(t)+1, ad otig that the maximal type is icreasig i time, we see that lies betwee P(maximal types at times s ad t are the same,n(s) < N(t)) (1) P(maximal types at times T N(s) ad T N(t)+1 are the same,n(s) < N(t)) 2
3 ad P(maximal types at times T N(s)+1 ad T N(t) are the same,n(s) < N(t)). Let F be the σ-algebra geerated by (τ 1,σ 1 ),(τ 2,σ 2 ),... The for k l, sice the F sequece is i.i.d. ad idepedet of F, P(maximal types at times T k ad T l are the same F) = S k S l. Therefore, sice N(s) ad N(t) are F measurable, (1) lies betwee [ ] [ ] SN(s) SN(s)+1 E,N(s) < N(t) ad E,N(s) < N(t). (2) S N(t)+1 S N(t) If λ < 1, the Eτ <, ad the reewal theorem gives N(s)/s 1/Eτ a.s., while the strog law of large umbers gives S N(s) /N(s) Eσ a.s., so that S N(s) /s Eσ/Eτ a.s. It follows that for α < 1, by the bouded covergece theorem, lim P(maximal types at real times αt ad t are the same) = α. (3) t This completes the proof of Theorem 1 i the subcritical case. 2.2 Case λ > 1. Defie the τ s ad σ s as above, except that ow, the cycles used are betwee the successive times the chai reaches a ew high. I other words, T is the hittig time of + 1, ad S is the umber of ew types see up to time T. Of course, the σ s ad τ s are o loger idetically distributed. However, (τ 1,σ 1 ),(τ 2,σ 2 ),... are idepedet. Let (Z i ) i 1 be a discrete time radom walk startig at 0 that goes to the right with probability λ/(λ + 1) ad to the left with probability 1/(λ + 1). For every 1, let Z i, be a discrete time radom walk startig at 0 with the same rules of evolutio as Z i except that the radom walk Z i, has a reflectig barrier at + 1. For every 1, the two radom walks Z i ad Z i, are coupled so that they move together util (if ever) they hit + 1 ad thereafter we still couple them so that Z i Z i, for every i 0. Let U ad U be the hittig times of 1 for the radom walks Z i ad Z i,, respectively. Let X 1,X 2,... be a sequece of i.i.d. uit expoetial radom variables that are idepedet of the radom walks Z i ad Z i,. Defie L = U i=1 X i λ + 1. Lemma 2. The first two momets of τ coverge to the correspodig momets of L. Proof of Lemma 2. Usig the fact if X is expoetially distributed with rate 1 the X/λ is expoetially distributed with rate λ, we have that τ has the same distributio as Y = U i=1 X i ( + Z i, )(λ + 1). 3
4 Note that sice our claim is about the distributio of τ oly, we may use the same sequece X i for every 1. Let χ A deote the idicator fuctio of the evet A. Take 0 < ǫ < 1 ad defie A = A(,ǫ) = {Z i < ǫ for some i 1}. Note that o A c, Z i, = Z i for all i 1 ad therefore U = U. Hece, Therefore, Y L χ A c = U X i λ Z i χ A c. i=1 Y L χ A c ǫ 1 ǫ L provided that ǫ( + 2) 1. (This restrictio is eeded to cover the case i = U.) O the other had Y L χ A (Y + L)χ A ( + 1)Lχ A, where the secod iequality comes from U U. We the have ( ) 2 ǫ E Y L ( 1 ǫ )2 E(L 2 ) + ( + 1) 2 E(L 2 χ A ). By the Cauchy-Schwarz iequality (all momets of L exist) we have E(L 2 χ A ) E(L 4 ) 1/2 P(A) 1/2. Sice for fixed ǫ > 0, P(A(,ǫ)) coverges to 0 expoetially fast as a fuctio of, ( ) 2 ǫ lim sup E Y L ( 1 ǫ )2 E(L 2 ). ( 2 We ow let ǫ go to 0 ad this proves that E Y L) coverges to 0. Hece, the first two momets of Y coverge to the correspodig momets of L. This last claim oly ivolves the distributio of Y so the first two momets of τ also coverge to the correspodig momets of L. Lemma 3. Assume that λ > 1. If c > λ 1 the exp( ct)n(t) coverges a.s. to 0. If c < λ 1 the exp( ct)n(t) coverges a.s. to. Proof of Lemma 3. By Lemma 1 the variace of τ is asymptotic to V ar(l)/ 2. This implies the a.s. covergece of the radom series (τ Eτ ) (see for istace Corollary 47.3 i Port (1994)). Therefore the partial sums coverge a.s. ad so T E(T ) log coverges a.s. to 0. Sice E(τ ) coverges to E(L) we have that E(T )/log coverges to E(L) ad therefore T /log coverges to E(L) a.s. Now use {N(t) } = {T t} to show that exp( ct)n(t) 4
5 coverges a.s. to 0 if c > 1/E(L) ad coverges to ifiity if c < 1/E(L). We ow compute E(L). By Wald s idetity E(L) = E(U) λ + 1. We use that E(U) = λ + 1 λ 1 (see (13.22) i Bhattacharya ad Waymire (1990), for istace) to get that E(L) = 1/(λ 1). We are ow ready to complete the proof of Theorem 1 i the supercritical case. First ote that a ew type appears every time there is a birth. Therefore, σ is the umber of steps to the right of the radom walk Z i, stopped at 1. That is, σ is (1 + U )/2. We ow show that U coverges a.s to U. Let δ > 0 we have P( U U > δ) P(U > U ) P(Z i = + 1 for some i 1). As oted before the last probability decays expoetially with. Therefore, P( U U > δ) <. 1 A easy applicatio of Borel-Catelli Lemma implies that U coverges a.s. to U. Sice U U the Domiated Covergece Theorem implies that, for every k 1 the kth momet of σ coverges to the kth momet of (1 + U)/2. I particular, V ar(σ ) is a bouded sequece. This is eough to prove that 1 (σ i E(σ i )) coverges a.s. to 0, i=1 see for istace Propositio i Port (1994). Sice E(σ ) is a coverget sequece we get that S / coverges a.s. to the limit of E(σ ). Sice N(t) a.s., this strog law of large umbers gives that S N(t) /N(t) coverges to the limitig expectatio of σ. This together with Lemma 2 shows that the two terms i (2) coverge to 0 whe we let s = αt ad t goes to ifiity. The proof of Theorem 1 i the supercritical case is complete. 2.3 Case λ = 1. Let φ k (u) be the Laplace trasform of the hittig time of 1 for the cotiuous time birth ad death chai defied i Sectio 1 ad startig at k 1. (By the Laplace trasform of a oegative radom variable W, we mea Ee uw,u 0.) The φ 1 1, ad for k 2, φ k (u) = 2k [ 1 2k + u 2 φ k 1(u) + 1 ] 2 φ k+1(u) (4) sice the holdig time at k is expoetial of rate 2k, ad the the chai moves to k 1 or k + 1 with probabilities 1 2 each. The Laplace trasform of τ i from part I above is give by Ee uτ i = u φ 2(u). 5
6 Let ψ k (u) be the Laplace trasform of the hittig time of k 1 for the cotiuous time birth ad death chai startig at k. The φ (u) = ψ k (u). (5) k=2 Now let V be the hittig time of 1 for the discrete time simple symmetric radom walk Z k startig at 0, ad let X i be i.i.d. uit expoetials. The coditioed o the Z k process, the hittig time of 1 startig at for the cotiuous time chai is distributed as V 1 k=0 Therefore, sice Ee ux k = 1 1+u e u, 1 X k 1 V 1 + Z k k=0 X k. ψ (u) Ee uv/ = ψ(u/), (6) where ψ is the Laplace trasform of V. By page 155 of Durrett (2004), P(V > 2) 1/ π. By a Tauberia theorem (see Theorem 2 i Sectio XIII.5 of Feller (1971)) this implies ψ(u) 1 c u as u 0 for some costat c. It follows that by adjustig the costat, we ca assume that ψ(u) e c u for 0 u 1. Combiig this with (5) ad (6) gives (agai for a ew value of c, possibly i each lie) ad φ (u) Now rewrite (4) i the form ad the sum to get [ ψ (u) exp c k=2 u ], 0 u, (7) [ ] u exp c e c u, 0 u 2. (8) k [φ k 1 (u) φ k (u)] [φ k (u) φ k+1 (u)] = u k φ k(u), 1 φ 2 (u) = u k=2 φ k (u) k + [φ (u) φ +1 (u)], 2. (9) Takig u 0 ad a/u, igorig the last term i (9) (which is oegative) ad usig (8), we see that 1 φ 2 (u) lim if u 0 ulog u a e c. Sice this holds for all a > 0, it follows that lim if u 0 1 φ 2 (u) ulog u 1. 6
7 We ow tur to the lim sup. Observe that By (7) φ (u) φ +1 (u) = φ (u)(1 ψ +1 (u)) 1 ψ +1 (u). φ (u) φ +1 (u) 1 e c u/(+1) c u/( + 1). We use this last iequality i (9) as well as φ k (u) 1 to get Takig u 0 ad 1/u, 1 φ 2 (u) u lim sup u 0 k=2 1 k + c u/( + 1). 1 φ 2 (u) ulog u 1. Therefore φ 2 (u), ad hece Ee uτ i, are asymptotic to 1 + ulog u as u 0. It follows that [ lim E exp u T ] = e u, log so that T log 1 i probability. Sice the evets N(t) ad T t are the same, it follows that N(t) log t t 1 (10) i probability as t. Now, S / 2 coverges i distributio to a oe sided stable law of idex 1 2 (see Theorem (7.7) i Durrett (2004)). By (10), it follows that S N(t) /N(t) 2 also has this distributioal limit. (Note that idepedece betwee the σ s ad τ s is ot required here, which is good sice they are highly depedet. All that is eeded is that the limit i (10) is costat ad that both S ad N(t) are mootoe.) So, the limit i (3) is E(Y α /Y 1 ) for the correspodig stable process. This is α. To see this, it is eough to check it for ratioal α. If α = m/, this boils dow to the simple fact that if V 1,...,V are i.i.d. ad positive, the V i E = 1 V V. Refereces R.N. Bhattacharya ad E.C. Waymire (1990) Stochastic Processes with Applicatios. Wiley. R. Durrett (2004) Probability: Theory ad Examples (3rd editio). Duxbury press. 7
8 W. Feller (1971) A Itroductio to Probability Theory ad its Applicatios, Volume 2 (secod editio). Wiley. B. Korber, B. Gasche, K. Yusim et al. (2001) Evolutioary ad immuological implicatios of cotemporary HIV-1 variatio. British Medical Bulleti 58, K.Koelle, S. Cobey, B. Grefell ad M. Pascual (2006) Epochal evolutio shapes the phylodyamics of iterpademic iflueza A (H3N2) i Humas. Sciece vol. 314, E. va Nimwege (2006). Iflueza escapes immuity alog eutral etworks. Sciece vol. 314, S. C. Port (1994). Theoretical Probability for Applicatios. Wiley. 8
Convergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationNotes 19 : Martingale CLT
Notes 9 : Martigale CLT Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: [Bil95, Chapter 35], [Roc, Chapter 3]. Sice we have ot ecoutered weak covergece i some time, we first recall
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationSelf-normalized deviation inequalities with application to t-statistic
Self-ormalized deviatio iequalities with applicatio to t-statistic Xiequa Fa Ceter for Applied Mathematics, Tiaji Uiversity, 30007 Tiaji, Chia Abstract Let ξ i i 1 be a sequece of idepedet ad symmetric
More informationECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002
ECE 330:541, Stochastic Sigals ad Systems Lecture Notes o Limit Theorems from robability Fall 00 I practice, there are two ways we ca costruct a ew sequece of radom variables from a old sequece of radom
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More information2.1. Convergence in distribution and characteristic functions.
3 Chapter 2. Cetral Limit Theorem. Cetral limit theorem, or DeMoivre-Laplace Theorem, which also implies the wea law of large umbers, is the most importat theorem i probability theory ad statistics. For
More informationNotes 5 : More on the a.s. convergence of sums
Notes 5 : More o the a.s. covergece of sums Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: Dur0, Sectios.5; Wil9, Sectio 4.7, Shi96, Sectio IV.4, Dur0, Sectio.. Radom series. Three-series
More informationSolutions to HW Assignment 1
Solutios to HW: 1 Course: Theory of Probability II Page: 1 of 6 Uiversity of Texas at Austi Solutios to HW Assigmet 1 Problem 1.1. Let Ω, F, {F } 0, P) be a filtered probability space ad T a stoppig time.
More information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
More informationAsymptotic distribution of products of sums of independent random variables
Proc. Idia Acad. Sci. Math. Sci. Vol. 3, No., May 03, pp. 83 9. c Idia Academy of Scieces Asymptotic distributio of products of sums of idepedet radom variables YANLING WANG, SUXIA YAO ad HONGXIA DU ollege
More informationIntroduction to Probability. Ariel Yadin
Itroductio to robability Ariel Yadi Lecture 2 *** Ja. 7 ***. Covergece of Radom Variables As i the case of sequeces of umbers, we would like to talk about covergece of radom variables. There are may ways
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More information1 Convergence in Probability and the Weak Law of Large Numbers
36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationLecture 3 : Random variables and their distributions
Lecture 3 : Radom variables ad their distributios 3.1 Radom variables Let (Ω, F) ad (S, S) be two measurable spaces. A map X : Ω S is measurable or a radom variable (deoted r.v.) if X 1 (A) {ω : X(ω) A}
More informationDistribution of Random Samples & Limit theorems
STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to
More informationST5215: Advanced Statistical Theory
ST525: Advaced Statistical Theory Departmet of Statistics & Applied Probability Tuesday, September 7, 2 ST525: Advaced Statistical Theory Lecture : The law of large umbers The Law of Large Numbers The
More informationLecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n.
Radom Walks ad Browia Motio Tel Aviv Uiversity Sprig 20 Lecture date: Mar 2, 20 Lecture 4 Istructor: Ro Peled Scribe: Lira Rotem This lecture deals primarily with recurrece for geeral radom walks. We preset
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More informationRegression with an Evaporating Logarithmic Trend
Regressio with a Evaporatig Logarithmic Tred Peter C. B. Phillips Cowles Foudatio, Yale Uiversity, Uiversity of Aucklad & Uiversity of York ad Yixiao Su Departmet of Ecoomics Yale Uiversity October 5,
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece
More informationMAXIMAL INEQUALITIES AND STRONG LAW OF LARGE NUMBERS FOR AANA SEQUENCES
Commu Korea Math Soc 26 20, No, pp 5 6 DOI 0434/CKMS20265 MAXIMAL INEQUALITIES AND STRONG LAW OF LARGE NUMBERS FOR AANA SEQUENCES Wag Xueju, Hu Shuhe, Li Xiaoqi, ad Yag Wezhi Abstract Let {X, } be a sequece
More informationEntropy Rates and Asymptotic Equipartition
Chapter 29 Etropy Rates ad Asymptotic Equipartitio Sectio 29. itroduces the etropy rate the asymptotic etropy per time-step of a stochastic process ad shows that it is well-defied; ad similarly for iformatio,
More informationLECTURE 11 LINEAR PROCESSES III: ASYMPTOTIC RESULTS
PRIL 7, 9 where LECTURE LINER PROCESSES III: SYMPTOTIC RESULTS (Phillips ad Solo (99) ad Phillips Lecture Notes o Statioary ad Nostatioary Time Series) I this lecture, we discuss the LLN ad CLT for a liear
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 6 9/23/203 Browia motio. Itroductio Cotet.. A heuristic costructio of a Browia motio from a radom walk. 2. Defiitio ad basic properties
More informationLecture Chapter 6: Convergence of Random Sequences
ECE5: Aalysis of Radom Sigals Fall 6 Lecture Chapter 6: Covergece of Radom Sequeces Dr Salim El Rouayheb Scribe: Abhay Ashutosh Doel, Qibo Zhag, Peiwe Tia, Pegzhe Wag, Lu Liu Radom sequece Defiitio A ifiite
More informationRandom Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.
Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)
More informationMi-Hwa Ko and Tae-Sung Kim
J. Korea Math. Soc. 42 2005), No. 5, pp. 949 957 ALMOST SURE CONVERGENCE FOR WEIGHTED SUMS OF NEGATIVELY ORTHANT DEPENDENT RANDOM VARIABLES Mi-Hwa Ko ad Tae-Sug Kim Abstract. For weighted sum of a sequece
More informationn=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n
Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio
More informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationSolution to Chapter 2 Analytical Exercises
Nov. 25, 23, Revised Dec. 27, 23 Hayashi Ecoometrics Solutio to Chapter 2 Aalytical Exercises. For ay ε >, So, plim z =. O the other had, which meas that lim E(z =. 2. As show i the hit, Prob( z > ε =
More information1 = δ2 (0, ), Y Y n nδ. , T n = Y Y n n. ( U n,k + X ) ( f U n,k + Y ) n 2n f U n,k + θ Y ) 2 E X1 2 X1
8. The cetral limit theorems 8.1. The cetral limit theorem for i.i.d. sequeces. ecall that C ( is N -separatig. Theorem 8.1. Let X 1, X,... be i.i.d. radom variables with EX 1 = ad EX 1 = σ (,. Suppose
More informationIntroduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT
Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory
More informationThis section is optional.
4 Momet Geeratig Fuctios* This sectio is optioal. The momet geeratig fuctio g : R R of a radom variable X is defied as g(t) = E[e tx ]. Propositio 1. We have g () (0) = E[X ] for = 1, 2,... Proof. Therefore
More informationLecture 2: Concentration Bounds
CSE 52: Desig ad Aalysis of Algorithms I Sprig 206 Lecture 2: Cocetratio Bouds Lecturer: Shaya Oveis Ghara March 30th Scribe: Syuzaa Sargsya Disclaimer: These otes have ot bee subjected to the usual scrutiy
More informationProbability and Random Processes
Probability ad Radom Processes Lecture 5 Probability ad radom variables The law of large umbers Mikael Skoglud, Probability ad radom processes 1/21 Why Measure Theoretic Probability? Stroger limit theorems
More informationRandom Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices
Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio
More information2.2. Central limit theorem.
36.. Cetral limit theorem. The most ideal case of the CLT is that the radom variables are iid with fiite variace. Although it is a special case of the more geeral Lideberg-Feller CLT, it is most stadard
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationComplete Convergence for Asymptotically Almost Negatively Associated Random Variables
Applied Mathematical Scieces, Vol. 12, 2018, o. 30, 1441-1452 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.810142 Complete Covergece for Asymptotically Almost Negatively Associated Radom
More informationLecture 12: Subadditive Ergodic Theorem
Statistics 205b: Probability Theory Sprig 2003 Lecture 2: Subadditive Ergodic Theorem Lecturer: Jim Pitma Scribe: Soghwai Oh 2. The Subadditive Ergodic Theorem This theorem is due
More informationGeneralized Semi- Markov Processes (GSMP)
Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet
More informationStochastic Simulation
Stochastic Simulatio 1 Itroductio Readig Assigmet: Read Chapter 1 of text. We shall itroduce may of the key issues to be discussed i this course via a couple of model problems. Model Problem 1 (Jackso
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 3 9//203 Large deviatios Theory. Cramér s Theorem Cotet.. Cramér s Theorem. 2. Rate fuctio ad properties. 3. Chage of measure techique.
More informationSTAT Homework 1 - Solutions
STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better
More informationECE 901 Lecture 12: Complexity Regularization and the Squared Loss
ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality
More informationA Note on the Kolmogorov-Feller Weak Law of Large Numbers
Joural of Mathematical Research with Applicatios Mar., 015, Vol. 35, No., pp. 3 8 DOI:10.3770/j.iss:095-651.015.0.013 Http://jmre.dlut.edu.c A Note o the Kolmogorov-Feller Weak Law of Large Numbers Yachu
More informationMath 216A Notes, Week 5
Math 6A Notes, Week 5 Scribe: Ayastassia Sebolt Disclaimer: These otes are ot early as polished (ad quite possibly ot early as correct) as a published paper. Please use them at your ow risk.. Thresholds
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationRademacher Complexity
EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for
More informationGamma Distribution and Gamma Approximation
Gamma Distributio ad Gamma Approimatio Xiaomig Zeg a Fuhua (Frak Cheg b a Xiame Uiversity, Xiame 365, Chia mzeg@jigia.mu.edu.c b Uiversity of Ketucky, Leigto, Ketucky 456-46, USA cheg@cs.uky.edu Abstract
More informationTR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT
TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the
More informationSeries III. Chapter Alternating Series
Chapter 9 Series III With the exceptio of the Null Sequece Test, all the tests for series covergece ad divergece that we have cosidered so far have dealt oly with series of oegative terms. Series with
More informationPower series are analytic
Power series are aalytic Horia Corea 1 1 The expoetial ad the logarithm For every x R we defie the fuctio give by exp(x) := 1 + x + x + + x + = x. If x = 0 we have exp(0) = 1. If x 0, cosider the series
More informationPower series are analytic
Power series are aalytic Horia Corea 1 1 Fubii s theorem for double series Theorem 1.1. Let {α m }, be a real sequece idexed by two idices. Assume that the series α m is coverget for all ad C := ( α m
More informationPrecise Rates in Complete Moment Convergence for Negatively Associated Sequences
Commuicatios of the Korea Statistical Society 29, Vol. 16, No. 5, 841 849 Precise Rates i Complete Momet Covergece for Negatively Associated Sequeces Dae-Hee Ryu 1,a a Departmet of Computer Sciece, ChugWoo
More informationFirst Year Quantitative Comp Exam Spring, Part I - 203A. f X (x) = 0 otherwise
First Year Quatitative Comp Exam Sprig, 2012 Istructio: There are three parts. Aswer every questio i every part. Questio I-1 Part I - 203A A radom variable X is distributed with the margial desity: >
More information6 Infinite random sequences
Tel Aviv Uiversity, 2006 Probability theory 55 6 Ifiite radom sequeces 6a Itroductory remarks; almost certaity There are two mai reasos for eterig cotiuous probability: ifiitely high resolutio; edless
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationON THE RATE Of CONVERGENCE for SOME STRONG APPROXIMATION THEOREMS IN EXTREMAL STATISTICS. Dietma:r Pfe;i.fer
ON THE RATE Of CONVERGENCE for SOME STRONG APPROXIMATION THEOREMS IN EXTREMAL STATISTICS Dietma:r Pfe;i.fer Abstract. Strog approximatio theorems for the logarithms of record ad iter-record times of a
More informationSome Tauberian theorems for weighted means of bounded double sequences
A. Ştiiţ. Uiv. Al. I. Cuza Iaşi. Mat. N.S. Tomul LXIII, 207, f. Some Tauberia theorems for weighted meas of bouded double sequeces Cemal Bele Received: 22.XII.202 / Revised: 24.VII.203/ Accepted: 3.VII.203
More informationfor all x ; ;x R. A ifiite sequece fx ; g is said to be ND if every fiite subset X ; ;X is ND. The coditios (.) ad (.3) are equivalet for =, but these
sub-gaussia techiques i provig some strog it theorems Λ M. Amii A. Bozorgia Departmet of Mathematics, Faculty of Scieces Sista ad Baluchesta Uiversity, Zaheda, Ira Amii@hamoo.usb.ac.ir, Fax:054446565 Departmet
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationPhysics 116A Solutions to Homework Set #1 Winter Boas, problem Use equation 1.8 to find a fraction describing
Physics 6A Solutios to Homework Set # Witer 0. Boas, problem. 8 Use equatio.8 to fid a fractio describig 0.694444444... Start with the formula S = a, ad otice that we ca remove ay umber of r fiite decimals
More informationThis exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.
Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the
More informationProbability for mathematicians INDEPENDENCE TAU
Probability for mathematicias INDEPENDENCE TAU 2013 28 Cotets 3 Ifiite idepedet sequeces 28 3a Idepedet evets........................ 28 3b Idepedet radom variables.................. 33 3 Ifiite idepedet
More informationRandom assignment with integer costs
Radom assigmet with iteger costs Robert Parviaie Departmet of Mathematics, Uppsala Uiversity P.O. Box 480, SE-7506 Uppsala, Swede robert.parviaie@math.uu.se Jue 4, 200 Abstract The radom assigmet problem
More informationON CONVERGENCE OF BASIC HYPERGEOMETRIC SERIES. 1. Introduction Basic hypergeometric series (cf. [GR]) with the base q is defined by
ON CONVERGENCE OF BASIC HYPERGEOMETRIC SERIES TOSHIO OSHIMA Abstract. We examie the covergece of q-hypergeometric series whe q =. We give a coditio so that the radius of the covergece is positive ad get
More informationMath 2784 (or 2794W) University of Connecticut
ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationApplication to Random Graphs
A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let
More information1 The Haar functions and the Brownian motion
1 The Haar fuctios ad the Browia motio 1.1 The Haar fuctios ad their completeess The Haar fuctios The basic Haar fuctio is 1 if x < 1/2, ψx) = 1 if 1/2 x < 1, otherwise. 1.1) It has mea zero 1 ψx)dx =,
More informationA Hadamard-type lower bound for symmetric diagonally dominant positive matrices
A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of
More informationEE 4TM4: Digital Communications II Probability Theory
1 EE 4TM4: Digital Commuicatios II Probability Theory I. RANDOM VARIABLES A radom variable is a real-valued fuctio defied o the sample space. Example: Suppose that our experimet cosists of tossig two fair
More informationEntropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP
Etropy ad Ergodic Theory Lecture 5: Joit typicality ad coditioal AEP 1 Notatio: from RVs back to distributios Let (Ω, F, P) be a probability space, ad let X ad Y be A- ad B-valued discrete RVs, respectively.
More informationChapter 5. Inequalities. 5.1 The Markov and Chebyshev inequalities
Chapter 5 Iequalities 5.1 The Markov ad Chebyshev iequalities As you have probably see o today s frot page: every perso i the upper teth percetile ears at least 1 times more tha the average salary. I other
More informationSolution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1
Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationWeighted Approximation by Videnskii and Lupas Operators
Weighted Approximatio by Videsii ad Lupas Operators Aif Barbaros Dime İstabul Uiversity Departmet of Egieerig Sciece April 5, 013 Aif Barbaros Dime İstabul Uiversity Departmet Weightedof Approximatio Egieerig
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More information11 THE GMM ESTIMATION
Cotets THE GMM ESTIMATION 2. Cosistecy ad Asymptotic Normality..................... 3.2 Regularity Coditios ad Idetificatio..................... 4.3 The GMM Iterpretatio of the OLS Estimatio.................
More informationOn the convergence rates of Gladyshev s Hurst index estimator
Noliear Aalysis: Modellig ad Cotrol, 2010, Vol 15, No 4, 445 450 O the covergece rates of Gladyshev s Hurst idex estimator K Kubilius 1, D Melichov 2 1 Istitute of Mathematics ad Iformatics, Vilius Uiversity
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More informationInformation Theory and Statistics Lecture 4: Lempel-Ziv code
Iformatio Theory ad Statistics Lecture 4: Lempel-Ziv code Łukasz Dębowski ldebowsk@ipipa.waw.pl Ph. D. Programme 203/204 Etropy rate is the limitig compressio rate Theorem For a statioary process (X i)
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationExpectation and Variance of a random variable
Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationAsymptotic Results for the Linear Regression Model
Asymptotic Results for the Liear Regressio Model C. Fli November 29, 2000 1. Asymptotic Results uder Classical Assumptios The followig results apply to the liear regressio model y = Xβ + ε, where X is
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationLet us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.
Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,
More information