SUPPLEMENT TO PAPER CONVERGENCE OF ADAPTIVE AND INTERACTING MARKOV CHAIN MONTE CARLO ALGORITHMS
|
|
- Charles Richards
- 6 years ago
- Views:
Transcription
1 Submitted to the Annals of Statistics SUPPLEMENT TO PAPER CONERGENCE OF ADAPTIE AND INTERACTING MARKO CHAIN MONTE CARLO ALGORITHMS By G Fort,, E Moulines and P Priouret LTCI, CNRS - TELECOM ParisTech, LPMA, Université Pierre et Marie Curie This supplement provides a detailed proof of Lemma 42 and Propositions 31, 43 and 52 of Fort, Moulines and Priouret (2010 It also contains a discussion on the setwise convergence of transition kernels (see Section 1 For completeness and ease of references, we repeat the assumptions and the main notations For : X [1, and, Θ, denote by D (, the -variation of the kernels P and P (1 D (, P (x, P (x, = sup x X (x When 1, we use the simpler notation D(, Consider the following assumption: A1 For any Θ, there exists a probability distribution π such that π P = π A2 (a For any ε > 0, there exists a non-decreasing positive sequence {r ε (n,n 0} such that lim sup n r ε (n/n = 0 and [ ] P r lim sup E ε(n T n n rε(n (X n rε(n, π n rε(n ε (b For any ε > 0, lim n rε(n 1 where D is ined in (1 E [ ] D( n rε(n+j, n rε(n = 0, A3 k=1 k 1 ( L k L k 1 6 D ( k, k 1 (X k < + P-as, where D and L are ined in (1 and (3 A4 (a lim sup n π n ( < +, P-as (b For some α > 1, k=0 (k + 1 α L 2α k Corresponding author 1 P k α (X k < +, P-as
2 2 G FORT ET AL A5 For all Θ, P is phi-irreducible, aperiodic and there exist a function : X [1,+, and for any Θ there exist some constants b <, δ (0,1, λ (0,1 and a probability measure ν on X such that P λ + b, P (x, δ ν ( ½ { c }(x c = 2b (1 λ 1 1 For any ε > 0, x X, Θ, set (2 M ε (x, = inf{n 0, P n (x, π T ε} For any Θ, set { (3 L = C (1 ρ 1 C b δ 1 (1 λ 1} γ, where C and ρ (0,1 are finite constants such that P n (x, π C ρ n (x 1 Setwise convergence of kernels In many situations (see eg (Fort, Moulines and Priouret, 2010, Section 3, we are able to prove that for (a fixed x X and any A X, there exists Ω A such that P(Ω A = 1 and for any ω Ω A, lim n P n(ω(x,a = P (x,a This implies that if B 0 is a countable algebra generating the σ-algebra X, there exists Ω 0 such that P(Ω 0 = 1 and for any ω Ω 0 and A B 0, lim n P n(ω(x,a = P (x,a Therefore, we are faced to the question: does it imply that there exists Ω such that P(Ω = 1 and for any ω Ω and A X, lim n P n(ω(x,a = P (x,a The answer is no, in general, as illustrated by the following counter-example Counter-Example: Set P (x,a = µ(a and P n(ω(x,a = µ n (ω,a where µ is a probability distribution such that for any x X, µ({x} = 0
3 SUPPLEMENT 3 µ n (ω,a = n 1 n k=1 ½ A (X k (ω with {X k,k 1} iid rv ined on (Ω, F, P taking value in (X, X, with distribution µ Then, by the strong law of large numbers, for any A X, lim n µ n (,A = µ(a P-as İf we take a countable family of measurable sets B 0, then we may find a P-full set D Ω, such that for any ω D, and A B 0, lim n µ n (ω,a = µ(a Of course, B 0 can be an algebra, and even an algebra generating X Nevertheless, it is wrong to assume that this condition implies the setwise convergence, ie that lim n µ n (ω,a = µ(a for any ω D and A X To see why this is wrong, choose ω D and set A = n {X n(ω } Then µ n (ω,a = 1 for any n, and µ(a = 0 lim n µ n (ω,a 2 Proof of (Fort, Moulines and Priouret, 2010, Proposition 31 I1 π is a continuous positive density on X and π < + I2 (a P is a phi-irreducible aperiodic Feller transition kernel on (X, X such that πp = π (b There exist τ (0,1/T, λ (0,1 and b < + such that (4 PW λw + b with W(x = (π(x/ π τ (c For any p (0, π, the sets {π p} are 1-small (wrt the transition kernel P Proposition (Proposition 31 in Fort, Moulines and Priouret (2010 Assume I1, I2 There exist λ (0,1, b <, such that, for any Θ, P W(x λw(x + b(w In addition, for any p (0, π, the level sets {π p} are 1-small wrt the transition kernels P (whatever and the minorization constant does not depend upon Proof We prove the drift inequality with a = 1 The proof for a < 1 follows from the Jensen s inequality The proof is adapted from (Atchadé, 2010, Lemma 41 Under I2b, we have P W(x (1 υ λ W(x + (1 υ b + υw(x + υ α(x,y {W(y W(x}(dy
4 4 G FORT ET AL By inition of W and of the acceptance ratio α, α(x,y {W(y W(x} (dy ( { } = W(y 1 πβ (y π β 1 πτ (y (x π τ (dy (x { } W(y πβ (y {y,π(y π(x} π β 1 πτ (y (x π τ (dy (x Ψ(τ/β (W where we have used that, for a > 0, sup z(1 z a Ψ(a = a/(a + 1 (a+1/a, z [0,1] as in (Atchadé, 2010, Lemma 151 Combining the two latter inequalities yield P W(x [(1 υ λ + υ]w(x + υψ(τ/β(w + (1 υb The proof of the smallness condition relies on the inequality P (x,a (1 υp(x,a 3 Proof of (Fort, Moulines and Priouret, 2010, Lemma 42 Lemma (Lemma 42 Fort, Moulines and Priouret (2010 Assume A5 For any Θ, let F : X R + be a measurable function such that sup F < + and ine ˆF = n 0P n {F π (F } For any, Θ, (5 π π L 2 { π ( + L 2 (x } D (,, and (6 P ˆF P ˆF sup F Θ L 2 ( L D (, + π π + L 2 F F where L is given by (3
5 SUPPLEMENT 5 Proof The proof of this Lemma is closely related to (Andrieu and Moulines, 2006, Proposition 3 and its refinement in Andrieu et al (2011 These types of results have a rather long history: Benveniste, Métivier and Priouret (1990 and Glynn and Meyn (1996 and the references therein for early references We first establish (5 For any k 1, we decompose P kf Pk f as follows k 1 P k f P k f = ( P j (P P P k j 1 f π (f Under A5, there exist constants C and ρ (0,1 such that P k(x, π C ρ k (x Therefore, for any k 1 and x X, π π π P k (x, + P k (x, P k (x, + P k (x, π (C ρ k + C ρ k (x k 1 ( + sup P j (P P P k j 1 f π (f (x f 1 The second term on the RHS is upper bounded by C D (, k 1 C D (, C 1 ρ ρ k j 1 P j (x k 1 ρ k j 1 {π ( + C ρ j } (x D (, (π ( + C (x Therefore π π (C ρ k + C ρ k (x + C 1 ρ D (, (π ( + C (x which implies the desired result by taking the limit as k + We then establish (6 Under A5, ˆF exists (see (20 of Fort, Moulines and Priouret (2010 and P ˆF (x P ˆF (x = P n {F π (F } n 1 n 1P n {F π (F }
6 6 G FORT ET AL We first show (7 P ˆF P ˆF = n 1 n 1 ( ( P j π (P P P n j 1 F π (F {P n (F F π (F F } {P n 1 n 1π n F π (F } Following the same lines as in (Andrieu and Moulines, 2006, Proposition 3, we have for any n 1, P n f P n f = = n 1 + n 1 n 1 ( ( P j π (P P { π P n j 1 f π P n j ( ( P j π (P P P n j 1 } f P n j 1 f π (f where we used that π P = π Hence, for any n 1, and n 1 P n F P n F = f π (f + π (f π P n f, ( ( P j π (P P P n j 1 F π (F + π (F π P n F + P n (F F P n {F π (F } P n {F π (F } = n 1 ( ( P j π (P P P n j 1 F π (F {P n F π (F } + {P n F π (F } π {P n F π (F } This yields (7 We consider the first term in (7: by Lemma 23 in Fort, Moulines and Priouret (2010 ( ( P j π (P P P n j 1 F π (F C C ρ n 1 j ρ j sup F D (,
7 thus implying SUPPLEMENT 7 n 1 ( ( P j π (P P P n j 1 F π (F n 1 L 2 L 2 sup F D (, Consider now the second term on the RHS of (7 By Lemma 23 in Fort, Moulines and Priouret (2010, P n (F F (x π (F F C ρ n (x F F thus implying P n (F F (x π (F F L 2 (x F F n 1 Finally, the third term on the RHS of (7 can be bounded by π {P n F π (F } = (π π {P n F π (F } π π C ρ n sup F, so that π {P n F π (F } π π L 2 n sup F 4 Proof of (Fort, Moulines and Priouret, 2010, Proposition 43 Proposition (Proposition 43 Fort, Moulines and Priouret (2010 Let X be a Polish space endowed with its Borel σ-field X Let µ and {µ n,n 1} be probability distributions on (X, X Let {f n,n 0} be an equicontinuous family of functions from X to R Assume (i the sequence {µ n,n 0} converges weakly to µ (ii for any x X, lim n f n (x exists, and there exists α > 1 such that sup n µ n ( f n α + µ( lim n f n < + Then, µ n (f n µ(lim n f n
8 8 G FORT ET AL Proof Set f = lim n f n Under the stated assumptions, f is continuous We can assume without loss of generality that f n,f are non-negative functions Let c,ε be positive constants We decompose µ n (f n µ(f µ n (f n µ(f = µ n (f n c µ(f c+µ n ((f n c½ {fn>c} µ ((f c½ {f>c} Choose c large enough so that sup n µ n (fn α/cα 1 + µ(f½ {f>c} ε Then upon noting that ½ {f>c} (f/c α 1, ( ( µ n (f n c½ {fn>c} µ (f c½ {f>c} µ n(fn α c α 1 + µ(f½ {f>c} ε Consider now the bounded functions {f n c,n 0} and f c We write (8 µ n (f n c µ(f c µ n ( f n c f c + µ n (f c µ(f c The sequence {µ n,n 0} is relatively compact and thus tight since X is Polish ((Billingsley, 1999, Theorem 52 Then, for ε > 0, there exists a compact set K such that sup n µ n (K c ε Then µ n ( f n c f c sup K f n c f c +2cµ n (K c sup f n c f c +2cε K Under the stated assumptions, the family of functions { f n = f n c f c,n 0} are equicontinuous, and lim n fn = 0 By (Royden, 1988, Lemma 39, Chapter 7, the convergence is uniform on compact sets Consider now the second term on the RHS of (8 Since f c is a bounded continuous function and {µ n,n 0} converges weakly to µ, lim n µ n (f c = µ(f c This concludes the proof 5 Proof of (Fort, Moulines and Priouret, 2010, Proposition 52 Let (U,δ be a metric space; recall that for a real-valued function f on U, the Lipschitz semi-norm is ined by Denote the supremum norm f(x f(y f Lip(U,δ = sup x =y,(x,y U 2 δ(x, y f,u = sup f(x Let f BL(U,δ = f Lip(U,δ + f,u Here, BL stands for bounded Lipschitz and BL(U, δ is the set of all bounded real valued Lipschitz functions on (U,δ Recall the following extension Theorem for bounded Lipschitz functions (Dudley, 2002, Proposition 1123 x U
9 SUPPLEMENT 9 Theorem 51 If U and f BL(U,δ then f can be extended to a function h BL(,δ with h = f on and h BL(,δ = f BL(U,δ Recall also that if (U,δ is compact, then the set of continuous functions coincides with the set of continuous bounded functions C b (U,δ Theorem 52 If (, δ is a compact metric space, the space of bounded Lipschitz functions BL(,δ equipped with the supremum norm, is a separable space Proof By (Dudley, 2002, Corollary 1125, the space of bounded continuous function C b (,δ equipped with the supremum norm, is separable; denote by {f i,i N} C b (,δ a dense family of bounded functions in C b (,δ for the supremum norm Since, (Dudley, 2002, Proposition 1124, BL(,δ is dense in C b (,δ for the supremum norm,, for any n N and then any p N, we may choose f n,p BL(,δ such that f n f n,p, 1/p By construction, the countable family of function {f n,p,(n,p N 2 } is dense in BL(,δ equipped with the supremum norm Finally, the set of bounded Lipschitz functions is convergence determining (Dudley, 2002, Theorem 1133 Theorem 53 Let µ and {µ n,n 0} be distributions on a separable metric space (U, δ endowed with its Borel σ-field The following properties are equivalent (a {µ n,n 0} converges weakly to µ (b {µ n (f,n 0} converges to µ(f for any function f BL(U,δ Lemma 54 Let (U,d be a separable metric space There exists a metric δ on U ining the same topology as d, such that the space of bounded Lipschitz functions BL(U,δ equipped with the supremum norm,u is separable Proof By (Dudley, 2002, Theorem 282, there exist a space and a metric δ on such that U, (,δ is a compact metric space and U is dense in for the metric δ Denote by {ψ k,k N} BL(,δ be a countable family of functions which is dense in BL(,δ equipped with the supremum norm; see Theorem 52 For any k N, denote by φ k the restriction of the function ψ k to U Clearly, for any k N, φ k BL(U,δ By Theorem 51, for any f BL(U,δ,
10 10 G FORT ET AL there is a function h BL(,δ with f = h on U and h BL(,δ = f BL(U,δ Since for any k 0, sup x U f(x φ k (x sup h(x ψ k (x x the set {φ k,k 0} is dense in BL(U,δ equipped with the supremum norm,u Proposition (Proposition 52 in Fort, Moulines and Priouret (2010 Let (U,d be a metric space equipped with its Borel σ-field B(U Let (Ω, A, P be a probability space, µ be a distribution on (U, B(U and {K n,n 0} be a family of Markov transition kernels K n : Ω B(U [0,1] Assume that, for any f C b (U,d Ω f = {ω Ω : lim sup K n (ω,f µ(f = 0}, n is a P-full set Then { ω Ω : f C b (U,d } lim sup K n (ω,f µ(f = 0 n, is a P-full set Proof By Lemma 54, there is a metric δ on U ining the same topology as d and a countable family {φ k,k 0} BL(U,δ which is dense in the space BL(U,δ equipped with supremum norm,u For any ε > 0 and any function f BL(U,δ, there exists k 0 such that f φ k ε By Theorem 53, it suffices to show that there exists a P-full set Ω 1 such that for any ω Ω 1 and any function f BL(U,δ, lim sup n µ n (ω,f µ(f = 0 Set Ω 1 = k Ω φ k Since P(Ω φk = 1, then P(Ω 1 = 1 For any ω Ω 1, we have µ n (ω,f µ(f µ n (ω,f µ n (φ k + µ n (ω,φ k µ(φ k + µ(φ k µ(f 2 f φ k + µ n (ω,φ k µ(φ k 2ε + µ n (ω,φ k µ(φ k and this concludes the proof since by inition of Ω 1, lim n µ n (ω,φ k = µ(φ k
11 References SUPPLEMENT 11 Andrieu, C and Moulines, E (2006 On the ergodicity property of some adaptive MCMC algorithms Ann Appl Probab Andrieu, C, Jasra, A, Doucet, A and Del Moral, P (2011 On non-linear Markov chain Monte Carlo Bernoulli Atchadé, Y (2010 A cautionary tale on the efficiency of some adaptive Monte Carlo schemes Ann Appl Probab Benveniste, A, Métivier, M and Priouret, P (1990 Adaptive Algorithms and Stochastic Approximations 22 Springer, Berlin Translated from the French by Stephen S S Wilson Billingsley, P (1999 Convergence of probability measures, Second ed Wiley Series in Probability and Statistics: Probability and Statistics John Wiley & Sons Inc, New York A Wiley-Interscience Publication Dudley, R M (2002 Real Analysis and Probability Cambridge University Press Fort, G, Moulines, E and Priouret, P (2010 Convergence of adaptive MCMC algorithms: ergodicity and law of large numbers Technical Report submitted to Ann Statist Glynn, P W and Meyn, S P (1996 A Liapounov bound for solutions of the Poisson equation Ann Probab Royden, H L (1988 Real analysis, Third ed Macmillan Publishing Company, New York MR (90g:00004 G Fort and E Moulines LTCI, TELECOM ParisTech-CNRS 46 rue Barrault Paris Cédex 13, France, gersendefort@telecom-paristechfr ericmoulines@telecom-paristechfr P Priouret LPMA, Université Pierre et Marie Curie (P6 Boîte courrier PARIS Cedex 05, France, priouret@ccrjussieufr
Perturbed Proximal Gradient Algorithm
Perturbed Proximal Gradient Algorithm Gersende FORT LTCI, CNRS, Telecom ParisTech Université Paris-Saclay, 75013, Paris, France Large-scale inverse problems and optimization Applications to image processing
More informationLecture 10. Theorem 1.1 [Ergodicity and extremality] A probability measure µ on (Ω, F) is ergodic for T if and only if it is an extremal point in M.
Lecture 10 1 Ergodic decomposition of invariant measures Let T : (Ω, F) (Ω, F) be measurable, and let M denote the space of T -invariant probability measures on (Ω, F). Then M is a convex set, although
More informationSimultaneous drift conditions for Adaptive Markov Chain Monte Carlo algorithms
Simultaneous drift conditions for Adaptive Markov Chain Monte Carlo algorithms Yan Bai Feb 2009; Revised Nov 2009 Abstract In the paper, we mainly study ergodicity of adaptive MCMC algorithms. Assume that
More informationSUMMARY OF RESULTS ON PATH SPACES AND CONVERGENCE IN DISTRIBUTION FOR STOCHASTIC PROCESSES
SUMMARY OF RESULTS ON PATH SPACES AND CONVERGENCE IN DISTRIBUTION FOR STOCHASTIC PROCESSES RUTH J. WILLIAMS October 2, 2017 Department of Mathematics, University of California, San Diego, 9500 Gilman Drive,
More informationMonte Carlo methods for sampling-based Stochastic Optimization
Monte Carlo methods for sampling-based Stochastic Optimization Gersende FORT LTCI CNRS & Telecom ParisTech Paris, France Joint works with B. Jourdain, T. Lelièvre, G. Stoltz from ENPC and E. Kuhn from
More informationA regeneration proof of the central limit theorem for uniformly ergodic Markov chains
A regeneration proof of the central limit theorem for uniformly ergodic Markov chains By AJAY JASRA Department of Mathematics, Imperial College London, SW7 2AZ, London, UK and CHAO YANG Department of Mathematics,
More informationAdaptive Markov Chain Monte Carlo: Theory and Methods
Chapter Adaptive Markov Chain Monte Carlo: Theory and Methods Yves Atchadé, Gersende Fort and Eric Moulines 2, Pierre Priouret 3. Introduction Markov chain Monte Carlo (MCMC methods allow to generate samples
More informationSome Results on the Ergodicity of Adaptive MCMC Algorithms
Some Results on the Ergodicity of Adaptive MCMC Algorithms Omar Khalil Supervisor: Jeffrey Rosenthal September 2, 2011 1 Contents 1 Andrieu-Moulines 4 2 Roberts-Rosenthal 7 3 Atchadé and Fort 8 4 Relationship
More informationChapter 7. Markov chain background. 7.1 Finite state space
Chapter 7 Markov chain background A stochastic process is a family of random variables {X t } indexed by a varaible t which we will think of as time. Time can be discrete or continuous. We will only consider
More informationRandom Process Lecture 1. Fundamentals of Probability
Random Process Lecture 1. Fundamentals of Probability Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/43 Outline 2/43 1 Syllabus
More informationOn Reparametrization and the Gibbs Sampler
On Reparametrization and the Gibbs Sampler Jorge Carlos Román Department of Mathematics Vanderbilt University James P. Hobert Department of Statistics University of Florida March 2014 Brett Presnell Department
More informationA generalization of Dobrushin coefficient
A generalization of Dobrushin coefficient Ü µ ŒÆ.êÆ ÆÆ 202.5 . Introduction and main results We generalize the well-known Dobrushin coefficient δ in total variation to weighted total variation δ V, which
More informationA generic property of families of Lagrangian systems
Annals of Mathematics, 167 (2008), 1099 1108 A generic property of families of Lagrangian systems By Patrick Bernard and Gonzalo Contreras * Abstract We prove that a generic Lagrangian has finitely many
More informationITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XL 2002 ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES by Joanna Jaroszewska Abstract. We study the asymptotic behaviour
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More informationActa Universitatis Carolinae. Mathematica et Physica
Acta Universitatis Carolinae. Mathematica et Physica František Žák Representation form of de Finetti theorem and application to convexity Acta Universitatis Carolinae. Mathematica et Physica, Vol. 52 (2011),
More informationOPTIMAL SOLUTIONS TO STOCHASTIC DIFFERENTIAL INCLUSIONS
APPLICATIONES MATHEMATICAE 29,4 (22), pp. 387 398 Mariusz Michta (Zielona Góra) OPTIMAL SOLUTIONS TO STOCHASTIC DIFFERENTIAL INCLUSIONS Abstract. A martingale problem approach is used first to analyze
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationψ(t) := log E[e tx ] (1) P X j x e Nψ (x) j=1
Seminars 15/01/018 Ex 1. Exponential estimate Let X be a real valued random variable, and suppose that there exists r > 0 such that E[e rx ]
More informationAlmost Sure Convergence of Two Time-Scale Stochastic Approximation Algorithms
Almost Sure Convergence of Two Time-Scale Stochastic Approximation Algorithms Vladislav B. Tadić Abstract The almost sure convergence of two time-scale stochastic approximation algorithms is analyzed under
More informationGLUING LEMMAS AND SKOROHOD REPRESENTATIONS
GLUING LEMMAS AND SKOROHOD REPRESENTATIONS PATRIZIA BERTI, LUCA PRATELLI, AND PIETRO RIGO Abstract. Let X, E), Y, F) and Z, G) be measurable spaces. Suppose we are given two probability measures γ and
More informationAn almost sure invariance principle for additive functionals of Markov chains
Statistics and Probability Letters 78 2008 854 860 www.elsevier.com/locate/stapro An almost sure invariance principle for additive functionals of Markov chains F. Rassoul-Agha a, T. Seppäläinen b, a Department
More informationWeak convergence in Probability Theory A summer excursion! Day 3
BCAM June 2013 1 Weak convergence in Probability Theory A summer excursion! Day 3 Armand M. Makowski ECE & ISR/HyNet University of Maryland at College Park armand@isr.umd.edu BCAM June 2013 2 Day 1: Basic
More informationOutline. A Central Limit Theorem for Truncating Stochastic Algorithms
Outline A Central Limit Theorem for Truncating Stochastic Algorithms Jérôme Lelong http://cermics.enpc.fr/ lelong Tuesday September 5, 6 1 3 4 Jérôme Lelong (CERMICS) Tuesday September 5, 6 1 / 3 Jérôme
More information7 The Radon-Nikodym-Theorem
32 CHPTER II. MESURE ND INTEGRL 7 The Radon-Nikodym-Theorem Given: a measure space (Ω,, µ). Put Z + = Z + (Ω, ). Definition 1. For f (quasi-)µ-integrable and, the integral of f over is (Note: 1 f f.) Theorem
More informationSampling multimodal densities in high dimensional sampling space
Sampling multimodal densities in high dimensional sampling space Gersende FORT LTCI, CNRS & Telecom ParisTech Paris, France Journées MAS Toulouse, Août 4 Introduction Sample from a target distribution
More information{σ x >t}p x. (σ x >t)=e at.
3.11. EXERCISES 121 3.11 Exercises Exercise 3.1 Consider the Ornstein Uhlenbeck process in example 3.1.7(B). Show that the defined process is a Markov process which converges in distribution to an N(0,σ
More informationThe Hopf argument. Yves Coudene. IRMAR, Université Rennes 1, campus beaulieu, bat Rennes cedex, France
The Hopf argument Yves Coudene IRMAR, Université Rennes, campus beaulieu, bat.23 35042 Rennes cedex, France yves.coudene@univ-rennes.fr slightly updated from the published version in Journal of Modern
More informationSEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE
SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE FRANÇOIS BOLLEY Abstract. In this note we prove in an elementary way that the Wasserstein distances, which play a basic role in optimal transportation
More informationIntroduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence
Introduction to Empirical Processes and Semiparametric Inference Lecture 08: Stochastic Convergence Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations
More informationInvariant measures for iterated function systems
ANNALES POLONICI MATHEMATICI LXXV.1(2000) Invariant measures for iterated function systems by Tomasz Szarek (Katowice and Rzeszów) Abstract. A new criterion for the existence of an invariant distribution
More informationarxiv: v1 [math.pr] 17 May 2009
A strong law of large nubers for artingale arrays Yves F. Atchadé arxiv:0905.2761v1 [ath.pr] 17 May 2009 March 2009 Abstract: We prove a artingale triangular array generalization of the Chow-Birnbau- Marshall
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationINVARIANT PROBABILITIES FOR
Applied Mathematics and Stochastic Analysis 8, Number 4, 1995, 341-345 INVARIANT PROBABILITIES FOR FELLER-MARKOV CHAINS 1 ONtSIMO HERNNDEZ-LERMA CINVESTA V-IPN Departamento de Matemticas A. Postal 1-70,
More informationRecall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm
Chapter 13 Radon Measures Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm (13.1) f = sup x X f(x). We want to identify
More informationStable Lévy motion with values in the Skorokhod space: construction and approximation
Stable Lévy motion with values in the Skorokhod space: construction and approximation arxiv:1809.02103v1 [math.pr] 6 Sep 2018 Raluca M. Balan Becem Saidani September 5, 2018 Abstract In this article, we
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationAn invariance result for Hammersley s process with sources and sinks
An invariance result for Hammersley s process with sources and sinks Piet Groeneboom Delft University of Technology, Vrije Universiteit, Amsterdam, and University of Washington, Seattle March 31, 26 Abstract
More informationKERNEL ESTIMATORS OF ASYMPTOTIC VARIANCE FOR ADAPTIVE MARKOV CHAIN MONTE CARLO. By Yves F. Atchadé University of Michigan
Submitted to the Annals of Statistics arxiv: math.pr/0911.1164 KERNEL ESTIMATORS OF ASYMPTOTIC VARIANCE FOR ADAPTIVE MARKOV CHAIN MONTE CARLO By Yves F. Atchadé University of Michigan We study the asymptotic
More informationWeak convergence and Brownian Motion. (telegram style notes) P.J.C. Spreij
Weak convergence and Brownian Motion (telegram style notes) P.J.C. Spreij this version: December 8, 2006 1 The space C[0, ) In this section we summarize some facts concerning the space C[0, ) of real
More information215 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that
15 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that µ ν tv = (1/) x S µ(x) ν(x) = x S(µ(x) ν(x)) + where a + = max(a, 0). Show that
More informationOn Asymptotic Proximity of Distributions
On Asymptotic Proximity of Distributions Youri DAVYDOV 1 and Vladimir ROTAR 2 1 Laboratoire Paul Painlevé - UMR 8524 Université de Lille I - Bat. M2 59655 Villeneuve d Ascq, France Email: youri.davydov@univ-lille1.fr
More informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
More informationCONVOLUTION OPERATORS IN INFINITE DIMENSION
PORTUGALIAE MATHEMATICA Vol. 51 Fasc. 4 1994 CONVOLUTION OPERATORS IN INFINITE DIMENSION Nguyen Van Khue and Nguyen Dinh Sang 1 Introduction Let E be a complete convex bornological vector space (denoted
More informationAn Introduction to Entropy and Subshifts of. Finite Type
An Introduction to Entropy and Subshifts of Finite Type Abby Pekoske Department of Mathematics Oregon State University pekoskea@math.oregonstate.edu August 4, 2015 Abstract This work gives an overview
More informationThe Theory behind PageRank
The Theory behind PageRank Mauro Sozio Telecom ParisTech May 21, 2014 Mauro Sozio (LTCI TPT) The Theory behind PageRank May 21, 2014 1 / 19 A Crash Course on Discrete Probability Events and Probability
More informationRegular Variation and Extreme Events for Stochastic Processes
1 Regular Variation and Extreme Events for Stochastic Processes FILIP LINDSKOG Royal Institute of Technology, Stockholm 2005 based on joint work with Henrik Hult www.math.kth.se/ lindskog 2 Extremes for
More informationREPRESENTABLE BANACH SPACES AND UNIFORMLY GÂTEAUX-SMOOTH NORMS. Julien Frontisi
Serdica Math. J. 22 (1996), 33-38 REPRESENTABLE BANACH SPACES AND UNIFORMLY GÂTEAUX-SMOOTH NORMS Julien Frontisi Communicated by G. Godefroy Abstract. It is proved that a representable non-separable Banach
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationFaithful couplings of Markov chains: now equals forever
Faithful couplings of Markov chains: now equals forever by Jeffrey S. Rosenthal* Department of Statistics, University of Toronto, Toronto, Ontario, Canada M5S 1A1 Phone: (416) 978-4594; Internet: jeff@utstat.toronto.edu
More informationEmpirical Processes: General Weak Convergence Theory
Empirical Processes: General Weak Convergence Theory Moulinath Banerjee May 18, 2010 1 Extended Weak Convergence The lack of measurability of the empirical process with respect to the sigma-field generated
More informationA SKOROHOD REPRESENTATION THEOREM WITHOUT SEPARABILITY PATRIZIA BERTI, LUCA PRATELLI, AND PIETRO RIGO
A SKOROHOD REPRESENTATION THEOREM WITHOUT SEPARABILITY PATRIZIA BERTI, LUCA PRATELLI, AND PIETRO RIGO Abstract. Let (S, d) be a metric space, G a σ-field on S and (µ n : n 0) a sequence of probabilities
More informationMATS113 ADVANCED MEASURE THEORY SPRING 2016
MATS113 ADVANCED MEASURE THEORY SPRING 2016 Foreword These are the lecture notes for the course Advanced Measure Theory given at the University of Jyväskylä in the Spring of 2016. The lecture notes can
More informationMeasurable Choice Functions
(January 19, 2013) Measurable Choice Functions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/choice functions.pdf] This note
More informationNotes of the seminar Evolution Equations in Probability Spaces and the Continuity Equation
Notes of the seminar Evolution Equations in Probability Spaces and the Continuity Equation Onno van Gaans Version of 12 April 2006 These are some notes supporting the seminar Evolution Equations in Probability
More informationA Note on the Central Limit Theorem for a Class of Linear Systems 1
A Note on the Central Limit Theorem for a Class of Linear Systems 1 Contents Yukio Nagahata Department of Mathematics, Graduate School of Engineering Science Osaka University, Toyonaka 560-8531, Japan.
More informationOn Ergodic Impulse Control with Constraint
On Ergodic Impulse Control with Constraint Maurice Robin Based on joint papers with J.L. Menaldi University Paris-Sanclay 9119 Saint-Aubin, France (e-mail: maurice.robin@polytechnique.edu) IMA, Minneapolis,
More informationINTRODUCTION TO MARKOV CHAIN MONTE CARLO
INTRODUCTION TO MARKOV CHAIN MONTE CARLO 1. Introduction: MCMC In its simplest incarnation, the Monte Carlo method is nothing more than a computerbased exploitation of the Law of Large Numbers to estimate
More informationMATH & MATH FUNCTIONS OF A REAL VARIABLE EXERCISES FALL 2015 & SPRING Scientia Imperii Decus et Tutamen 1
MATH 5310.001 & MATH 5320.001 FUNCTIONS OF A REAL VARIABLE EXERCISES FALL 2015 & SPRING 2016 Scientia Imperii Decus et Tutamen 1 Robert R. Kallman University of North Texas Department of Mathematics 1155
More informationMATH5011 Real Analysis I. Exercise 1 Suggested Solution
MATH5011 Real Analysis I Exercise 1 Suggested Solution Notations in the notes are used. (1) Show that every open set in R can be written as a countable union of mutually disjoint open intervals. Hint:
More informationDynamical Systems and Ergodic Theory PhD Exam Spring Topics: Topological Dynamics Definitions and basic results about the following for maps and
Dynamical Systems and Ergodic Theory PhD Exam Spring 2012 Introduction: This is the first year for the Dynamical Systems and Ergodic Theory PhD exam. As such the material on the exam will conform fairly
More informationPractical conditions on Markov chains for weak convergence of tail empirical processes
Practical conditions on Markov chains for weak convergence of tail empirical processes Olivier Wintenberger University of Copenhagen and Paris VI Joint work with Rafa l Kulik and Philippe Soulier Toronto,
More informationMixing time for a random walk on a ring
Mixing time for a random walk on a ring Stephen Connor Joint work with Michael Bate Paris, September 2013 Introduction Let X be a discrete time Markov chain on a finite state space S, with transition matrix
More informationFolland: Real Analysis, Chapter 7 Sébastien Picard
Folland: Real Analysis, Chapter 7 Sébastien Picard Problem 7.2 Let µ be a Radon measure on X. a. Let N be the union of all open U X such that µ(u) =. Then N is open and µ(n) =. The complement of N is called
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationTHEOREMS, ETC., FOR MATH 516
THEOREMS, ETC., FOR MATH 516 Results labeled Theorem Ea.b.c (or Proposition Ea.b.c, etc.) refer to Theorem c from section a.b of Evans book (Partial Differential Equations). Proposition 1 (=Proposition
More informationOn Differentiability of Average Cost in Parameterized Markov Chains
On Differentiability of Average Cost in Parameterized Markov Chains Vijay Konda John N. Tsitsiklis August 30, 2002 1 Overview The purpose of this appendix is to prove Theorem 4.6 in 5 and establish various
More informationConvergence of Feller Processes
Chapter 15 Convergence of Feller Processes This chapter looks at the convergence of sequences of Feller processes to a iting process. Section 15.1 lays some ground work concerning weak convergence of processes
More informationEntropy and Ergodic Theory Lecture 15: A first look at concentration
Entropy and Ergodic Theory Lecture 15: A first look at concentration 1 Introduction to concentration Let X 1, X 2,... be i.i.d. R-valued RVs with common distribution µ, and suppose for simplicity that
More informationMARKOV CHAINS AND HIDDEN MARKOV MODELS
MARKOV CHAINS AND HIDDEN MARKOV MODELS MERYL SEAH Abstract. This is an expository paper outlining the basics of Markov chains. We start the paper by explaining what a finite Markov chain is. Then we describe
More informationCitation Osaka Journal of Mathematics. 41(4)
TitleA non quasi-invariance of the Brown Authors Sadasue, Gaku Citation Osaka Journal of Mathematics. 414 Issue 4-1 Date Text Version publisher URL http://hdl.handle.net/1194/1174 DOI Rights Osaka University
More informationGaussian Random Field: simulation and quantification of the error
Gaussian Random Field: simulation and quantification of the error EMSE Workshop 6 November 2017 3 2 1 0-1 -2-3 80 60 40 1 Continuity Separability Proving continuity without separability 2 The stationary
More informationTail inequalities for additive functionals and empirical processes of. Markov chains
Tail inequalities for additive functionals and empirical processes of geometrically ergodic Markov chains University of Warsaw Banff, June 2009 Geometric ergodicity Definition A Markov chain X = (X n )
More informationEstimation of density level sets with a given probability content
Estimation of density level sets with a given probability content Benoît CADRE a, Bruno PELLETIER b, and Pierre PUDLO c a IRMAR, ENS Cachan Bretagne, CNRS, UEB Campus de Ker Lann Avenue Robert Schuman,
More informationCone-Constrained Linear Equations in Banach Spaces 1
Journal of Convex Analysis Volume 4 (1997), No. 1, 149 164 Cone-Constrained Linear Equations in Banach Spaces 1 O. Hernandez-Lerma Departamento de Matemáticas, CINVESTAV-IPN, A. Postal 14-740, México D.F.
More informationTHE WANG LANDAU ALGORITHM REACHES THE FLAT HISTOGRAM CRITERION IN FINITE TIME
The Annals of Applied Probability 2014, Vol. 24, No. 1, 34 53 DOI: 10.1214/12-AAP913 Institute of Mathematical Statistics, 2014 THE WANG LANDAU ALGORITHM REACHES THE FLAT HISTOGRAM CRITERION IN FINITE
More informationStat 8112 Lecture Notes Weak Convergence in Metric Spaces Charles J. Geyer January 23, Metric Spaces
Stat 8112 Lecture Notes Weak Convergence in Metric Spaces Charles J. Geyer January 23, 2013 1 Metric Spaces Let X be an arbitrary set. A function d : X X R is called a metric if it satisfies the folloing
More informationEQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES
EQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES JEREMY J. BECNEL Abstract. We examine the main topologies wea, strong, and inductive placed on the dual of a countably-normed space
More informationCONDITIONAL ERGODICITY IN INFINITE DIMENSION. By Xin Thomson Tong and Ramon van Handel Princeton University
CONDITIONAL ERGODICITY IN INFINITE DIMENSION By Xin Thomson Tong and Ramon van Handel Princeton University The goal of this paper is to develop a general method to establish conditional ergodicity of infinite-dimensional
More information1 Weak Convergence in R k
1 Weak Convergence in R k Byeong U. Park 1 Let X and X n, n 1, be random vectors taking values in R k. These random vectors are allowed to be defined on different probability spaces. Below, for the simplicity
More informationExpansion and Isoperimetric Constants for Product Graphs
Expansion and Isoperimetric Constants for Product Graphs C. Houdré and T. Stoyanov May 4, 2004 Abstract Vertex and edge isoperimetric constants of graphs are studied. Using a functional-analytic approach,
More informationAnother Riesz Representation Theorem
Another Riesz Representation Theorem In these notes we prove (one version of) a theorem known as the Riesz Representation Theorem. Some people also call it the Riesz Markov Theorem. It expresses positive
More informationThe Arzelà-Ascoli Theorem
John Nachbar Washington University March 27, 2016 The Arzelà-Ascoli Theorem The Arzelà-Ascoli Theorem gives sufficient conditions for compactness in certain function spaces. Among other things, it helps
More informationarxiv: v1 [math.ds] 4 Jan 2019
EPLODING MARKOV OPERATORS BARTOSZ FREJ ariv:1901.01329v1 [math.ds] 4 Jan 2019 Abstract. A special class of doubly stochastic (Markov operators is constructed. These operators come from measure preserving
More informationInteracting Particle Systems. J.M. Swart July 20, 2011
Interacting Particle Systems J.M. Swart July 20, 2011 2 Contents 1 Construction of particle systems 7 1.1 Probability on Polish spaces...................... 7 1.2 Markov chains..............................
More informationInformation Theory and Statistics Lecture 3: Stationary ergodic processes
Information Theory and Statistics Lecture 3: Stationary ergodic processes Łukasz Dębowski ldebowsk@ipipan.waw.pl Ph. D. Programme 2013/2014 Measurable space Definition (measurable space) Measurable space
More informationTheorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension. n=1
Chapter 2 Probability measures 1. Existence Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension to the generated σ-field Proof of Theorem 2.1. Let F 0 be
More information0.1 Uniform integrability
Copyright c 2009 by Karl Sigman 0.1 Uniform integrability Given a sequence of rvs {X n } for which it is known apriori that X n X, n, wp1. for some r.v. X, it is of great importance in many applications
More informationMATH MEASURE THEORY AND FOURIER ANALYSIS. Contents
MATH 3969 - MEASURE THEORY AND FOURIER ANALYSIS ANDREW TULLOCH Contents 1. Measure Theory 2 1.1. Properties of Measures 3 1.2. Constructing σ-algebras and measures 3 1.3. Properties of the Lebesgue measure
More informationMTH 404: Measure and Integration
MTH 404: Measure and Integration Semester 2, 2012-2013 Dr. Prahlad Vaidyanathan Contents I. Introduction....................................... 3 1. Motivation................................... 3 2. The
More informationIntroduction to Empirical Processes and Semiparametric Inference Lecture 09: Stochastic Convergence, Continued
Introduction to Empirical Processes and Semiparametric Inference Lecture 09: Stochastic Convergence, Continued Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and
More informationUniversity of Toronto Department of Statistics
Norm Comparisons for Data Augmentation by James P. Hobert Department of Statistics University of Florida and Jeffrey S. Rosenthal Department of Statistics University of Toronto Technical Report No. 0704
More informationWEAK CONVERGENCES OF PROBABILITY MEASURES: A UNIFORM PRINCIPLE
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 126, Number 10, October 1998, Pages 3089 3096 S 0002-9939(98)04390-1 WEAK CONVERGENCES OF PROBABILITY MEASURES: A UNIFORM PRINCIPLE JEAN B. LASSERRE
More informationDISTRIBUTION OF THE SUPREMUM LOCATION OF STATIONARY PROCESSES. 1. Introduction
DISTRIBUTION OF THE SUPREMUM LOCATION OF STATIONARY PROCESSES GENNADY SAMORODNITSKY AND YI SHEN Abstract. The location of the unique supremum of a stationary process on an interval does not need to be
More informationA NEW PROOF OF THE ATOMIC DECOMPOSITION OF HARDY SPACES
A NEW PROOF OF THE ATOMIC DECOMPOSITION OF HARDY SPACES S. DEKEL, G. KERKYACHARIAN, G. KYRIAZIS, AND P. PETRUSHEV Abstract. A new proof is given of the atomic decomposition of Hardy spaces H p, 0 < p 1,
More informationJensen s inequality for multivariate medians
Jensen s inequality for multivariate medians Milan Merkle University of Belgrade, Serbia emerkle@etf.rs Given a probability measure µ on Borel sigma-field of R d, and a function f : R d R, the main issue
More informationStochastic Dynamic Programming: The One Sector Growth Model
Stochastic Dynamic Programming: The One Sector Growth Model Esteban Rossi-Hansberg Princeton University March 26, 2012 Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, 2012 1 / 31 References
More informationAsymptotics of minimax stochastic programs
Asymptotics of minimax stochastic programs Alexander Shapiro Abstract. We discuss in this paper asymptotics of the sample average approximation (SAA) of the optimal value of a minimax stochastic programming
More information