Asymptotic results for empirical measures of weighted sums of independent random variables

Size: px
Start display at page:

Download "Asymptotic results for empirical measures of weighted sums of independent random variables"

Transcription

1 Asymptotic results for empirical measures of weighted sums of independent random variables B. Bercu and W. Bryc University Bordeaux 1, France Seminario di Probabilità e Statistica Matematica Sapienza Università di Roma, 2009 B. Bercu and W. Bryc Empirical measures of weighted sums 1 / 24

2 Outline 1 Motivation 2 B. Bercu and W. Bryc Empirical measures of weighted sums 2 / 24

3 Outline Motivation 1 Motivation 2 B. Bercu and W. Bryc Empirical measures of weighted sums 3 / 24

4 Let (X n ) be a sequence of random variables and consider the symmetric circulant random matrix A n = 1 n X 1 X 2 X 3 X n 1 X n X 2 X 3 X 4 X n X 1 X 3 X 4 X 5 X 1 X 2 X n X 1 X 2 X n 2 X n 1. Goal. Asymptotic behavior of the empirical spectral distribution F n (x) = 1 n n 1 1 {λk x}. k=0 B. Bercu and W. Bryc Empirical measures of weighted sums 4 / 24

5 Trigonometric weighted sums We shall make use of [ ] n 1 r n = 2 and of the trigonometric weighted sums S n,k = 1 n T n,k = 1 n ( 2πkt X t cos n ( 2πkt X t sin n ), ). B. Bercu and W. Bryc Empirical measures of weighted sums 5 / 24

6 Eigenvalues Motivation Lemma (Bose-Mitra) The eigenvalues of A n are given by if n is even and for all 1 k r n λ 0 = 1 n λ n/2 = 1 n λ k = λ n k = X t, ( 1) t 1 X t, S 2 n,k + T 2 n,k. B. Bercu and W. Bryc Empirical measures of weighted sums 6 / 24

7 Eigenvalues Motivation Lemma (Bose-Mitra) The eigenvalues of A n are given by if n is even and for all 1 k r n λ 0 = 1 n λ n/2 = 1 n λ k = λ n k = X t, ( 1) t 1 X t, S 2 n,k + T 2 n,k. B. Bercu and W. Bryc Empirical measures of weighted sums 6 / 24

8 Eigenvalues Motivation Lemma (Bose-Mitra) The eigenvalues of A n are given by if n is even and for all 1 k r n λ 0 = 1 n λ n/2 = 1 n λ k = λ n k = X t, ( 1) t 1 X t, S 2 n,k + T 2 n,k. B. Bercu and W. Bryc Empirical measures of weighted sums 6 / 24

9 Theorem (Bose-Mitra, 2002) Assume that (X n ) is a sequence of iid random variables such that E[X 1 ] = 0, E[X 2 1 ] = 1, E[ X 1 3 ] <. Then, for each x R, lim E[(F n(x) F (x)) 2 ] = 0 n where F is given by F(x) = 1 exp( x 2 ) if x 0, 2 2 exp( x 2 ) if x 0. Remark. F is the symmetric Rayleigh CDF. B. Bercu and W. Bryc Empirical measures of weighted sums 7 / 24

