A CENTRAL LIMIT THEOREM FOR RANDOM CLOSED GEODESICS: PROOF OF THE CHAS LI MASKIT CONJECTURE

Size: px
Start display at page:

Download "A CENTRAL LIMIT THEOREM FOR RANDOM CLOSED GEODESICS: PROOF OF THE CHAS LI MASKIT CONJECTURE"

Transcription

1 A CENTRAL LIMIT THEOREM FOR RANDOM CLOSED GEODESICS: PROOF OF THE CHAS LI MASKIT CONJECTURE ILYA GEKHTMAN, SAMUEL J. TAYLOR, AND GIULIO TIOZZO Abstract. We prove a cetral limit theorem for the legth of closed geodesics i a hyperbolic pair of pats, thus settlig a cojecture of Chas Li Maskit. Let Σ be a pair of pats with a fixed hyperbolic metric such that each compoet of Σ is a geodesic. Its fudametal group G is a free group o two geerators. Let S be a stadard geeratig set of G i.e., a free basis, ad let g be the word legth of g with respect to S. For each g G, let [g] deote its cojugacy class, ad for ay cojugacy class γ = [g] defie its cojugacy legth γ = g := mi [g]=γ g to be the miimum word legth over all elemets represetig γ. Ay cojugacy class γ is represeted by a closed geodesic i the pair of pats, ad let τγ deote the legth of such geodesic i the hyperbolic metric. Let µ deote the uiform distributio o the set F of cojugacy classes of legth. The goal of this ote is to prove the followig cetral limit theorem: Theorem 1. There exist costats L > 0, σ > 0 such that for ay a, b R with a < b we have τγ L µ γ : σ [a, b] 1 b e x2 2 dx 2π a as. This is the mai cojecture of Chas Li Maskit i [4], motivated by experimetal evidece. The proof combies tools of Chas Lalley [3], Calegari [1], ad the authors [5]. The same techiques ca be used to exted Theorem 1 to all orietable compact hyperbolic surfaces, but we will ot discuss this at the momet. We ote that P. Park has recetly writte up a related result where the uiform distributio o cojugacy classes is replaced by the th step distributio of a simple radom walk o G [7]. Prelimiary results. By costructio we have that Σ is the covex core of H 2 /G, where G acts by isometries as a Schottky group o the hyperbolic plae H 2. Fix a base poit x H 2. The for γ = [g], τγ = τg equals the stable traslatio legth of g o H 2. Hece, oe has the formula see e.g. [6, Propositio 5.8] 1 τg = dgx, x 2gx, g 1 x x + Oδ Date: August 25, Gekhtma is partially supported by NSF grat DMS Taylor is partially supported by NSF grat DMS Tiozzo is partially supported by NSERC ad the Alfred P. Sloa Foudatio. 1

2 2 I. GEKHTMAN, S.J. TAYLOR, AND G. TIOZZO where x, y z deotes the Gromov product, ad A = B + Oδ meas that there is a costat C, which depeds oly o the hyperbolicity costat δ of H 2, such that A B C. Let S be the set of reduced words of legth, ad let J be the set of cyclically reduced words of legth. I particular, these are the same as the set of reduced words of legth whose first letter is ot the iverse of the last letter. Note that i a free group, give a reduced word g, the legth [g] of its cojugacy class equals the miimum legth of the cyclic permutatios of g. Let ν be the uiform distributio o the set S of reduced words of legth, ad λ be the uiform distributio o the set J. A short coutig argumet shows the followig: Lemma 2 [3], Lemma 4.1. Let p : J F be the map from cyclically reduced words to cojugacy classes. The where T V Some basic probability. p λ µ T V 0 as, deotes the total variatio of a measure. Lemma 3. Let A be ay sequece of measurable sets i a probability space, P a sequece of probability measures, ad let B a sequece such that The Proof. By elemetary set theory, lim P B = 1. lim sup P A P A B = 0. P A = P A B + P A \ B P A B + P B c which yields the claim. Lemma 4. Let P be a sequece of probability measures o a Borel space X, ad let F, G : X R be two measurable fuctios. Suppose that P Gx ɛ 0 for ay ɛ > 0, ad let c be a sequece of positive real umbers with lim c = 1. Suppose that there exists a cotiuous fuctio ρ : R R + such that The lim P F x [a, b] = b F x + Gx lim P [a, b] = c a ρx dx. b a ρx dx. Proof. Fix ɛ > 0, ad deote Φ a,b := b a ρx dx. If is sufficietly large, the by settig Y := F +G c we have {F x [a + ɛ, b ɛ] ad Gx ɛ/2} {Y [a, b]}

