Multivariate approximation in total variation
|
|
- Curtis Abner Day
- 5 years ago
- Views:
Transcription
1 Multivariate approximation in total variation A. D. Barbour, M. J. Luczak and A. Xia Department of Mathematics and Statistics The University of Melbourne, VIC May, 2015 [Slide 1]
2 Background Information Two corner-stone distributions Continuous: normal and the central limit theorem, in the Kolmogorov distance Discrete: Poisson and the law of small numbers, in the total variation [Slide 2]
3 Poisson approximation The Stein Chen method (Chen, 1975) Barbour and Hall (1984) { } n min λ, 1 p 2 i d T V (L(W ), Pn(λ)) 1 e λ λ i=1 n p 2 i. i=1 The message: Poisson has only one parameter, so to improve on the quality of approximation, more parameters should be introduced. [Slide 3]
4 Improvements Translated Poisson (Röllin 2005), perturbation (Barbour and X. 1999, Barbour, Čekanavičius and X. 2007), polynomial birth-death (Brown and X. 2001), zero biasing with birth-death process (Goldstein and X. 2006), discretised normal (Roy 2003, Chen and Leong (2010), and Fang (2014)). [Slide 4]
5 Multivariate approximation Normal: Gotze 1991, Goldstein and Rinott 1996, Rinott and Rotar (1996),... Discrete version? Multivariate Poisson (Barbour 1988, Roos 1999) How to introduce more parameters? Multivariate Poisson with negative correlation? Transform a multivariate Poisson? Discretise multivariate normal? Stein s identity? How to extract Stein s constants? [Slide 5]
6 One dimension Stein s equation for Poisson(λ): λg(i + 1) ig(i) = f(i) Pn(λ)(f). Birth-death process interpretation (Barbour 1988): by taking g(i) = h(i) h(i 1), Ah(i) := λ(h(i+1) h(i))+i(h(i 1) h(i)) = f(i) Pn(λ)(f). A is the generator of the birth-death process with birth rate λ and each individual has lifetime of exp(1), independent of others. [Slide 6]
7 The solution of the Stein equation is h(i) = 0 [Ef(Z i (t)) Pn(λ)(f)]dt, where Z i is a birth-death process with generator A and initial value Z i (0) = i. Stein s constants are from estimates of h := sup i h(i + 1) h(i) and 2 h := sup i h(i + 1) h(i). [Slide 7]
8 Discrete CLT: Goldstein and X Ah(i) := α i (h(i + 1) h(i)) + β i (h(i 1) h(i)), where α i = σ 2, i κ, σ 2 + µ i i κ 1, β i = σ 2 + i µ i κ, σ 2 i κ 1. A is the generator of the bilateral birth-death processes with birth rates {α i : i Z} and death rates {β i : i Z}. Similarly, h can be represented in terms of Z i (t), t 0, the Markov process with generator A and initial value i. If µ σ 2 is an integer and κ = µ σ 2, the states < κ are transient: translated Poisson. [Slide 8]
9 Fang 2014 Works on σ 2 f (s) (s µ)f(s) = h(s) Eh(Z µ,σ 2), where h is constant on [i 0.5, i + 0.5) for i Z, so can extract Stein s factors for discretised normal from those of normal approximation. [Slide 9]
10 Multivariate d-dimensional Ornstein-Uhlenbeck operator Ah(w) = n 2 Tr(σ2 D 2 h(w)) + Dh T (w)a(w nc), w R d on twice differentiable functions h : R d R. A is a matrix whose eigenvalues all have negative real parts. σ 2 is a positive definite symmetric matrix. The equilibrium distribution is N d (nc, nσ) with Σ = 0 e At σ 2 e AT t dt. AΣ + ΣA T + σ 2 = 0. [Slide 10]
11 Discrete version Consider DN d (nc, nσ) as discretised version of N d (nc, nσ): for (i 1,..., i d ) Z d, DN d (nc, nσ){(i 1,..., i d )} = N d (nc, nσ)([i 1 0.5, i ) [i d 0.5, i d + 0.5)). Fix c R d. For h : Z d R, define the generator A n h(w) = n 2 Tr ( σ 2 2 h(w) ) + h T (w)a(w nc), w Z d. A, σ 2 : as above. j h(w) = h(w + e (j) ) h(w), 2 jk h(w) = j ( k h)(w), 1 j, k d. [Slide 11]
12 Markov population process X n has transition rates ng J (n 1 w) from w to w + J, w Z d, J J, where J is a finite subset of Z d. g J is twice continuously differentiable. Define F (ξ) = J J JgJ (ξ), we assume dξ dt = F (ξ) has an equilibrium point c so F (c) = 0 and A = DF (c). This Markov population process has the equilibrium distribution Π n. [Slide 12]
13 Modification of the Markov population process X n has small chance to drift away from its centre nc but if it happens,... DN d (nc, nσ) essentially distributes in a region of radius nδ around nc: { I n,δ = ξ Z d : } (ξ nc) T Σ 1 (ξ nc) nδ. We can focus on approximating any arbitrary Z d -valued random element W in I n,δ first and then add in the errors outside this region We modify X n to keep it in I n,δ [Slide 13]
14 Modification (2) Modify X n to Xn δ with transition rates from w to w + J: ng J (n 1 w), if w nc, w + J nc ngδ J (n 1 w) = I n,δ, 0, otherwise. If Xn δ starts in I n,δ, then it stays in I n,δ. We assume conditions to ensure it is irreducible so it has the unique equilibrium distribution Π δ n [Slide 14]
15 Π δ n approximation Generator A δ n(w) = n J J g J δ (n 1 w){h(w + J) h(w)}, w Z d Stein s equation: A δ nh B (w) = 1 B (w) Π δ n(b), B I n,δ. The solution h B can be written as h B (w) = 0 (P(X δ n(t) B X δ n(0) = w) Π δ n(b))dt. [Slide 15]
16 Estimates: h B (w) c 0 ln n, h B (w) c 1 n 1/2 ln n; 2 h B (w) c 2 n 1 ln n for w in a nδ/4-neighbourhood of nc and n sufficiently large. [Slide 16]
17 For any Z d valued random element W, B I n,δ, we have P(W B) Π δ n(b) = E{(1 B (W ) Π δ n(b))1 W In,δ } Π n (B)P(W I n,δ ) = E{A δ nh B (W )1 W In,δ } Π n (B)P(W I n,δ ), hence d T V (L(W ), Π δ n) sup E{A δ nh B (W )1 W In,δ } + P(W I n,δ ). B I n,δ }{{} Bienaymé-Chebyshev ineq. [Slide 17]
18 Multivariate in total variation Assume E W nc 2 V n, d T V (L(W ), L(W + e (j) )) ε 1, 1 j d, and E{A n h(w )}1 [ W nc c1 n] c 2 h ε }{{} 20 + c 3 n 1/2 h }{{} c ln n c ln n ε 21 + c 4 n 2 h ε }{{} 22, c ln n where h is the solution for A δ n, h, h and 2 h are estimates around an ηn neighbourhood of nc. [Slide 18]
19 Then d T V (L(W ), DN d (nc, nσ)) O ln n n} 1/2 {{} +ε 1 + ε 20 + ε 21 + ε 22. diff of DN d and Π n [Slide 19]
On the asymptotic behaviour of the number of renewals via translated Poisson
On the asymptotic behaviour of the number of renewals via translated Poisson Aihua Xia ( 夏爱华 ) School of Mathematics and Statistics The University of Melbourne, VIC 3010 20 July, 2018 The 14th Workshop
More informationApproximation of the conditional number of exceedances
Approximation of the conditional number of exceedances Han Liang Gan University of Melbourne July 9, 2013 Joint work with Aihua Xia Han Liang Gan Approximation of the conditional number of exceedances
More informationDifferential Stein operators for multivariate continuous distributions and applications
Differential Stein operators for multivariate continuous distributions and applications Gesine Reinert A French/American Collaborative Colloquium on Concentration Inequalities, High Dimensional Statistics
More informationStein s Method: Distributional Approximation and Concentration of Measure
Stein s Method: Distributional Approximation and Concentration of Measure Larry Goldstein University of Southern California 36 th Midwest Probability Colloquium, 2014 Stein s method for Distributional
More informationA Gentle Introduction to Stein s Method for Normal Approximation I
A Gentle Introduction to Stein s Method for Normal Approximation I Larry Goldstein University of Southern California Introduction to Stein s Method for Normal Approximation 1. Much activity since Stein
More informationStein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions
Stein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions Jim Dai Joint work with Anton Braverman and Jiekun Feng Cornell University Workshop on Congestion Games Institute
More informationWasserstein-2 bounds in normal approximation under local dependence
Wasserstein- bounds in normal approximation under local dependence arxiv:1807.05741v1 [math.pr] 16 Jul 018 Xiao Fang The Chinese University of Hong Kong Abstract: We obtain a general bound for the Wasserstein-
More informationNotes on Poisson Approximation
Notes on Poisson Approximation A. D. Barbour* Universität Zürich Progress in Stein s Method, Singapore, January 2009 These notes are a supplement to the article Topics in Poisson Approximation, which appeared
More informationMULTIVARIATE APPROXIMATION IN TOTAL VARIATION, I: EQUILIBRIUM DISTRIBUTIONS OF MARKOV JUMP PROCESSES
The Annals of Probability 2018, Vol. 46, No. 3, 1351 1404 https://doi.org/10.1214/17-aop1204 Institute of Mathematical Statistics, 2018 MULTIVARIATE APPROXIMATION IN TOTAL VARIATION, I: EQUILIBRIUM DISTRIBUTIONS
More informationOn the Entropy of Sums of Bernoulli Random Variables via the Chen-Stein Method
On the Entropy of Sums of Bernoulli Random Variables via the Chen-Stein Method Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology Haifa 32000, Israel ETH, Zurich,
More informationP (A G) dp G P (A G)
First homework assignment. Due at 12:15 on 22 September 2016. Homework 1. We roll two dices. X is the result of one of them and Z the sum of the results. Find E [X Z. Homework 2. Let X be a r.v.. Assume
More informationMODERATE DEVIATIONS IN POISSON APPROXIMATION: A FIRST ATTEMPT
Statistica Sinica 23 (2013), 1523-1540 doi:http://dx.doi.org/10.5705/ss.2012.203s MODERATE DEVIATIONS IN POISSON APPROXIMATION: A FIRST ATTEMPT Louis H. Y. Chen 1, Xiao Fang 1,2 and Qi-Man Shao 3 1 National
More informationA Short Introduction to Stein s Method
A Short Introduction to Stein s Method Gesine Reinert Department of Statistics University of Oxford 1 Overview Lecture 1: focusses mainly on normal approximation Lecture 2: other approximations 2 1. The
More informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationElementary Applications of Probability Theory
Elementary Applications of Probability Theory With an introduction to stochastic differential equations Second edition Henry C. Tuckwell Senior Research Fellow Stochastic Analysis Group of the Centre for
More informationStein s Method and the Zero Bias Transformation with Application to Simple Random Sampling
Stein s Method and the Zero Bias Transformation with Application to Simple Random Sampling Larry Goldstein and Gesine Reinert November 8, 001 Abstract Let W be a random variable with mean zero and variance
More informationStochastic modelling of epidemic spread
Stochastic modelling of epidemic spread Julien Arino Centre for Research on Inner City Health St Michael s Hospital Toronto On leave from Department of Mathematics University of Manitoba Julien Arino@umanitoba.ca
More informationCDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes
CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic process X = {X(t), t2 T} is a collection of random variables (rvs); one rv
More informationAsymptotic Statistics-VI. Changliang Zou
Asymptotic Statistics-VI Changliang Zou Kolmogorov-Smirnov distance Example (Kolmogorov-Smirnov confidence intervals) We know given α (0, 1), there is a well-defined d = d α,n such that, for any continuous
More informationP(X 0 = j 0,... X nk = j k )
Introduction to Probability Example Sheet 3 - Michaelmas 2006 Michael Tehranchi Problem. Let (X n ) n 0 be a homogeneous Markov chain on S with transition matrix P. Given a k N, let Z n = X kn. Prove that
More informationStochastic modelling of epidemic spread
Stochastic modelling of epidemic spread Julien Arino Department of Mathematics University of Manitoba Winnipeg Julien Arino@umanitoba.ca 19 May 2012 1 Introduction 2 Stochastic processes 3 The SIS model
More informationMarkov Chains, Stochastic Processes, and Matrix Decompositions
Markov Chains, Stochastic Processes, and Matrix Decompositions 5 May 2014 Outline 1 Markov Chains Outline 1 Markov Chains 2 Introduction Perron-Frobenius Matrix Decompositions and Markov Chains Spectral
More informationNEW FUNCTIONAL INEQUALITIES
1 / 29 NEW FUNCTIONAL INEQUALITIES VIA STEIN S METHOD Giovanni Peccati (Luxembourg University) IMA, Minneapolis: April 28, 2015 2 / 29 INTRODUCTION Based on two joint works: (1) Nourdin, Peccati and Swan
More informationSelected Exercises on Expectations and Some Probability Inequalities
Selected Exercises on Expectations and Some Probability Inequalities # If E(X 2 ) = and E X a > 0, then P( X λa) ( λ) 2 a 2 for 0 < λ
More informationOn bounds in multivariate Poisson approximation
Workshop on New Directions in Stein s Method IMS (NUS, Singapore), May 18-29, 2015 Acknowledgments Thanks Institute for Mathematical Sciences (IMS, NUS), for the invitation, hospitality and accommodation
More informationCDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical
CDA5530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic ti process X = {X(t), t T} is a collection of random variables (rvs); one
More informationMarkov processes and queueing networks
Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution
More informationStein s method and stochastic analysis of Rademacher functionals
E l e c t r o n i c J o u r n a l o f P r o b a b i l i t y Vol. 15 (010), Paper no. 55, pages 1703 174. Journal URL http://www.math.washington.edu/~ejpecp/ Stein s method and stochastic analysis of Rademacher
More informationA fixed point approximation for a routing model in equilibrium
A fixed point approximation for a routing model in equilibrium School of Mathematical Sciences Queen Mary University of London UK e-mail: m.luczak@qmul.ac.uk Brisbane, July 2013 Complex random networks
More informationKOLMOGOROV DISTANCE FOR MULTIVARIATE NORMAL APPROXIMATION. Yoon Tae Kim and Hyun Suk Park
Korean J. Math. 3 (015, No. 1, pp. 1 10 http://dx.doi.org/10.11568/kjm.015.3.1.1 KOLMOGOROV DISTANCE FOR MULTIVARIATE NORMAL APPROXIMATION Yoon Tae Kim and Hyun Suk Park Abstract. This paper concerns the
More informationLECTURE #6 BIRTH-DEATH PROCESS
LECTURE #6 BIRTH-DEATH PROCESS 204528 Queueing Theory and Applications in Networks Assoc. Prof., Ph.D. (รศ.ดร. อน นต ผลเพ ม) Computer Engineering Department, Kasetsart University Outline 2 Birth-Death
More informationStein s Method and Characteristic Functions
Stein s Method and Characteristic Functions Alexander Tikhomirov Komi Science Center of Ural Division of RAS, Syktyvkar, Russia; Singapore, NUS, 18-29 May 2015 Workshop New Directions in Stein s method
More informationSMSTC (2007/08) Probability.
SMSTC (27/8) Probability www.smstc.ac.uk Contents 12 Markov chains in continuous time 12 1 12.1 Markov property and the Kolmogorov equations.................... 12 2 12.1.1 Finite state space.................................
More informationBootstrap random walks
Bootstrap random walks Kais Hamza Monash University Joint work with Andrea Collevecchio & Meng Shi Introduction The two and three dimensional processes Higher Iterations An extension any (prime) number
More informationChapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27
Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation
More informationMarkov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains
Markov Chains A random process X is a family {X t : t T } of random variables indexed by some set T. When T = {0, 1, 2,... } one speaks about a discrete-time process, for T = R or T = [0, ) one has a continuous-time
More informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
More informationStochastic Processes
Stochastic Processes 8.445 MIT, fall 20 Mid Term Exam Solutions October 27, 20 Your Name: Alberto De Sole Exercise Max Grade Grade 5 5 2 5 5 3 5 5 4 5 5 5 5 5 6 5 5 Total 30 30 Problem :. True / False
More information06. Stochastic Processes: Concepts
University of Rhode Island DigitalCommons@URI Nonequilibrium Statistical Physics Physics Course Materials 2015 06. Stochastic Processes: Concepts Gerhard Müller University of Rhode Island, gmuller@uri.edu
More informationLimiting Distributions
We introduce the mode of convergence for a sequence of random variables, and discuss the convergence in probability and in distribution. The concept of convergence leads us to the two fundamental results
More informationNormal approximation of Poisson functionals in Kolmogorov distance
Normal approximation of Poisson functionals in Kolmogorov distance Matthias Schulte Abstract Peccati, Solè, Taqqu, and Utzet recently combined Stein s method and Malliavin calculus to obtain a bound for
More informationSTA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008
Name STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008 There are five questions on this test. DO use calculators if you need them. And then a miracle occurs is not a valid answer. There
More informationGaussian Processes. 1. Basic Notions
Gaussian Processes 1. Basic Notions Let T be a set, and X : {X } T a stochastic process, defined on a suitable probability space (Ω P), that is indexed by T. Definition 1.1. We say that X is a Gaussian
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationOblique derivative problems for elliptic and parabolic equations, Lecture II
of the for elliptic and parabolic equations, Lecture II Iowa State University July 22, 2011 of the 1 2 of the of the As a preliminary step in our further we now look at a special situation for elliptic.
More information14 Branching processes
4 BRANCHING PROCESSES 6 4 Branching processes In this chapter we will consider a rom model for population growth in the absence of spatial or any other resource constraints. So, consider a population of
More informationStochastic Processes. Theory for Applications. Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS
Stochastic Processes Theory for Applications Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS Contents Preface page xv Swgg&sfzoMj ybr zmjfr%cforj owf fmdy xix Acknowledgements xxi 1 Introduction and review
More informationOn the convergence of sequences of random variables: A primer
BCAM May 2012 1 On the convergence of sequences of random variables: A primer Armand M. Makowski ECE & ISR/HyNet University of Maryland at College Park armand@isr.umd.edu BCAM May 2012 2 A sequence a :
More information18.175: Lecture 17 Poisson random variables
18.175: Lecture 17 Poisson random variables Scott Sheffield MIT 1 Outline More on random walks and local CLT Poisson random variable convergence Extend CLT idea to stable random variables 2 Outline More
More informationLimiting Distributions
Limiting Distributions We introduce the mode of convergence for a sequence of random variables, and discuss the convergence in probability and in distribution. The concept of convergence leads us to the
More informationEXPLICIT MULTIVARIATE BOUNDS OF CHEBYSHEV TYPE
Annales Univ. Sci. Budapest., Sect. Comp. 42 2014) 109 125 EXPLICIT MULTIVARIATE BOUNDS OF CHEBYSHEV TYPE Villő Csiszár Budapest, Hungary) Tamás Fegyverneki Budapest, Hungary) Tamás F. Móri Budapest, Hungary)
More informationLet (Ω, F) be a measureable space. A filtration in discrete time is a sequence of. F s F t
2.2 Filtrations Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of σ algebras {F t } such that F t F and F t F t+1 for all t = 0, 1,.... In continuous time, the second condition
More informationTHE LINDEBERG-FELLER CENTRAL LIMIT THEOREM VIA ZERO BIAS TRANSFORMATION
THE LINDEBERG-FELLER CENTRAL LIMIT THEOREM VIA ZERO BIAS TRANSFORMATION JAINUL VAGHASIA Contents. Introduction. Notations 3. Background in Probability Theory 3.. Expectation and Variance 3.. Convergence
More informationLinear Independence of Finite Gabor Systems
Linear Independence of Finite Gabor Systems 1 Linear Independence of Finite Gabor Systems School of Mathematics Korea Institute for Advanced Study Linear Independence of Finite Gabor Systems 2 Short trip
More informationTable of Contents [ntc]
Table of Contents [ntc] 1. Introduction: Contents and Maps Table of contents [ntc] Equilibrium thermodynamics overview [nln6] Thermal equilibrium and nonequilibrium [nln1] Levels of description in statistical
More informationLecture 2: From Linear Regression to Kalman Filter and Beyond
Lecture 2: From Linear Regression to Kalman Filter and Beyond Department of Biomedical Engineering and Computational Science Aalto University January 26, 2012 Contents 1 Batch and Recursive Estimation
More informationStein s method, logarithmic Sobolev and transport inequalities
Stein s method, logarithmic Sobolev and transport inequalities M. Ledoux University of Toulouse, France and Institut Universitaire de France Stein s method, logarithmic Sobolev and transport inequalities
More informationMultiple Random Variables
Multiple Random Variables Joint Probability Density Let X and Y be two random variables. Their joint distribution function is F ( XY x, y) P X x Y y. F XY ( ) 1, < x
More informationGetting J e (x), J h (x), E(x), and p'(x), knowing n'(x) Solving the diffusion equation for n'(x) (using p-type example)
6.012 - Electronic Devices and Circuits Lecture 4 - Non-uniform Injection (Flow) Problems - Outline Announcements Handouts - 1. Lecture Outline and Summary; 2. Thermoelectrics Review Thermoelectricity:
More informationA COMPOUND POISSON APPROXIMATION INEQUALITY
J. Appl. Prob. 43, 282 288 (2006) Printed in Israel Applied Probability Trust 2006 A COMPOUND POISSON APPROXIMATION INEQUALITY EROL A. PEKÖZ, Boston University Abstract We give conditions under which the
More informationA Note on Poisson Approximation for Independent Geometric Random Variables
International Mathematical Forum, 4, 2009, no, 53-535 A Note on Poisson Approximation for Independent Geometric Random Variables K Teerapabolarn Department of Mathematics, Faculty of Science Burapha University,
More informationH 2 : otherwise. that is simply the proportion of the sample points below level x. For any fixed point x the law of large numbers gives that
Lecture 28 28.1 Kolmogorov-Smirnov test. Suppose that we have an i.i.d. sample X 1,..., X n with some unknown distribution and we would like to test the hypothesis that is equal to a particular distribution
More informationMath 128A Spring 2003 Week 12 Solutions
Math 128A Spring 2003 Week 12 Solutions Burden & Faires 5.9: 1b, 2b, 3, 5, 6, 7 Burden & Faires 5.10: 4, 5, 8 Burden & Faires 5.11: 1c, 2, 5, 6, 8 Burden & Faires 5.9. Higher-Order Equations and Systems
More informationLecture 4: Sampling, Tail Inequalities
Lecture 4: Sampling, Tail Inequalities Variance and Covariance Moment and Deviation Concentration and Tail Inequalities Sampling and Estimation c Hung Q. Ngo (SUNY at Buffalo) CSE 694 A Fun Course 1 /
More informationLecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321
Lecture 11: Introduction to Markov Chains Copyright G. Caire (Sample Lectures) 321 Discrete-time random processes A sequence of RVs indexed by a variable n 2 {0, 1, 2,...} forms a discretetime random process
More informationChapter 6. Stein s method, Malliavin calculus, Dirichlet forms and the fourth moment theorem
November 20, 2014 18:45 BC: 9129 - Festschrift Masatoshi Fukushima chapter6 page 107 Chapter 6 Stein s method, Malliavin calculus, Dirichlet forms and the fourth moment theorem Louis H.Y. Chen and Guillaume
More informationMod-φ convergence I: examples and probabilistic estimates
Mod-φ convergence I: examples and probabilistic estimates Valentin Féray (joint work with Pierre-Loïc Méliot and Ashkan Nikeghbali) Institut für Mathematik, Universität Zürich Summer school in Villa Volpi,
More informationOrdinary Differential Equations II
Ordinary Differential Equations II February 9 217 Linearization of an autonomous system We consider the system (1) x = f(x) near a fixed point x. As usual f C 1. Without loss of generality we assume x
More informationPHYS 771, Quantum Mechanics, Final Exam, Fall 2011 Instructor: Dr. A. G. Petukhov. Solutions
PHYS 771, Quantum Mechanics, Final Exam, Fall 11 Instructor: Dr. A. G. Petukhov Solutions 1. Apply WKB approximation to a particle moving in a potential 1 V x) = mω x x > otherwise Find eigenfunctions,
More informationStochastic Models (Lecture #4)
Stochastic Models (Lecture #4) Thomas Verdebout Université libre de Bruxelles (ULB) Today Today, our goal will be to discuss limits of sequences of rv, and to study famous limiting results. Convergence
More informationarxiv: v1 [math.pr] 16 Jun 2009
A THREE-PARAMETER BINOMIAL APPROXIMATION arxiv:0906.2855v1 [math.pr] 16 Jun 2009 Vydas Čekanavičius, Erol A. Peköz, Adrian Röllin and Michael Shwartz Version from June 3, 2018 Abstract We approximate the
More informationOnsager theory: overview
Onsager theory: overview Pearu Peterson December 18, 2006 1 Introduction Our aim is to study matter that consists of large number of molecules. A complete mechanical description of such a system is practically
More information1. Stochastic Processes and filtrations
1. Stochastic Processes and 1. Stoch. pr., A stochastic process (X t ) t T is a collection of random variables on (Ω, F) with values in a measurable space (S, S), i.e., for all t, In our case X t : Ω S
More informationMarkov Chains. Sarah Filippi Department of Statistics TA: Luke Kelly
Markov Chains Sarah Filippi Department of Statistics http://www.stats.ox.ac.uk/~filippi TA: Luke Kelly With grateful acknowledgements to Prof. Yee Whye Teh's slides from 2013 14. Schedule 09:30-10:30 Lecture:
More informationBrownian Motion and Conditional Probability
Math 561: Theory of Probability (Spring 2018) Week 10 Brownian Motion and Conditional Probability 10.1 Standard Brownian Motion (SBM) Brownian motion is a stochastic process with both practical and theoretical
More informationStein s Method Applied to Some Statistical Problems
Stein s Method Applied to Some Statistical Problems Jay Bartroff Borchard Colloquium 2017 Jay Bartroff (USC) Stein s for Stats 4.Jul.17 1 / 36 Outline of this talk 1. Stein s Method 2. Bounds to the normal
More informationBirth-death chain. X n. X k:n k,n 2 N k apple n. X k: L 2 N. x 1:n := x 1,...,x n. E n+1 ( x 1:n )=E n+1 ( x n ), 8x 1:n 2 X n.
Birth-death chains Birth-death chain special type of Markov chain Finite state space X := {0,...,L}, with L 2 N X n X k:n k,n 2 N k apple n Random variable and a sequence of variables, with and A sequence
More informationHandbook of Stochastic Methods
C. W. Gardiner Handbook of Stochastic Methods for Physics, Chemistry and the Natural Sciences Third Edition With 30 Figures Springer Contents 1. A Historical Introduction 1 1.1 Motivation I 1.2 Some Historical
More informationInference for non-stationary, non-gaussian, Irregularly-Sampled Processes
Inference for non-stationary, non-gaussian, Irregularly-Sampled Processes Robert Wolpert Duke Department of Statistical Science wolpert@stat.duke.edu SAMSI ASTRO Opening WS Aug 22-26 2016 Aug 24 Hamner
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More information2. Transience and Recurrence
Virtual Laboratories > 15. Markov Chains > 1 2 3 4 5 6 7 8 9 10 11 12 2. Transience and Recurrence The study of Markov chains, particularly the limiting behavior, depends critically on the random times
More informationThe cutoff phenomenon for random walk on random directed graphs
The cutoff phenomenon for random walk on random directed graphs Justin Salez Joint work with C. Bordenave and P. Caputo Outline of the talk Outline of the talk 1. The cutoff phenomenon for Markov chains
More informationEvolution in prey-predator systems
Darwin: Le hasard et l évolution S. Méléard, Ecole Polytechnique, Centre de Mathématiques CMAP, École Polytechnique Appliquées in collaboration with N. Loeuille, C. Hauzy and S. Méléard 02/04/2013, Aussois
More information18.175: Lecture 8 Weak laws and moment-generating/characteristic functions
18.175: Lecture 8 Weak laws and moment-generating/characteristic functions Scott Sheffield MIT 18.175 Lecture 8 1 Outline Moment generating functions Weak law of large numbers: Markov/Chebyshev approach
More information2012 NCTS Workshop on Dynamical Systems
Barbara Gentz gentz@math.uni-bielefeld.de http://www.math.uni-bielefeld.de/ gentz 2012 NCTS Workshop on Dynamical Systems National Center for Theoretical Sciences, National Tsing-Hua University Hsinchu,
More informationGravitational allocation to Poisson points
Gravitational allocation to Poisson points Sourav Chatterjee joint work with Ron Peled Yuval Peres Dan Romik Allocation rules Let Ξ be a discrete subset of R d. An allocation (of Lebesgue measure to Ξ)
More informationMAS1302 Computational Probability and Statistics
MAS1302 Computational Probability and Statistics April 23, 2008 3. Simulating continuous random behaviour 3.1 The Continuous Uniform U(0,1) Distribution We have already used this random variable a great
More informationEffective dynamics for the (overdamped) Langevin equation
Effective dynamics for the (overdamped) Langevin equation Frédéric Legoll ENPC and INRIA joint work with T. Lelièvre (ENPC and INRIA) Enumath conference, MS Numerical methods for molecular dynamics EnuMath
More information1 Continuous-time chains, finite state space
Université Paris Diderot 208 Markov chains Exercises 3 Continuous-time chains, finite state space Exercise Consider a continuous-time taking values in {, 2, 3}, with generator 2 2. 2 2 0. Draw the diagramm
More informationLecture Notes 2 Random Variables. Discrete Random Variables: Probability mass function (pmf)
Lecture Notes 2 Random Variables Definition Discrete Random Variables: Probability mass function (pmf) Continuous Random Variables: Probability density function (pdf) Mean and Variance Cumulative Distribution
More informationAn introduction to Birkhoff normal form
An introduction to Birkhoff normal form Dario Bambusi Dipartimento di Matematica, Universitá di Milano via Saldini 50, 0133 Milano (Italy) 19.11.14 1 Introduction The aim of this note is to present an
More informationThe parabolic Anderson model on Z d with time-dependent potential: Frank s works
Weierstrass Institute for Applied Analysis and Stochastics The parabolic Anderson model on Z d with time-dependent potential: Frank s works Based on Frank s works 2006 2016 jointly with Dirk Erhard (Warwick),
More informationP i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=
2.7. Recurrence and transience Consider a Markov chain {X n : n N 0 } on state space E with transition matrix P. Definition 2.7.1. A state i E is called recurrent if P i [X n = i for infinitely many n]
More informationSTEIN MEETS MALLIAVIN IN NORMAL APPROXIMATION. Louis H. Y. Chen National University of Singapore
STEIN MEETS MALLIAVIN IN NORMAL APPROXIMATION Louis H. Y. Chen National University of Singapore 215-5-6 Abstract Stein s method is a method of probability approximation which hinges on the solution of
More informationCSCI-6971 Lecture Notes: Probability theory
CSCI-6971 Lecture Notes: Probability theory Kristopher R. Beevers Department of Computer Science Rensselaer Polytechnic Institute beevek@cs.rpi.edu January 31, 2006 1 Properties of probabilities Let, A,
More informationANALYSIS QUALIFYING EXAM FALL 2016: SOLUTIONS. = lim. F n
ANALYSIS QUALIFYING EXAM FALL 206: SOLUTIONS Problem. Let m be Lebesgue measure on R. For a subset E R and r (0, ), define E r = { x R: dist(x, E) < r}. Let E R be compact. Prove that m(e) = lim m(e /n).
More informationR. Lachieze-Rey Recent Berry-Esseen bounds obtained with Stein s method andgeorgia PoincareTech. inequalities, 1 / with 29 G.
Recent Berry-Esseen bounds obtained with Stein s method and Poincare inequalities, with Geometric applications Raphaël Lachièze-Rey, Univ. Paris 5 René Descartes, Georgia Tech. R. Lachieze-Rey Recent Berry-Esseen
More information07. Stochastic Processes: Applications
University of Rhode Island DigitalCommons@URI Nonequilibrium Statistical Physics Physics Course Materials 10-19-2015 07. Stochastic Processes: Applications Gerhard Müller University of Rhode Island, gmuller@uri.edu
More informationPoisson Process Approximation: From Palm Theory to Stein s Method
IMS Lecture Notes Monograph Series c Institute of Mathematical Statistics Poisson Process Approximation: From Palm Theory to Stein s Method Louis H. Y. Chen 1 and Aihua Xia 2 National University of Singapore
More informationLTCC. Exercises solutions
1. Markov chain LTCC. Exercises solutions (a) Draw a state space diagram with the loops for the possible steps. If the chain starts in state 4, it must stay there. If the chain starts in state 1, it will
More information