10 Let (X n ) be a sequence of random variables and consider the empirical periodogram defined, for all λ [ π, π[, by I n (λ) = 1 2 e itλ X n t. At the Fourier frequencies λ k = 2πk, we clearly have n I n (λ k ) = S 2 n,k + T 2 n,k. Goal. Asymptotic behavior of the empirical distribution F n (x) = 1 r n r n 1 {In(λk ) x}. k=1 B. Bercu and W. Bryc Empirical measures of weighted sums 8 / 24

11 Theorem (Kokoszka-Mikosch, 2000) Assume that (X n ) is a sequence of iid random variables such that E[X 1 ] = 0 and E[X1 2 ] = 1. Then, for each x R, lim E[(F n(x) F (x)) 2 ] = 0 n where F is the exponential CDF. Remark. (F n ) also converges uniformly in probability to F. B. Bercu and W. Bryc Empirical measures of weighted sums 9 / 24

12 Let (X n ) be a sequence of iid random variables such that E[X n ] = 0 and E(X 2 n ) = 1 and denote S n = 1 n Theorem (Lacey-Phillip, 1990) X t. The sequence (X n ) satisfies an ASCLT which means that for any x R 1 1 lim n log n t 1 {S t x} = Φ(x) a.s. where Φ stands for the standard normal CDF. B. Bercu and W. Bryc Empirical measures of weighted sums 10 / 24

13 Outline Motivation 1 Motivation 2 B. Bercu and W. Bryc Empirical measures of weighted sums 11 / 24

14 Assumptions Motivation Let (U (n) ) be a family of real rectangular r n n matrices with 1 r n n, satisfying for some constants C, δ > 0 (A 1 ) max 1 k r n, 1 t n u(n) k,t (A 2 ) max 1 k, l r n u (n) k,t u(n) l,t C (log(1 + r n )) 1+δ, δ k,l C (log(1 + r n )) 1+δ. Let (V (n) ) be such a family and assume that (U (n), V (n) ) satisfies (A 3 ) max u (n) k,t v (n) l,t C (log(1 + r n )) 1+δ. 1 k, l r n B. Bercu and W. Bryc Empirical measures of weighted sums 12 / 24

15 Trigonometric weights Motivation (A 1 ) to (A 3 ) are fulfilled in many situations. For example, if [ ] n 1 r n 2 and for the trigonometric weights ( u (n) 2 2πkt k,t = n cos n ( v (n) 2 2πkt k,t = n sin n ), ). We shall make use of the sequences of weighted sums S n,k = u (n) k,t X t and T n,k = v (n) k,t X t. B. Bercu and W. Bryc Empirical measures of weighted sums 13 / 24

16 Motivation Theorem (Bercu-Bryc, 2007) Assume that (X n ) is a sequence of independent random variables such that E[X n ] = 0, E[Xn 2 ] = 1, sup E[ X n 3 ] <. If (A 1 ) and (A 2 ) hold, we have lim sup 1 r n 1 n {Sn,k x} Φ(x) = 0 a.s. x R r n k=1 In addition, under (A 3 ), we also have for all (x, y) R 2, lim n 1 r n r n k=1 1 {Sn,k x,t n,k y} = Φ(x)Φ(y) a.s. B. Bercu and W. Bryc Empirical measures of weighted sums 14 / 24

17 Sketch of proof Motivation For all s, t R, let Φ n (s, t) = 1 r n Lemma (Bercu-Bryc, 2007) r n k=1 exp(iss n,k + itt n,k ). Under (A 1 ) to (A 3 ), one can find some constant C(s, t) > 0 such that for n large enough [ E Φ n (s, t) Φ(s, t) 2] where Φ(s, t) = exp( (s 2 + t 2 )/2). C(s, t) (log(1 + r n )) 1+δ B. Bercu and W. Bryc Empirical measures of weighted sums 15 / 24

18 Lemma (Lyons, 1988) Let (Y n,k ) be a sequence of uniformly bounded C-valued random variables and denote Z n = 1 r n r n k=1 Y n,k. Assume that for some constant C > 0, E[ Z n 2 ] Then, (Z n ) converges to zero a.s. C (log(1 + r n )) 1+δ. By the two lemmas, we have for all s, t R, lim Φ n(s, t) = Φ(s, t) n a.s. B. Bercu and W. Bryc Empirical measures of weighted sums 16 / 24

19 Corollary The result of Bose and Mitra on empirical spectral distributions of symmetric circulant random matrices holds with probability one Corollary lim sup F n (x) F(x) = 0 a.s. n x R The result of Kokoszka and Mikosch on empirical distributions of periodograms at Fourier frequencies holds with probability one if sup E[ X n 3 ] < lim sup F n (x) (1 exp( x)) = 0 a.s. n x 0 B. Bercu and W. Bryc Empirical measures of weighted sums 17 / 24

20 Sketch of proof Motivation The empirical measure ν n = 1 r n r n k=1 δ (Sn,k,T n,k ) ν a.s. where ν stands for the product of two independent normal probability measure. Let h be the continuous mapping h(x, y) = 1 2 (x 2 + y 2 ). F n is the CDF of µ n = ν n (h). Consequently, as µ n µ a.s. where µ = ν(h) is the exponential probability measure lim F n(x) = 1 exp( x) n a.s. B. Bercu and W. Bryc Empirical measures of weighted sums 18 / 24

21 In all the sequel, we only deal with trigonometric weights. We shall make use of Sakhanenko s strong approximation lemma. Definition. A sequence (X n ) of independent random variables satisfies Sakhanenko s condition if E[X n ] = 0, E[X 2 n ] = 1 and for some constant a > 0, (S) sup a E[ X n 3 exp(a X n )] 1. n 1 Remark. Sakhanenko s condition is stronger than Cramér s condition as it implies for all t a/3 sup E[exp(tX n )] exp(t 2 ). n 1 B. Bercu and W. Bryc Empirical measures of weighted sums 19 / 24

22 A keystone lemma Motivation Lemma (Sakhanenko, 1984) Assume that (X n ) is a sequence of independent random variables satisfying (S). Then, one can construct a sequence (Y n ) of iid N (0, 1) random variables such that, if S n = X t and T n = then, for some constant c > 0, [ ( )] E exp ac max S t T t 1 t n Y t 1 + na. B. Bercu and W. Bryc Empirical measures of weighted sums 20 / 24

23 Theorem (Bercu-Bryc, 2007) Assume that (X n ) is a sequence of independent random variables satisfying (S). Suppose that (log n) 2 r 3 n =o(n). Then, for all x R, 1 rn r n k=1 (1 {Sn,k x} Φ(x)) In addition, we also have 1 r n rn sup 1 x R {Sn,k x} Φ(x) r n k=1 L N (0, Φ(x)(1 Φ(x))). L n + K where K stands for the Kolmogorov-Smirnov distribution. B. Bercu and W. Bryc Empirical measures of weighted sums 21 / 24

24 Remark. K is the distribution of the supremum of the absolute value of the Brownian bridge. For all x > 0, P(K x) = ( 1) k exp( 2k 2 x 2 ). k=1 Remark. One can observe that the CLT also holds if (S) is replaced by the assumption that for some p > 0 sup E[ X n 2+p ] <, n 1 as soon as r 3 n = o(n p/(2+p) ). B. Bercu and W. Bryc Empirical measures of weighted sums 22 / 24

25 Relative entropy Motivation We are interested in the large deviation principle for the random empirical measure µ n = 1 r n δ Sn,k. r n k=1 The relative entropy with respect to the standard normal law with density φ is given, for all ν M 1 (R), by I(ν) = R log f (x) φ(x) f (x)dx if ν is absolutely continuous with density f and the integral exists and I(ν) = + otherwise. B. Bercu and W. Bryc Empirical measures of weighted sums 23 / 24

26 Theorem (Bercu-Bryc, 2007) Assume that (X n ) is a sequence of independent random variables satisfying (S). Suppose that log n =o(r n ), r 4 n =o(n). Then, (µ n ) satisfies an LDP with speed (r n ) and good rate function I, Upper bound: for any closed set F M 1 (R), lim sup n 1 r n log P(µ n F) inf ν F I(ν). Lower bound: for any open set G M 1 (R), lim inf n 1 r n log P(µ n G) inf ν G I(ν). B. Bercu and W. Bryc Empirical measures of weighted sums 24 / 24

27 Theorem (Bercu-Bryc, 2007) Assume that (X n ) is a sequence of independent random variables satisfying (S). Suppose that log n =o(r n ), r 4 n =o(n). Then, (µ n ) satisfies an LDP with speed (r n ) and good rate function I, Upper bound: for any closed set F M 1 (R), lim sup n 1 r n log P(µ n F) inf ν F I(ν). Lower bound: for any open set G M 1 (R), lim inf n 1 r n log P(µ n G) inf ν G I(ν). B. Bercu and W. Bryc Empirical measures of weighted sums 24 / 24

Asymptotic results for empirical measures of weighted sums of independent random variables

Asymptotic results for empirical measures of weighted sums of independent random variables Asymptotic results for empirical measures of weighted sums of independent random variables B. Bercu and W. Bryc University Bordeaux 1, France Workshop on Limit Theorems, University Paris 1 Paris, January

More information

A new method to bound rate of convergence

A new method to bound rate of convergence A new method to bound rate of convergence Arup Bose Indian Statistical Institute, Kolkata, abose@isical.ac.in Sourav Chatterjee University of California, Berkeley Empirical Spectral Distribution Distribution

More information

H 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

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

Stat 710: Mathematical Statistics Lecture 31

Stat 710: Mathematical Statistics Lecture 31 Stat 710: Mathematical Statistics Lecture 31 Jun Shao Department of Statistics University of Wisconsin Madison, WI 53706, USA Jun Shao (UW-Madison) Stat 710, Lecture 31 April 13, 2009 1 / 13 Lecture 31:

More information

Asymptotic Statistics-VI. Changliang Zou

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

A remark on the maximum eigenvalue for circulant matrices

A remark on the maximum eigenvalue for circulant matrices IMS Collections High Dimensional Probability V: The Luminy Volume Vol 5 (009 79 84 c Institute of Mathematical Statistics, 009 DOI: 04/09-IMSCOLL5 A remark on the imum eigenvalue for circulant matrices

More information

Lecture I: Asymptotics for large GUE random matrices

Lecture I: Asymptotics for large GUE random matrices Lecture I: Asymptotics for large GUE random matrices Steen Thorbjørnsen, University of Aarhus andom Matrices Definition. Let (Ω, F, P) be a probability space and let n be a positive integer. Then a random

More information

Notes on uniform convergence

Notes on uniform convergence Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean

More information

Small ball probabilities and metric entropy

Small ball probabilities and metric entropy Small ball probabilities and metric entropy Frank Aurzada, TU Berlin Sydney, February 2012 MCQMC Outline 1 Small ball probabilities vs. metric entropy 2 Connection to other questions 3 Recent results for

More information

Introduction to Self-normalized Limit Theory

Introduction to Self-normalized Limit Theory Introduction to Self-normalized Limit Theory Qi-Man Shao The Chinese University of Hong Kong E-mail: qmshao@cuhk.edu.hk Outline What is the self-normalization? Why? Classical limit theorems Self-normalized

More information

Large sample covariance matrices and the T 2 statistic

Large sample covariance matrices and the T 2 statistic Large sample covariance matrices and the T 2 statistic EURANDOM, the Netherlands Joint work with W. Zhou Outline 1 2 Basic setting Let {X ij }, i, j =, be i.i.d. r.v. Write n s j = (X 1j,, X pj ) T and

More information

Hypothesis testing for Stochastic PDEs. Igor Cialenco

Hypothesis testing for Stochastic PDEs. Igor Cialenco Hypothesis testing for Stochastic PDEs Igor Cialenco Department of Applied Mathematics Illinois Institute of Technology igor@math.iit.edu Joint work with Liaosha Xu Research partially funded by NSF grants

More information

Negative Association, Ordering and Convergence of Resampling Methods

Negative Association, Ordering and Convergence of Resampling Methods Negative Association, Ordering and Convergence of Resampling Methods Nicolas Chopin ENSAE, Paristech (Joint work with Mathieu Gerber and Nick Whiteley, University of Bristol) Resampling schemes: Informal

More information

Convergence of Eigenspaces in Kernel Principal Component Analysis

Convergence of Eigenspaces in Kernel Principal Component Analysis Convergence of Eigenspaces in Kernel Principal Component Analysis Shixin Wang Advanced machine learning April 19, 2016 Shixin Wang Convergence of Eigenspaces April 19, 2016 1 / 18 Outline 1 Motivation

More information

A Law of the Iterated Logarithm. for Grenander s Estimator

A Law of the Iterated Logarithm. for Grenander s Estimator A Law of the Iterated Logarithm for Grenander s Estimator Jon A. Wellner University of Washington, Seattle Probability Seminar October 24, 2016 Based on joint work with: Lutz Dümbgen and Malcolm Wolff

More information

Continuous dependence estimates for the ergodic problem with an application to homogenization

Continuous dependence estimates for the ergodic problem with an application to homogenization Continuous dependence estimates for the ergodic problem with an application to homogenization Claudio Marchi Bayreuth, September 12 th, 2013 C. Marchi (Università di Padova) Continuous dependence Bayreuth,

More information

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x

More information

Anderson-Darling Type Goodness-of-fit Statistic Based on a Multifold Integrated Empirical Distribution Function

Anderson-Darling Type Goodness-of-fit Statistic Based on a Multifold Integrated Empirical Distribution Function Anderson-Darling Type Goodness-of-fit Statistic Based on a Multifold Integrated Empirical Distribution Function S. Kuriki (Inst. Stat. Math., Tokyo) and H.-K. Hwang (Academia Sinica) Bernoulli Society

More information

National Sun Yat-Sen University CSE Course: Information Theory. Maximum Entropy and Spectral Estimation

National Sun Yat-Sen University CSE Course: Information Theory. Maximum Entropy and Spectral Estimation Maximum Entropy and Spectral Estimation 1 Introduction What is the distribution of velocities in the gas at a given temperature? It is the Maxwell-Boltzmann distribution. The maximum entropy distribution

More information

Rademacher functions

Rademacher functions Rademacher functions Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto July 6, 4 Binary expansions Define S : {, } N [, ] by Sσ σ k k, σ {, }N. For example, for σ and σ,

More information

SDS : Theoretical Statistics

SDS : Theoretical Statistics SDS 384 11: Theoretical Statistics Lecture 1: Introduction Purnamrita Sarkar Department of Statistics and Data Science The University of Texas at Austin https://psarkar.github.io/teaching Manegerial Stuff

More information

Extremogram and Ex-Periodogram for heavy-tailed time series

Extremogram and Ex-Periodogram for heavy-tailed time series Extremogram and Ex-Periodogram for heavy-tailed time series 1 Thomas Mikosch University of Copenhagen Joint work with Richard A. Davis (Columbia) and Yuwei Zhao (Ulm) 1 Jussieu, April 9, 2014 1 2 Extremal

More information

S6880 #7. Generate Non-uniform Random Number #1

S6880 #7. Generate Non-uniform Random Number #1 S6880 #7 Generate Non-uniform Random Number #1 Outline 1 Inversion Method Inversion Method Examples Application to Discrete Distributions Using Inversion Method 2 Composition Method Composition Method

More information

Extremogram and ex-periodogram for heavy-tailed time series

Extremogram and ex-periodogram for heavy-tailed time series Extremogram and ex-periodogram for heavy-tailed time series 1 Thomas Mikosch University of Copenhagen Joint work with Richard A. Davis (Columbia) and Yuwei Zhao (Ulm) 1 Zagreb, June 6, 2014 1 2 Extremal

More information

9. Banach algebras and C -algebras

9. Banach algebras and C -algebras matkt@imf.au.dk Institut for Matematiske Fag Det Naturvidenskabelige Fakultet Aarhus Universitet September 2005 We read in W. Rudin: Functional Analysis Based on parts of Chapter 10 and parts of Chapter

More information

Uniform convergence of N-dimensional Walsh Fourier series

Uniform convergence of N-dimensional Walsh Fourier series STUDIA MATHEMATICA 68 2005 Uniform convergence of N-dimensional Walsh Fourier series by U. Goginava Tbilisi Abstract. We establish conditions on the partial moduli of continuity which guarantee uniform

More information

Self-normalized Cramér-Type Large Deviations for Independent Random Variables

Self-normalized Cramér-Type Large Deviations for Independent Random Variables Self-normalized Cramér-Type Large Deviations for Independent Random Variables Qi-Man Shao National University of Singapore and University of Oregon qmshao@darkwing.uoregon.edu 1. Introduction Let X, X

More information

On large deviations of sums of independent random variables

On large deviations of sums of independent random variables On large deviations of sums of independent random variables Zhishui Hu 12, Valentin V. Petrov 23 and John Robinson 2 1 Department of Statistics and Finance, University of Science and Technology of China,

More information

18.175: Lecture 15 Characteristic functions and central limit theorem

18.175: Lecture 15 Characteristic functions and central limit theorem 18.175: Lecture 15 Characteristic functions and central limit theorem Scott Sheffield MIT Outline Characteristic functions Outline Characteristic functions Characteristic functions Let X be a random variable.

More information

Stratégies bayésiennes et fréquentistes dans un modèle de bandit

Stratégies bayésiennes et fréquentistes dans un modèle de bandit Stratégies bayésiennes et fréquentistes dans un modèle de bandit thèse effectuée à Telecom ParisTech, co-dirigée par Olivier Cappé, Aurélien Garivier et Rémi Munos Journées MAS, Grenoble, 30 août 2016

More information

The Contraction Method on C([0, 1]) and Donsker s Theorem

The Contraction Method on C([0, 1]) and Donsker s Theorem The Contraction Method on C([0, 1]) and Donsker s Theorem Henning Sulzbach J. W. Goethe-Universität Frankfurt a. M. YEP VII Probability, random trees and algorithms Eindhoven, March 12, 2010 joint work

More information

Independent Events. Two events are independent if knowing that one occurs does not change the probability of the other occurring

Independent Events. Two events are independent if knowing that one occurs does not change the probability of the other occurring Independent Events Two events are independent if knowing that one occurs does not change the probability of the other occurring Conditional probability is denoted P(A B), which is defined to be: P(A and

More information

Phase Transitions in a Sequence-Structure Channel. ITA, San Diego, 2015

Phase Transitions in a Sequence-Structure Channel. ITA, San Diego, 2015 Phase Transitions in a Sequence-Structure Channel A. Magner and D. Kihara and W. Szpankowski Purdue University W. Lafayette, IN 47907 January 29, 2015 ITA, San Diego, 2015 Structural Information Information

More information

W. Lenski and B. Szal ON POINTWISE APPROXIMATION OF FUNCTIONS BY SOME MATRIX MEANS OF CONJUGATE FOURIER SERIES

W. Lenski and B. Szal ON POINTWISE APPROXIMATION OF FUNCTIONS BY SOME MATRIX MEANS OF CONJUGATE FOURIER SERIES F A S C I C U L I M A T H E M A T I C I Nr 55 5 DOI:.55/fascmath-5-7 W. Lenski and B. Szal ON POINTWISE APPROXIMATION OF FUNCTIONS BY SOME MATRIX MEANS OF CONJUGATE FOURIER SERIES Abstract. The results

More information

1 Definition of the Riemann integral

1 Definition of the Riemann integral MAT337H1, Introduction to Real Analysis: notes on Riemann integration 1 Definition of the Riemann integral Definition 1.1. Let [a, b] R be a closed interval. A partition P of [a, b] is a finite set of

More information

Large deviations for random projections of l p balls

Large deviations for random projections of l p balls 1/32 Large deviations for random projections of l p balls Nina Gantert CRM, september 5, 2016 Goal: Understanding random projections of high-dimensional convex sets. 2/32 2/32 Outline Goal: Understanding

More information

ASYMPTOTIC RESULTS FOR EMPIRICAL MEASURES OF WEIGHTED SUMS OF INDEPENDENT RANDOM VARIABLES

ASYMPTOTIC RESULTS FOR EMPIRICAL MEASURES OF WEIGHTED SUMS OF INDEPENDENT RANDOM VARIABLES Elect. Comm. i Probab. (007), 84 99 ELECTRONIC COMMUNICATIONS i PROBABILITY ASYMPTOTIC RESULTS FOR EMPIRICAL MEASURES OF WEIGHTED SUMS OF INDEPENDENT RANDOM VARIABLES BERNARD BERCU Istitut de Mathématiques

More information

Upper Bounds for Partitions into k-th Powers Elementary Methods

Upper Bounds for Partitions into k-th Powers Elementary Methods Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 9, 433-438 Upper Bounds for Partitions into -th Powers Elementary Methods Rafael Jaimczu División Matemática, Universidad Nacional de Luján Buenos Aires,

More information

δ xj β n = 1 n Theorem 1.1. The sequence {P n } satisfies a large deviation principle on M(X) with the rate function I(β) given by

δ xj β n = 1 n Theorem 1.1. The sequence {P n } satisfies a large deviation principle on M(X) with the rate function I(β) given by . Sanov s Theorem Here we consider a sequence of i.i.d. random variables with values in some complete separable metric space X with a common distribution α. Then the sample distribution β n = n maps X

More information

h(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote

h(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function

More information

Introduction to Empirical Processes and Semiparametric Inference Lecture 09: Stochastic Convergence, Continued

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

Brownian survival and Lifshitz tail in perturbed lattice disorder

Brownian survival and Lifshitz tail in perturbed lattice disorder Brownian survival and Lifshitz tail in perturbed lattice disorder Ryoki Fukushima Kyoto niversity Random Processes and Systems February 16, 2009 6 B T 1. Model ) ({B t t 0, P x : standard Brownian motion

More information

Large Deviations from the Hydrodynamic Limit for a System with Nearest Neighbor Interactions

Large Deviations from the Hydrodynamic Limit for a System with Nearest Neighbor Interactions Large Deviations from the Hydrodynamic Limit for a System with Nearest Neighbor Interactions Amarjit Budhiraja Department of Statistics & Operations Research University of North Carolina at Chapel Hill

More information

Lecture 11: Probability, Order Statistics and Sampling

Lecture 11: Probability, Order Statistics and Sampling 5-75: Graduate Algorithms February, 7 Lecture : Probability, Order tatistics and ampling Lecturer: David Whitmer cribes: Ilai Deutel, C.J. Argue Exponential Distributions Definition.. Given sample space

More information

A large deviation principle for a RWRC in a box

A large deviation principle for a RWRC in a box A large deviation principle for a RWRC in a box 7th Cornell Probability Summer School Michele Salvi TU Berlin July 12, 2011 Michele Salvi (TU Berlin) An LDP for a RWRC in a nite box July 12, 2011 1 / 15

More information

Random Toeplitz Matrices

Random Toeplitz Matrices Arnab Sen University of Minnesota Conference on Limits Theorems in Probability, IISc January 11, 2013 Joint work with Bálint Virág What are Toeplitz matrices? a0 a 1 a 2... a1 a0 a 1... a2 a1 a0... a (n

More information

Chapter 4. Theory of Tests. 4.1 Introduction

Chapter 4. Theory of Tests. 4.1 Introduction Chapter 4 Theory of Tests 4.1 Introduction Parametric model: (X, B X, P θ ), P θ P = {P θ θ Θ} where Θ = H 0 +H 1 X = K +A : K: critical region = rejection region / A: acceptance region A decision rule

More information

Consistency of Modularity Clustering on Random Geometric Graphs

Consistency of Modularity Clustering on Random Geometric Graphs Consistency of Modularity Clustering on Random Geometric Graphs Erik Davis The University of Arizona May 10, 2016 Outline Introduction to Modularity Clustering Pointwise Convergence Convergence of Optimal

More information

1 The Glivenko-Cantelli Theorem

1 The Glivenko-Cantelli Theorem 1 The Glivenko-Cantelli Theorem Let X i, i = 1,..., n be an i.i.d. sequence of random variables with distribution function F on R. The empirical distribution function is the function of x defined by ˆF

More information

Limiting Distributions

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

1 Independent increments

1 Independent increments Tel Aviv University, 2008 Brownian motion 1 1 Independent increments 1a Three convolution semigroups........... 1 1b Independent increments.............. 2 1c Continuous time................... 3 1d Bad

More information

µ X (A) = P ( X 1 (A) )

µ X (A) = P ( X 1 (A) ) 1 STOCHASTIC PROCESSES This appendix provides a very basic introduction to the language of probability theory and stochastic processes. We assume the reader is familiar with the general measure and integration

More information

The largest eigenvalues of the sample covariance matrix. in the heavy-tail case

The largest eigenvalues of the sample covariance matrix. in the heavy-tail case The largest eigenvalues of the sample covariance matrix 1 in the heavy-tail case Thomas Mikosch University of Copenhagen Joint work with Richard A. Davis (Columbia NY), Johannes Heiny (Aarhus University)

More information

NON-UNIVERSALITY OF THE NAZAROV-SODIN CONSTANT

NON-UNIVERSALITY OF THE NAZAROV-SODIN CONSTANT NON-UNIVERSALITY OF THE NAZAROV-SODIN CONSTANT Abstract. We prove that the Nazarov-Sodin constant, which up to a natural scaling gives the leading order growth for the expected number of nodal components

More information

Commutative Banach algebras 79

Commutative Banach algebras 79 8. Commutative Banach algebras In this chapter, we analyze commutative Banach algebras in greater detail. So we always assume that xy = yx for all x, y A here. Definition 8.1. Let A be a (commutative)

More information

Introduction to Nonlinear Control Lecture # 3 Time-Varying and Perturbed Systems

Introduction to Nonlinear Control Lecture # 3 Time-Varying and Perturbed Systems p. 1/5 Introduction to Nonlinear Control Lecture # 3 Time-Varying and Perturbed Systems p. 2/5 Time-varying Systems ẋ = f(t, x) f(t, x) is piecewise continuous in t and locally Lipschitz in x for all t

More information

Existence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets

Existence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets Existence of a Limit on a Dense Set, and Construction of Continuous Functions on Special Sets REU 2012 Recap: Definitions Definition Given a real-valued function f, the limit of f exists at a point c R

More information

The Pennsylvania State University The Graduate School LOGARITHMIC QUANTILE ESTIMATION AND ITS APPLICATIONS TO NONPARAMETRIC FACTORIAL DESIGNS

The Pennsylvania State University The Graduate School LOGARITHMIC QUANTILE ESTIMATION AND ITS APPLICATIONS TO NONPARAMETRIC FACTORIAL DESIGNS The Pennsylvania State University The Graduate School LOGARITHMIC QUANTILE ESTIMATION AND ITS APPLICATIONS TO NONPARAMETRIC FACTORIAL DESIGNS A Dissertation in Statistics by Lucia Tabacu c 204 Lucia Tabacu

More information

Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )

Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( ) Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio (2014-2015) Etienne Tanré - Olivier Faugeras INRIA - Team Tosca October 22nd, 2014 E. Tanré (INRIA - Team Tosca) Mathematical

More information

Lecture 8 : Eigenvalues and Eigenvectors

Lecture 8 : Eigenvalues and Eigenvectors CPS290: Algorithmic Foundations of Data Science February 24, 2017 Lecture 8 : Eigenvalues and Eigenvectors Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Hermitian Matrices It is simpler to begin with

More information

Limiting 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 two fundamental results

More information

Lower Tail Probabilities and Normal Comparison Inequalities. In Memory of Wenbo V. Li s Contributions

Lower Tail Probabilities and Normal Comparison Inequalities. In Memory of Wenbo V. Li s Contributions Lower Tail Probabilities and Normal Comparison Inequalities In Memory of Wenbo V. Li s Contributions Qi-Man Shao The Chinese University of Hong Kong Lower Tail Probabilities and Normal Comparison Inequalities

More information

UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, Practice Final Examination (Winter 2017)

UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, Practice Final Examination (Winter 2017) UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, 208 Practice Final Examination (Winter 207) There are 6 problems, each problem with multiple parts. Your answer should be as clear and readable

More information

PCA with random noise. Van Ha Vu. Department of Mathematics Yale University

PCA with random noise. Van Ha Vu. Department of Mathematics Yale University PCA with random noise Van Ha Vu Department of Mathematics Yale University An important problem that appears in various areas of applied mathematics (in particular statistics, computer science and numerical

More information

Exercise 1. Let f be a nonnegative measurable function. Show that. where ϕ is taken over all simple functions with ϕ f. k 1.

Exercise 1. Let f be a nonnegative measurable function. Show that. where ϕ is taken over all simple functions with ϕ f. k 1. Real Variables, Fall 2014 Problem set 3 Solution suggestions xercise 1. Let f be a nonnegative measurable function. Show that f = sup ϕ, where ϕ is taken over all simple functions with ϕ f. For each n

More information

An introduction to Birkhoff normal form

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

Wiener Measure and Brownian Motion

Wiener Measure and Brownian Motion Chapter 16 Wiener Measure and Brownian Motion Diffusion of particles is a product of their apparently random motion. The density u(t, x) of diffusing particles satisfies the diffusion equation (16.1) u

More information

DISTRIBUTION OF EIGENVALUES OF REAL SYMMETRIC PALINDROMIC TOEPLITZ MATRICES AND CIRCULANT MATRICES

DISTRIBUTION OF EIGENVALUES OF REAL SYMMETRIC PALINDROMIC TOEPLITZ MATRICES AND CIRCULANT MATRICES DISTRIBUTION OF EIGENVALUES OF REAL SYMMETRIC PALINDROMIC TOEPLITZ MATRICES AND CIRCULANT MATRICES ADAM MASSEY, STEVEN J. MILLER, AND JOHN SINSHEIMER Abstract. Consider the ensemble of real symmetric Toeplitz

More information

Math Camp II. Calculus. Yiqing Xu. August 27, 2014 MIT

Math Camp II. Calculus. Yiqing Xu. August 27, 2014 MIT Math Camp II Calculus Yiqing Xu MIT August 27, 2014 1 Sequence and Limit 2 Derivatives 3 OLS Asymptotics 4 Integrals Sequence Definition A sequence {y n } = {y 1, y 2, y 3,..., y n } is an ordered set

More information

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

Spectral representations and ergodic theorems for stationary stochastic processes

Spectral representations and ergodic theorems for stationary stochastic processes AMS 263 Stochastic Processes (Fall 2005) Instructor: Athanasios Kottas Spectral representations and ergodic theorems for stationary stochastic processes Stationary stochastic processes Theory and methods

More information

Brunn-Minkowski inequality for the 1-Riesz capacity and level set convexity for the 1/2-Laplacian

Brunn-Minkowski inequality for the 1-Riesz capacity and level set convexity for the 1/2-Laplacian Brunn-Minkowski inequality for the 1-Riesz capacity and level set convexity for the 1/2-Laplacian M. Novaga, B. Ruffini January 13, 2014 Abstract We prove that that the 1-Riesz capacity satisfies a Brunn-Minkowski

More information

Limit theorems for dependent regularly varying functions of Markov chains

Limit theorems for dependent regularly varying functions of Markov chains Limit theorems for functions of with extremal linear behavior Limit theorems for dependent regularly varying functions of In collaboration with T. Mikosch Olivier Wintenberger wintenberger@ceremade.dauphine.fr

More information

Manifold Learning for Subsequent Inference

Manifold Learning for Subsequent Inference Manifold Learning for Subsequent Inference Carey E. Priebe Johns Hopkins University June 20, 2018 DARPA Fundamental Limits of Learning (FunLoL) Los Angeles, California http://arxiv.org/abs/1806.01401 Key

More information

A Gentle Introduction to Stein s Method for Normal Approximation I

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

On a class of stochastic differential equations in a financial network model

On a class of stochastic differential equations in a financial network model 1 On a class of stochastic differential equations in a financial network model Tomoyuki Ichiba Department of Statistics & Applied Probability, Center for Financial Mathematics and Actuarial Research, University

More information

Makarov s LIL for SLE

Makarov s LIL for SLE Makarov s LIL for SLE Nam-Gyu Kang Department of Mathematics, M.I.T. Workshop at IPAM, 2007 Nam-Gyu Kang (M.I.T.) Makarov s LIL for SLE Workshop at IPAM, 2007 1 / 24 Outline 1 Introduction and Preliminaries

More information

Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012

Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012 Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 202 BOUNDS AND ASYMPTOTICS FOR FISHER INFORMATION IN THE CENTRAL LIMIT THEOREM

More information

IE 521 Convex Optimization

IE 521 Convex Optimization Lecture 5: Convex II 6th February 2019 Convex Local Lipschitz Outline Local Lipschitz 1 / 23 Convex Local Lipschitz Convex Function: f : R n R is convex if dom(f ) is convex and for any λ [0, 1], x, y

More information

Asymptotic Statistics-III. Changliang Zou

Asymptotic Statistics-III. Changliang Zou Asymptotic Statistics-III Changliang Zou The multivariate central limit theorem Theorem (Multivariate CLT for iid case) Let X i be iid random p-vectors with mean µ and and covariance matrix Σ. Then n (

More information

IEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory. Fall 2009, Professor Whitt. Class Lecture Notes: Wednesday, September 9.

IEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory. Fall 2009, Professor Whitt. Class Lecture Notes: Wednesday, September 9. IEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory Fall 2009, Professor Whitt Class Lecture Notes: Wednesday, September 9. Heavy-Traffic Limits for the GI/G/1 Queue 1. The GI/G/1 Queue We will

More information

Estimates for the concentration functions in the Littlewood Offord problem

Estimates for the concentration functions in the Littlewood Offord problem Estimates for the concentration functions in the Littlewood Offord problem Yulia S. Eliseeva, Andrei Yu. Zaitsev Saint-Petersburg State University, Steklov Institute, St Petersburg, RUSSIA. 203, June Saint-Petersburg

More information

Estimation of the long Memory parameter using an Infinite Source Poisson model applied to transmission rate measurements

Estimation of the long Memory parameter using an Infinite Source Poisson model applied to transmission rate measurements of the long Memory parameter using an Infinite Source Poisson model applied to transmission rate measurements François Roueff Ecole Nat. Sup. des Télécommunications 46 rue Barrault, 75634 Paris cedex 13,

More information

Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama

Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama Instructions This exam has 7 pages in total, numbered 1 to 7. Make sure your exam has all the pages. This exam will be 2 hours

More information

Modeling and testing long memory in random fields

Modeling and testing long memory in random fields Modeling and testing long memory in random fields Frédéric Lavancier lavancier@math.univ-lille1.fr Université Lille 1 LS-CREST Paris 24 janvier 6 1 Introduction Long memory random fields Motivations Previous

More information

Upper Bound for Intermediate Singular Values of Random Sub-Gaussian Matrices 1

Upper Bound for Intermediate Singular Values of Random Sub-Gaussian Matrices 1 Upper Bound for Intermediate Singular Values of Random Sub-Gaussian Matrices 1 Feng Wei 2 University of Michigan July 29, 2016 1 This presentation is based a project under the supervision of M. Rudelson.

More information

Stability of Stochastic Differential Equations

Stability of Stochastic Differential Equations Lyapunov stability theory for ODEs s Stability of Stochastic Differential Equations Part 1: Introduction Department of Mathematics and Statistics University of Strathclyde Glasgow, G1 1XH December 2010

More information

ON THE CONVEX INFIMUM CONVOLUTION INEQUALITY WITH OPTIMAL COST FUNCTION

ON THE CONVEX INFIMUM CONVOLUTION INEQUALITY WITH OPTIMAL COST FUNCTION ON THE CONVEX INFIMUM CONVOLUTION INEQUALITY WITH OPTIMAL COST FUNCTION MARTA STRZELECKA, MICHA L STRZELECKI, AND TOMASZ TKOCZ Abstract. We show that every symmetric random variable with log-concave tails

More information

Announcements. Topics: Homework: - sections 4.5 and * Read these sections and study solved examples in your textbook!

Announcements. Topics: Homework: - sections 4.5 and * Read these sections and study solved examples in your textbook! Announcements Topics: - sections 4.5 and 5.1-5.5 * Read these sections and study solved examples in your textbook! Homework: - review lecture notes thoroughly - work on practice problems from the textbook

More information

Stochastic Simulation

Stochastic Simulation Stochastic Simulation APPM 7400 Lesson 3: Testing Random Number Generators Part II: Uniformity September 5, 2018 Lesson 3: Testing Random Number GeneratorsPart II: Uniformity Stochastic Simulation September

More information

Concentration for Coulomb gases

Concentration for Coulomb gases 1/32 and Coulomb transport inequalities Djalil Chafaï 1, Adrien Hardy 2, Mylène Maïda 2 1 Université Paris-Dauphine, 2 Université de Lille November 4, 2016 IHP Paris Groupe de travail MEGA 2/32 Motivation

More information

Convergence Concepts of Random Variables and Functions

Convergence Concepts of Random Variables and Functions Convergence Concepts of Random Variables and Functions c 2002 2007, Professor Seppo Pynnonen, Department of Mathematics and Statistics, University of Vaasa Version: January 5, 2007 Convergence Modes Convergence

More information

. Then V l on K l, and so. e e 1.

. Then V l on K l, and so. e e 1. Sanov s Theorem Let E be a Polish space, and define L n : E n M E to be the empirical measure given by L n x = n n m= δ x m for x = x,..., x n E n. Given a µ M E, denote by µ n the distribution of L n

More information

Consistency of the maximum likelihood estimator for general hidden Markov models

Consistency of the maximum likelihood estimator for general hidden Markov models Consistency of the maximum likelihood estimator for general hidden Markov models Jimmy Olsson Centre for Mathematical Sciences Lund University Nordstat 2012 Umeå, Sweden Collaborators Hidden Markov models

More information

2a Large deviation principle (LDP) b Contraction principle c Change of measure... 10

2a Large deviation principle (LDP) b Contraction principle c Change of measure... 10 Tel Aviv University, 2007 Large deviations 5 2 Basic notions 2a Large deviation principle LDP......... 5 2b Contraction principle................ 9 2c Change of measure................. 10 The formalism

More information

ECE 4400:693 - Information Theory

ECE 4400:693 - Information Theory ECE 4400:693 - Information Theory Dr. Nghi Tran Lecture 8: Differential Entropy Dr. Nghi Tran (ECE-University of Akron) ECE 4400:693 Lecture 1 / 43 Outline 1 Review: Entropy of discrete RVs 2 Differential

More information

MATH 5640: Fourier Series

MATH 5640: Fourier Series MATH 564: Fourier Series Hung Phan, UMass Lowell September, 8 Power Series A power series in the variable x is a series of the form a + a x + a x + = where the coefficients a, a,... are real or complex

More information

Proof. We indicate by α, β (finite or not) the end-points of I and call

Proof. We indicate by α, β (finite or not) the end-points of I and call C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending

More information

Lecture Notes 3 Convergence (Chapter 5)

Lecture Notes 3 Convergence (Chapter 5) Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let

More information

On the convergence of sequences of random variables: A primer

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