3 A CENTRAL LIMIT THEOREM FOR RANDOM CLOSED GEODESICS 3 hece usig Lemma 3 lim if P Y [a, b] lim if P F [a + ɛ, b ɛ] ad G ɛ/2 = = lim if P F [a + ɛ, b ɛ] = Φ a+ɛ,b ɛ. O the other had {Y [a, b] ad G ɛ/2} {F [a ɛ, b + ɛ]} hece lim sup P Y [a, b] = lim sup P Y [a, b] ad G ɛ/2 ad takig ɛ 0 completes the proof. lim sup P F [a ɛ, b + ɛ] = Φ a ɛ,b+ɛ The cetral limit theorem for displacemet. The proof of Theorem 1 uses equatio 1: basically, oe proves a CLT for the fuctio dx, gx, ad the shows that the term 2gx, g 1 x x teds to zero. These two facts will suffice by Lemma 4. We will start by establishig the CLT for displacemet. We will use the otatio N a,b := 1 b x2 2π a e 2 dx. Theorem 5. There exist costats L > 0 ad σ > 0 such that for ay a, b R with a < b we have dgx, x L ν σ [a, b] N a,b. This theorem follows promptly from [1, Theorem 3.7.6]. First of all, let us ote that the set of reduced words i the free group is i bijectio with the set of paths i a certai directed graph Γ begiig at a distiguished vertex. Thus, oe ca defie a Markov chai with iitial distributio cocetrated at this vertex. For the details i the case of a geeral hyperbolic group, see [1, 2, 5]. I the particular case of the free group, the graph Γ has a iitial distiguished vertex v 0 ad a vertex for each elemet of S S 1. There is a directed edge from v 0 to each other vertex, ad a directed edge from ay v S S 1 to ay w S S 1 as log as v w 1. All edges are labeled by their termial vertices. Now, if for each vertex we assig the same probability to all the outward poitig edges, oe sees directly from this costructio that the distributio of the th step of the correspodig Markov chai is equal to the uiform distributio o the set of reduced words of legth. Thus, the measure ν is the th -step distributio of the Markov chai, ad oe ca apply thermodyamic formalism as i Calegari [1, Sectio 3.7]. Oe just eeds to verify the Hölder cotiuity assumptios of the observable. I particular, we eed the followig: Lemma 6 [8], Propositio 1; [9], Lemma 1 ad Propositio 3. Let X be a CAT-k metric space, with k > 0, ad let x, y i X. The there exist costats C > 0 ad a > 1 such that for ay z, w X x, z y x, w y Ca z,wx.

4 4 I. GEKHTMAN, S.J. TAYLOR, AND G. TIOZZO The we apply the lemma with z = hx, w = gx, y = s 1 x ad get otig that we eed oly fiitely may values of s x, hx s 1 x x, gx s 1 x Ca gx,hxx for ay h, g G, ay s S. Sice the actio G H 2 is covex cocompact, the quatities gx, hx x ad g, h the Gromov product i the group G are coarsely equal. This shows that we ca apply the followig theorem: Theorem 7 [1], Theorem Let G be a hyperbolic group, ad S a fiite geeratig set for G. Let F : G R be a real-valued fuctio which is Lipschitz i both the left- ad right-ivariat word metrics o G, ad satisfies D s F g D s F h Ca g h for all s i S ad all g, h G, where C > 0, a > 1, ad D s F = F g F sg. The there are costats L ad σ such that if g is the th step of the Markov chai, there is covergece i probability 1/2 F g L N0, σ. Sice F = dgx, x is Lipschitz i the word metric, ad satisfies the Hölder cotiuity property as above, this establishes Theorem 5. Remark 8. Let us highlight that i geeral for hyperbolic groups oe ca costruct such a Markov chai ad Theorem 7 holds. However, what is special i the free group is that the distributio of the th step of the Markov chai is exactly equal to the uiform distributio o the set of elemets of word legth i the Cayley graph. I geeral, the two measures are equivalet up to multiplicative costats, which makes it harder to traslate the CLT from oe settig to the other. Now, we use the previous Theorem which is about the Markov chai to study the distributio of cyclically reduced words. Give a reduced word g of legth, let ĝ deote the prefix of g of legth log. Let λ be the uiform distributio o all cyclically reduced words of legth. Let λ,m deote the distributio of the prefix of legth m of a uiformly chose cyclically reduced word of legth. That is, if g has law λ, the ĝ has law λ,log. We defie ν,m i the same way, usig ν i place of λ. By the Markov property, ν,m = ν m. We eed the followig lemma, which is stated for a free group of rak N. Lemma 9 [3], Lemma 4.5. For ay 1 m 1, 1 + 2Nθ m λ,m ν,m T V 2 1 2Nθ m 1 where θ = 1 2N 1. Theorem 10. For ay a, b R with a < b oe has dgx, x L λ σ [a, b] N a,b as.

5 A CENTRAL LIMIT THEOREM FOR RANDOM CLOSED GEODESICS 5 Proof. Sice log / 0, Theorem 5 together with Lemma 4 implies dgx, x L ν log σ [a, b] N a,b. Now, sice ν log = ν,log ad by Lemma 9 we get hece λ,log ad by the defiitio of ĝ λ dĝx, x L σ ν,log λ,log T V 0 dgx, x L σ [a, b] = λ,log g : [a, b] N a,b, dgx, x L σ Fially, ote the sice the orbit map G H 2 is Lipschitz, we have dgx, x dĝx, x C log where C is the Lipschitz costat. The usig Lemma 4 lim λ dgx, x L g : σ [a, b] = lim λ g : which completes the proof. = N a,b dĝx, x L σ [a, b]. [a, b] The Gromov product. The remaiig step of our proof is to tur the statemet about displacemet Theorem 10 ito a statemet about traslatio legth. This is doe by cotrollig the Gromov product. Propositio 11. Let λ deote the uiform distributio o the set of cyclically reduced words of legth. The for ay ɛ > 0, λ g : gx, g 1 x x ɛ 0. Proof. We have the followig simple estimate: if N is the rak of the free group, the for ay 2N 2 2N 1 #S #J #S. I fact, clearly J S. Moreover, #S = 2N 1#S 1 sice oe ca cotiue a word of legth 1 i exactly 2N 1 ways, while #J 2N 2#S 1 sice oe eeds to avoid both the iverse of the first letter of ad of the last letter, thus remaiig with at least 2N 2 choices to cotiue the word. The, by [[5], Propositio 7.10] we have hece ν g : gx, g 1 x x ɛ 0 λ g : gx, g 1 x x ɛ #S #J ν g : gx, g 1 x x ɛ 0 sice #S #J 2N 1 2N 2.

6 6 I. GEKHTMAN, S.J. TAYLOR, AND G. TIOZZO Proof of Theorem 1. Proof of Theorem 1. Let d := dx,gx L σ, t := τg L σ, ad p := t d = 2gx,g 1 x x+oδ σ. By the CLT for displacemet Theorem 10, for ay a < b λ d [a, b] N a,b. Moreover, by decay of Gromov products for ay ɛ > 0 Propositio 11 we have hece by Lemma 4 λ Fially, by Lemma 2 this implies which completes the proof. µ γ : λ p ɛ 0 τg L σ τγ L σ Refereces [a, b] N a,b. [a, b] N a,b [1] Day Calegari, The ergodic theory of hyperbolic groups, Cotemp. Math , [2] Day Calegari ad Koji Fujiwara, Combable fuctios, quasimorphisms, ad the cetral limit theorem, Ergodic Theory ad Dyamical Systems 30, o , [3] Moira Chas ad Steve P. Lalley, Self-itersectios i combiatorial topology: statistical structure, Ivet. Math. 188, o , [4] Moira Chas, Kere Li, ad Berard Maskit, Experimets suggestig that the distributio of the hyperbolic legth of closed geodesics samplig by word legth is Gaussia, Experimetal Mathematics 22, o , [5] Ilya Gekhtma, Samuel J. Taylor, ad Giulio Tiozzo, Coutig loxodromics for hyperbolic actios, Joural of Topology 11, o , [6] Joseph Maher ad Giulio Tiozzo, Radom walks o weakly hyperbolic groups, J. Reie Agew. Math. published olie, to appear i prit, [7] Peter S. Park, Probability laws for the distributio of geometric legths whe samplig by a radom walk i a Fuchsia fudametal group, Arxiv preprit, arxiv: [math.gt]. [8] Mark Pollicott ad Richard Sharp, Compariso theorems ad orbit coutig i hyperbolic geometry, Trasactios of the AMS 350, o , [9] Mark Pollicott, ad Richard Sharp, Poicaré series ad compariso theorems for variable egative curvature, i Topology, ergodic theory, real algebraic geometry, Amer. Math. Soc. Trasl. Ser. 2, , , Amer. Math. Soc., Providece, RI. Departmet of Mathematics, Uiversity of Toroto, 40 St George St, Toroto, ON, Caada, address: ilyagekh@gmail.com Departmet of Mathematics, Temple Uiversity, 1805 North Broad Street Philadelphia, PA 19122, U.S.A, address: samuel.taylor@temple.edu Departmet of Mathematics, Uiversity of Toroto, 40 St George St, Toroto, ON, Caada, address: tiozzo@math.toroto.edu

7.1 Convergence of sequences of random variables

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

Solution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1

Solution. 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 information

7.1 Convergence of sequences of random variables

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

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

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

This section is optional.

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

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.

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

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

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 information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

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

Math Solutions to homework 6

Math Solutions to homework 6 Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there

More information

4. Partial Sums and the Central Limit Theorem

4. 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 information

Singular Continuous Measures by Michael Pejic 5/14/10

Singular Continuous Measures by Michael Pejic 5/14/10 Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable

More information

A constructive analysis of convex-valued demand correspondence for weakly uniformly rotund and monotonic preference

A constructive analysis of convex-valued demand correspondence for weakly uniformly rotund and monotonic preference MPRA Muich Persoal RePEc Archive A costructive aalysis of covex-valued demad correspodece for weakly uiformly rotud ad mootoic preferece Yasuhito Taaka ad Atsuhiro Satoh. May 04 Olie at http://mpra.ub.ui-mueche.de/55889/

More information

Integrable 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

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

Entropy Rates and Asymptotic Equipartition

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

Disjoint Systems. Abstract

Disjoint Systems. Abstract Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio

More information

On Random Line Segments in the Unit Square

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

MASSACHUSETTS 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

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

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

Appendix to Quicksort Asymptotics

Appendix to Quicksort Asymptotics Appedix to Quicksort Asymptotics James Alle Fill Departmet of Mathematical Scieces The Johs Hopkis Uiversity jimfill@jhu.edu ad http://www.mts.jhu.edu/~fill/ ad Svate Jaso Departmet of Mathematics Uppsala

More information

Distribution of Random Samples & Limit theorems

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

BIRKHOFF ERGODIC THEOREM

BIRKHOFF ERGODIC THEOREM BIRKHOFF ERGODIC THEOREM Abstract. We will give a proof of the poitwise ergodic theorem, which was first proved by Birkhoff. May improvemets have bee made sice Birkhoff s orgial proof. The versio we give

More information

FUCHSIAN GROUPS AND COMPACT HYPERBOLIC SURFACES

FUCHSIAN GROUPS AND COMPACT HYPERBOLIC SURFACES FUCHSIAN GROUPS AND COMPACT HYPERBOLIC SURFACES YVES BENOIST AND HEE OH Abstract. We preset a topological proof of the followig theorem of Beoist-Quit: for a fiitely geerated o-elemetary discrete subgroup

More information

Notes 19 : Martingale CLT

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

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]

More information

ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS

ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX0000-0 ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS MARCH T. BOEDIHARDJO AND WILLIAM B. JOHNSON 2

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Chapter 7 Isoperimetric problem

Chapter 7 Isoperimetric problem Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated

More information

Detailed proofs of Propositions 3.1 and 3.2

Detailed proofs of Propositions 3.1 and 3.2 Detailed proofs of Propositios 3. ad 3. Proof of Propositio 3. NB: itegratio sets are geerally omitted for itegrals defied over a uit hypercube [0, s with ay s d. We first give four lemmas. The proof of

More information

Lecture 19: Convergence

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

Advanced Stochastic Processes.

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

A Proof of Birkhoff s Ergodic Theorem

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

Theorem 3. A subset S of a topological space X is compact if and only if every open cover of S by open sets in X has a finite subcover.

Theorem 3. A subset S of a topological space X is compact if and only if every open cover of S by open sets in X has a finite subcover. Compactess Defiitio 1. A cover or a coverig of a topological space X is a family C of subsets of X whose uio is X. A subcover of a cover C is a subfamily of C which is a cover of X. A ope cover of X is

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

Independence number of graphs with a prescribed number of cliques

Independence number of graphs with a prescribed number of cliques Idepedece umber of graphs with a prescribed umber of cliques Tom Bohma Dhruv Mubayi Abstract We cosider the followig problem posed by Erdős i 1962. Suppose that G is a -vertex graph where the umber of

More information

f n (x) f m (x) < ɛ/3 for all x A. By continuity of f n and f m we can find δ > 0 such that d(x, x 0 ) < δ implies that

f n (x) f m (x) < ɛ/3 for all x A. By continuity of f n and f m we can find δ > 0 such that d(x, x 0 ) < δ implies that Lecture 15 We have see that a sequece of cotiuous fuctios which is uiformly coverget produces a limit fuctio which is also cotiuous. We shall stregthe this result ow. Theorem 1 Let f : X R or (C) be a

More information

Notes 27 : Brownian motion: path properties

Notes 27 : Brownian motion: path properties Notes 27 : Browia motio: path properties Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces:[Dur10, Sectio 8.1], [MP10, Sectio 1.1, 1.2, 1.3]. Recall: DEF 27.1 (Covariace) Let X = (X

More information

Infinite Sequences and Series

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

lim za n n = z lim a n n.

lim za n n = z lim a n n. Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

5 Birkhoff s Ergodic Theorem

5 Birkhoff s Ergodic Theorem 5 Birkhoff s Ergodic Theorem Amog the most useful of the various geeralizatios of KolmogorovâĂŹs strog law of large umbers are the ergodic theorems of Birkhoff ad Kigma, which exted the validity of the

More information

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

Archimedes - numbers for counting, otherwise lengths, areas, etc. Kepler - geometry for planetary motion

Archimedes - numbers for counting, otherwise lengths, areas, etc. Kepler - geometry for planetary motion Topics i Aalysis 3460:589 Summer 007 Itroductio Ree descartes - aalysis (breaig dow) ad sythesis Sciece as models of ature : explaatory, parsimoious, predictive Most predictios require umerical values,

More information

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

More information

Lecture 3 The Lebesgue Integral

Lecture 3 The Lebesgue Integral Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified

More information

Chapter 2 The Monte Carlo Method

Chapter 2 The Monte Carlo Method Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful

More information

MAS111 Convergence and Continuity

MAS111 Convergence and Continuity MAS Covergece ad Cotiuity Key Objectives At the ed of the course, studets should kow the followig topics ad be able to apply the basic priciples ad theorems therei to solvig various problems cocerig covergece

More information

Lecture Notes 15 Hypothesis Testing (Chapter 10)

Lecture Notes 15 Hypothesis Testing (Chapter 10) 1 Itroductio Lecture Notes 15 Hypothesis Testig Chapter 10) Let X 1,..., X p θ x). Suppose we we wat to kow if θ = θ 0 or ot, where θ 0 is a specific value of θ. For example, if we are flippig a coi, we

More information

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4

More information

ON POINTWISE BINOMIAL APPROXIMATION

ON POINTWISE BINOMIAL APPROXIMATION Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece

More information

A NOTE ON INVARIANT SETS OF ITERATED FUNCTION SYSTEMS

A NOTE ON INVARIANT SETS OF ITERATED FUNCTION SYSTEMS Acta Math. Hugar., 2007 DOI: 10.1007/s10474-007-7013-6 A NOTE ON INVARIANT SETS OF ITERATED FUNCTION SYSTEMS L. L. STACHÓ ad L. I. SZABÓ Bolyai Istitute, Uiversity of Szeged, Aradi vértaúk tere 1, H-6720

More information

Precise Rates in Complete Moment Convergence for Negatively Associated Sequences

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

AN EXTENSION OF SIMONS INEQUALITY AND APPLICATIONS. Robert DEVILLE and Catherine FINET

AN EXTENSION OF SIMONS INEQUALITY AND APPLICATIONS. Robert DEVILLE and Catherine FINET 2001 vol. XIV, um. 1, 95-104 ISSN 1139-1138 AN EXTENSION OF SIMONS INEQUALITY AND APPLICATIONS Robert DEVILLE ad Catherie FINET Abstract This article is devoted to a extesio of Simos iequality. As a cosequece,

More information

Learning Theory: Lecture Notes

Learning Theory: Lecture Notes Learig Theory: Lecture Notes Kamalika Chaudhuri October 4, 0 Cocetratio of Averages Cocetratio of measure is very useful i showig bouds o the errors of machie-learig algorithms. We will begi with a basic

More information

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula Joural of Multivariate Aalysis 102 (2011) 1315 1319 Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: www.elsevier.com/locate/jmva Superefficiet estimatio of the margials

More information

On groups of diffeomorphisms of the interval with finitely many fixed points II. Azer Akhmedov

On groups of diffeomorphisms of the interval with finitely many fixed points II. Azer Akhmedov O groups of diffeomorphisms of the iterval with fiitely may fixed poits II Azer Akhmedov Abstract: I [6], it is proved that ay subgroup of Diff ω +(I) (the group of orietatio preservig aalytic diffeomorphisms

More information

A Hilbert Space Central Limit Theorem for Geometrically Ergodic Markov Chains

A Hilbert Space Central Limit Theorem for Geometrically Ergodic Markov Chains A Hilbert Space Cetral Limit Theorem for Geometrically Ergodic Marov Chais Joh Stachursi Research School of Ecoomics, Australia Natioal Uiversity Abstract This ote proves a simple but useful cetral limit

More information

Some remarks for codes and lattices over imaginary quadratic

Some remarks for codes and lattices over imaginary quadratic Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract

More information

An Introduction to Randomized Algorithms

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

Berry-Esseen bounds for self-normalized martingales

Berry-Esseen bounds for self-normalized martingales Berry-Essee bouds for self-ormalized martigales Xiequa Fa a, Qi-Ma Shao b a Ceter for Applied Mathematics, Tiaji Uiversity, Tiaji 30007, Chia b Departmet of Statistics, The Chiese Uiversity of Hog Kog,

More information

Lecture 7: October 18, 2017

Lecture 7: October 18, 2017 Iformatio ad Codig Theory Autum 207 Lecturer: Madhur Tulsiai Lecture 7: October 8, 207 Biary hypothesis testig I this lecture, we apply the tools developed i the past few lectures to uderstad the problem

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

Entropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP

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

Lecture 14: Graph Entropy

Lecture 14: Graph Entropy 15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number

More information

Kolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data

Kolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data Proceedigs 59th ISI World Statistics Cogress, 5-30 August 013, Hog Kog (Sessio STS046) p.09 Kolmogorov-Smirov type Tests for Local Gaussiaity i High-Frequecy Data George Tauche, Duke Uiversity Viktor Todorov,

More information

Lecture 12: November 13, 2018

Lecture 12: November 13, 2018 Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,

More information

1 The Haar functions and the Brownian motion

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

Best bounds for dispersion of ratio block sequences for certain subsets of integers

Best bounds for dispersion of ratio block sequences for certain subsets of integers Aales Mathematicae et Iformaticae 49 (08 pp. 55 60 doi: 0.33039/ami.08.05.006 http://ami.ui-eszterhazy.hu Best bouds for dispersio of ratio block sequeces for certai subsets of itegers József Bukor Peter

More information

Properties of Fuzzy Length on Fuzzy Set

Properties of Fuzzy Length on Fuzzy Set Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,

More information

Output Analysis and Run-Length Control

Output Analysis and Run-Length Control IEOR E4703: Mote Carlo Simulatio Columbia Uiversity c 2017 by Marti Haugh Output Aalysis ad Ru-Legth Cotrol I these otes we describe how the Cetral Limit Theorem ca be used to costruct approximate (1 α%

More information

A New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem

A New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem This is the Pre-Published Versio. A New Solutio Method for the Fiite-Horizo Discrete-Time EOQ Problem Chug-Lu Li Departmet of Logistics The Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog Phoe: +852-2766-7410

More information

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f

More information

PRELIM PROBLEM SOLUTIONS

PRELIM PROBLEM SOLUTIONS PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems

More information

Notes for Lecture 11

Notes for Lecture 11 U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with

More information

Additional Notes on Power Series

Additional Notes on Power Series Additioal Notes o Power Series Mauela Girotti MATH 37-0 Advaced Calculus of oe variable Cotets Quick recall 2 Abel s Theorem 2 3 Differetiatio ad Itegratio of Power series 4 Quick recall We recall here

More information

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5 Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You

More information

A NOTE ON BOUNDARY BLOW-UP PROBLEM OF u = u p

A NOTE ON BOUNDARY BLOW-UP PROBLEM OF u = u p A NOTE ON BOUNDARY BLOW-UP PROBLEM OF u = u p SEICK KIM Abstract. Assume that Ω is a bouded domai i R with 2. We study positive solutios to the problem, u = u p i Ω, u(x) as x Ω, where p > 1. Such solutios

More information

1 = δ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

1 = δ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 information

A NOTE ON SPECTRAL CONTINUITY. In Ho Jeon and In Hyoun Kim

A NOTE ON SPECTRAL CONTINUITY. In Ho Jeon and In Hyoun Kim Korea J. Math. 23 (2015), No. 4, pp. 601 605 http://dx.doi.org/10.11568/kjm.2015.23.4.601 A NOTE ON SPECTRAL CONTINUITY I Ho Jeo ad I Hyou Kim Abstract. I the preset ote, provided T L (H ) is biquasitriagular

More information

62. 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 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 information

Mi-Hwa Ko and Tae-Sung Kim

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

17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15

17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15 17. Joit distributios of extreme order statistics Lehma 5.1; Ferguso 15 I Example 10., we derived the asymptotic distributio of the maximum from a radom sample from a uiform distributio. We did this usig

More information

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT

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

Parameter, Statistic and Random Samples

Parameter, Statistic and Random Samples Parameter, Statistic ad Radom Samples A parameter is a umber that describes the populatio. It is a fixed umber, but i practice we do ot kow its value. A statistic is a fuctio of the sample data, i.e.,

More information

LECTURE 8: ASYMPTOTICS I

LECTURE 8: ASYMPTOTICS I LECTURE 8: ASYMPTOTICS I We are iterested i the properties of estimators as. Cosider a sequece of radom variables {, X 1}. N. M. Kiefer, Corell Uiversity, Ecoomics 60 1 Defiitio: (Weak covergece) A sequece

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

Partial match queries: a limit process

Partial match queries: a limit process Partial match queries: a limit process Nicolas Brouti Ralph Neiiger Heig Sulzbach Partial match queries: a limit process 1 / 17 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process

More information

Lecture 3 : Random variables and their distributions

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

Equivalence Between An Approximate Version Of Brouwer s Fixed Point Theorem And Sperner s Lemma: A Constructive Analysis

Equivalence Between An Approximate Version Of Brouwer s Fixed Point Theorem And Sperner s Lemma: A Constructive Analysis Applied Mathematics E-Notes, 11(2011), 238 243 c ISSN 1607-2510 Available free at mirror sites of http://www.math.thu.edu.tw/ame/ Equivalece Betwee A Approximate Versio Of Brouwer s Fixed Poit Theorem

More information

Ma 530 Infinite Series I

Ma 530 Infinite Series I Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li

More information

Math 341 Lecture #31 6.5: Power Series

Math 341 Lecture #31 6.5: Power Series Math 341 Lecture #31 6.5: Power Series We ow tur our attetio to a particular kid of series of fuctios, amely, power series, f(x = a x = a 0 + a 1 x + a 2 x 2 + where a R for all N. I terms of a series

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

Lecture Chapter 6: Convergence of Random Sequences

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

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018) Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Law of the sum of Bernoulli random variables

Law of the sum of Bernoulli random variables Law of the sum of Beroulli radom variables Nicolas Chevallier Uiversité de Haute Alsace, 4, rue des frères Lumière 68093 Mulhouse icolas.chevallier@uha.fr December 006 Abstract Let be the set of all possible

More information

Topic 9: Sampling Distributions of Estimators

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

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS EDUARD KONTOROVICH Abstract. I this work we uify ad geeralize some results about chaos ad sesitivity. Date: March 1, 005. 1 1. Symbolic Dyamics Defiitio

More information

Topic 9: Sampling Distributions of Estimators

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