Large deviations for random projections of l p balls

Size: px
Start display at page:

Download "Large deviations for random projections of l p balls"

Transcription

1 1/32 Large deviations for random projections of l p balls Nina Gantert CRM, september 5, 2016

2 Goal: Understanding random projections of high-dimensional convex sets. 2/32

3 2/32 Outline Goal: Understanding random projections of high-dimensional convex sets. 1 Motivation and statement of the question 2 A toy example: Cramér s Theorem for randomly weighted sums 3 Large deviations for the dependent case 4 A key ingredient of the proofs

4 Motivation and statement of the question 3/32 The talk is based on joint work with Steven Soojin Kim and Kavita Ramanan, both at Brown University. Cramér s Theorem is atypical, Springer s AWM Series: Advances in the Mathematical Sciences. Large deviations for random projections of l p balls, on arxiv.

5 Motivation and statement of the question 4/32 Let X (n) = (X 1, X 2,..., X n ) be a sample of n i.i.d. real-valued random variables with finite expectation m and finite variance. Then the law of large numbers and the central limit theorem hold, and Cramér s theorem characterizes the exponential rate of decay of the probability of a deviation : for x > m, ( ) P 1 n n X i x i=1 e ni (x). where [ I (x) = sup λx log E(e λx 1 ) ]. λ R

6 Motivation and statement of the question 5/32 Example If the X i have a standard normal law, m = 0 and I (x) = x2 2, i.e. for x > 0 ( ) 1 n n log P 1 n X i x x 2 for n. 2 i=1 We say that the X i satisfy a large deviation principle with speed n and rate I (x) = x2 2.

7 Motivation and statement of the question 6/32 Example Consider X1 4,..., X n 4, where the X i have a standard normal law. Then ( ) 1 n n log P 1 n Xi 4 x 0 for n, i=1 hence the probability of a deviation decays slower than exponentially in n. We have ( ) 1 n 1 x log P n n Xi 4 x for n. 2 i=1 We say that the X 4 rate I (x) = x 2. i satisfy a large deviation principle with speed n and

8 Motivation and statement of the question 7/32 Remark Note that the different decay rates in the previous examples do stand for two different regimes. With µ = N(0, 1), we have I (x) = x 2 2 = min ν:m(ν)=x H(ν µ) = H(ν µ) (1) where ν = N(x, 1). Then ( P X 1 A 1 n ) n X i x i=1 ν(a). (2) On the other hand ( P X1 4 A 1 n n i=1 X 4 i x ) P ( X 4 1 A ). (3)

9 Motivation and statement of the question 8/32 Here, H( ) denotes the relative entropy between two measures: for ν, µ P(R), { ( ) H(ν µ) = R log dν dµ dν, if ν µ, +, else.

10 Motivation and statement of the question 9/32 We take a geometric approach by viewing X (n) as a high-dimensional random vector in R n. Example If X 1 Uniform[ 1, 1], then X (n) is a uniform random point in the cube [ 1, 1] n.

11 Motivation and statement of the question 10/32 In this setting, the empirical mean is the projection of X (n) onto the unit vector with equal weights on all coordinates: i.e., 1 n n i=1 X i = 1 n X (n), ϕ (n) n, where, n is the Euclidean inner product on R n, and ϕ (n) = ( 1 n, 1 n,..., 1 n ) S n 1. Here, S n 1 denotes the unit sphere in R n : S n 1 = { x R n : x x x 2 n = 1 }.

12 Motivation and statement of the question 11/32 Given this geometric view of empirical means, it is natural to investigate directions of projection θ (n) S n 1 other than ϕ (n). Such projections correspond to weighted means, where θ (n) S n 1. 1 n n i=1 X i nθ (n) i = 1 n X (n), θ (n) n.

13 Motivation and statement of the question 12/32 We also want to analyze distributions of X (n) other than product measures. In the geometric setting, one way to encode dependence is to look at uniform measures on convex bodies, which are, in general, not product measures. We will analyze a fundamental class of convex bodies, the l p balls; this offers a natural generalization from the product measure case of p = as in the example, to general p [1, ).

14 Motivation and statement of the question 12/32 We also want to analyze distributions of X (n) other than product measures. In the geometric setting, one way to encode dependence is to look at uniform measures on convex bodies, which are, in general, not product measures. We will analyze a fundamental class of convex bodies, the l p balls; this offers a natural generalization from the product measure case of p = as in the example, to general p [1, ). Motivation: a lot is known about uniform measures on high-dimensional convex bodies (Sudakov, Diaconis-Freedman, Klartag,... ), in particular, there is a central limit theorem under mild conditions, which are satisfied for l p balls.

15 Motivation and statement of the question 13/32 More precisely, if (X 1, X 2,..., X n ) has a log-concave joint density, (X 1, X 2,..., X n ) has the same law as (±X 1, ±X 2,..., ±X n ) for all choices of signs and E[Xi 2 ] = 1 for i = 1, 2,..., n, then ( sup a b P a 1 n ) n X i b i=1 for some universal constant C. 1 2π b a e t2 /2 dt C n

16 Motivation and statement of the question 14/32 We choose a uniform random point from the unit l p ball of R n and project it onto a uniform random direction θ (n) S n 1. Let W (n,p) θ = n1/p n 1/2 X (n,p), θ (n) n = 1 n n i=1 (n 1/p X (n,p) i )(n 1/2 θ (n) i ), n N. Why this scaling? The variance of W (n,p) θ should be of order 1/n in order to have the appropriate scale for a large deviation analysis. Note that both n 1/p X (n,p) i and n 1/2 Θ (n) i are typically of order 1, since they are coordinates of points on n 1/p B n,p and n 1/2 S n 1, respectively. Thus, the sum over all i = 1,..., n is of order n.

17 Motivation and statement of the question 15/32 Question Do we have large deviation principles for random projections of l p balls, i.e. for W (n,p) θ and if so, at what speed and rate? = n1/p n 1/2 X (n,p), θ (n) n

18 Motivation and statement of the question 16/32 Our main results on this question are the following: an annealed LDP, for random directions of projection; a quenched LDP, for fixed directions of projection, with a rate function that coincides for almost every sequence of directions; a variational formula which relates the annealed and quenched rate functions via the entropy of an underlying measure, and gives insight into how a geometric rare event occurs;

19 Motivation and statement of the question 17/32 Remark The annelead large deviation principles have been generalized for projections to k n -dimensional uniform random subspaces, provided k n /n converges to a limit in [0, 1], see recent work of David Alonso-Gutiérrez, Joscha Prochno and Christoph Thäle.

20 A toy example: Cramér s Theorem for randomly weighted sums 18/32 In the p = case, X 1, X 2,..., X n are i.i.d. Assume for simplicity that (n) nθ 1, nθ (n) 2,..., nθ n (n) are i.i.d. as well. Let Y i = nθ (n) i, 1 i n, and ask about large deviations of 1 n n X i Y i i=1 where X 1, X 2,... and Y 1, Y 2..., are independent sequences of i.i.d. random variables, X 1 with law µ and Y 1 with law ν. We are looking both at the quenched law, i.e. for (almost any) fixed realization of Y 1, Y 2,..., and at the annealed law, averaged over the Y 1, Y 2,...

21 A toy example: Cramér s Theorem for randomly weighted sums 19/32 Assume that X 1 Y 1 has (all) exponential moments. It is clear that the annealed or averaged laws of 1 n n i=1 X iy i satisfy a large deviation principle with rate function I an - this is Cramér s Theorem. We have [ ] I an (x) = sup λ R λx log e λxy µ(dx)ν(dy) It is easy to see (and follows from a result of Rüschendorf and Kiesel) that for almost any realization of Y 1, Y 2,... the laws of 1 n n i=1 X iy i satisfy an LDP with rate function I qu ν given by [ ( ) ] I qu ν (x) = sup λ R λx log e λxy µ(dx) ν(dy)

22 A toy example: Cramér s Theorem for randomly weighted sums 20/32 The two rate functions are related by the following variational formula: I an [ (x) = inf I qu ν (x) + H( ν ν)]. ν P(R) Remark Variational formulas of this form are typical for quenched/annealed large deviations in random medium. Another example: large deviations for the speed of a random walk in random environment.

23 Large deviations for the dependent case 21/32 Let B n,p denote the unit l p ball in R n. Recall that S n 1 denotes the unit sphere in R n. Write σ n for the unique rotationally invariant probability measure on S n 1. Let S = n N Sn 1 and let π n : S S n 1 be the coordinate map such that for θ = (θ (1), θ (2), ) S, we have π n (θ) = θ (n). Let σ be a probability measure on (the Borel sets of) S such that for all n N, σ π 1 n = σ n. For example, the product measure σ = n N σ n satisfies the above equation. For n N, let Θ (n) denote a random vector that is distributed according to the uniform measure σ n on S n 1, independent of X (n,p).

24 Large deviations for the dependent case 22/32 Recall W (n,p) θ = n1/p n 1/2 X (n,p), θ (n) n. Theorem (Annealed LDP, p > 2) Let p [2, ). The sequence (W (n,p) ) n N satisfies an LDP with a quasiconvex, symmetric, good rate function I an p.

25 Large deviations for the dependent case 23/32 For p < 2, random projections display significantly different large deviation behavior. For p [1, 2), define I an p (w) = 1 r p w rp, where r p = 2p 2+p. Note that r p < 1 for p < 2, so the following large deviations principle holds with a speed n rp slower than the speed n associated with the case p 2. Theorem (Annealed LDP, p < 2) Let p [1, 2). The sequence (W (n,p) ) n N satisfies an LDP with speed n rp and the quasiconvex, symmetric, good rate function I an p.

26 Large deviations for the dependent case 24/32 Remark We see that the two cases p > 2 and p [1, 2) correspond to two different regimes: p > 2 is the regime where a large deviation comes from a collaboration of all coordinates while p [1, 2) is the regime of extremal events, i.e. the large deviations comes from the large deviation of a single coordinate. (See the examples in the beginning). The geometrical reason is that for p > 2, the vectors in n 1/p B n,p that attain maximal Euclidean norm are the corners (±1, ±1,..., ±1). Meanwhile, for p < 2, the vectors in n 1/p B n,p that attain maximal Euclidean norm are again corners, but this time the corners are in canonical basis directions (±1, 0,..., 0), (0, ±1, 0,..., 0), etc.

27 Large deviations for the dependent case 25/32 Theorem (Quenched LDP, p (1, )) Let p (1, ). For σ-a.e. θ S, the sequence (W (n,p) θ ) n N satisfies an LDP with the quasiconvex, symmetric, good rate function I qu p,µ 2.

28 26/32 More precisely, let Large deviations for the dependent case f p (y) = 1 2p 1/p Γ(1 + 1 p )e y p /p, y R. and let µ p be the corresponding probability measure on R. For p (1, ), ν P(R), define ( ) Λ p (t 1, t 2 ) = log e t 1y+t 2 y p µ p (dy) R Ψ p,ν (t 1, t 2 ) = Λ p (t 1 u, t 2 )ν(du), t 1, t 2 R. R Next, define the associated rate functions through the Legendre transforms of Ψ p,ν : for w R, I qu p,ν(w) = inf τ 1 R,τ 2 >0 : τ 1 τ 1/p 2 =w Ψ p,ν(τ 1, τ 2 )

29 Large deviations for the dependent case 27/32 Let m q denote the q-th absolute moment of a measure, m q (ν) = x q ν(dx), ν P(R). R The annealed and quenched rate functions are related through a variational formula involving the relative entropy. Theorem (Relationship between annealed and quenched LDPs) Let p [2, ). Then, for all w R, I an [ p (w) = inf I qu p,ν(w) + H(ν µ 2 ) (1 m 2(ν)) ]. ν P(R):m 2 (ν) 1

30 Large deviations for the dependent case 28/32 Remark The term H(ν µ 2 ) (1 m 2(ν)) comes from the large deviations of the environment. More precisely, the empirical measures n L n := 1 n i=1 δ nθ (n) i satisfy a large deviation principle with rate function { H(ν µ2 ) + 1 I (ν) = 2 (1 m 2(ν)) m 2 (ν) 1 +, else. (The LDP for the weak topology goes back to Amir Dembo, Gérard Ben Arous and Alice Guionnet, and it was strenghtened to the Wasserstein topology by Steven Soojin Kim and Kavita Ramanan).

31 Large deviations for the dependent case 29/32 Remark The case p = 2 is easy: in this case, the LDP holds for ANY sequence θ S and I an 2 (w) = I qu 2,µ 2 (w) = { 1 2 log(1 w 2 ), w ( 1, 1); +, else. This quantifies the well-known statement that two independently chosen points on S n 1 are almost orthogonal with high probability as n goes to infinity. More precise results are known in this case, see Distributions of angles in random packing on spheres by Tony Cai, Jianqing Fan and Tiefeng Jiang.

32 A key ingredient of the proofs 30/32 Let n N and p [1, ). We have probabilistic representations for random vectors in B n,p and S n 1. Recall the density f p (y) = 1 2p 1/p Γ(1 + 1 p )e y p /p, y R. and let µ p be the corresponding probability measure on R. Assume that U is uniformly distributed on [0, 1]; Y (p) = (Y (n,p) ) n N = ( (Y (n,p) 1,, Y n (n,p) ) ) n N is a triangular array of i.i.d. real-valued random variables, with common distribution µ p ; Z = (Z (n) ) n N = ( (Z (n) 1,, Z n (n) ) ) n N is a triangular array of independent N(0, 1) random variables. Moreover, assume U, Y (p), and Z are independent.

33 A key ingredient of the proofs 31/32 Then, the following properties are well known. Lemma For p [1, ), ( X (n,p), Θ (n)) (d) = ( U 1/n Y (n,p) Z (n) Y (n,p), n,p Z (n) n,2 Moreover, Y (n,p) / Y (n,p) n,p is independent of Y (n,p) n,p, and Z (n) / Z (n) n,2 is independent of Z (n) n,2. ).

34 A key ingredient of the proofs 32/32 Thanks for your attention!

An inverse of Sanov s theorem

An inverse of Sanov s theorem An inverse of Sanov s theorem Ayalvadi Ganesh and Neil O Connell BRIMS, Hewlett-Packard Labs, Bristol Abstract Let X k be a sequence of iid random variables taking values in a finite set, and consider

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

The large deviation principle for the Erdős-Rényi random graph

The large deviation principle for the Erdős-Rényi random graph The large deviation principle for the Erdős-Rényi random graph (Courant Institute, NYU) joint work with S. R. S. Varadhan Main objective: how to count graphs with a given property Only consider finite

More information

Concentration inequalities: basics and some new challenges

Concentration inequalities: basics and some new challenges Concentration inequalities: basics and some new challenges M. Ledoux University of Toulouse, France & Institut Universitaire de France Measure concentration geometric functional analysis, probability theory,

More information

Steiner s formula and large deviations theory

Steiner s formula and large deviations theory Steiner s formula and large deviations theory Venkat Anantharam EECS Department University of California, Berkeley May 19, 2015 Simons Conference on Networks and Stochastic Geometry Blanton Museum of Art

More information

Ferromagnets and the classical Heisenberg model. Kay Kirkpatrick, UIUC

Ferromagnets and the classical Heisenberg model. Kay Kirkpatrick, UIUC Ferromagnets and the classical Heisenberg model Kay Kirkpatrick, UIUC Ferromagnets and the classical Heisenberg model: asymptotics for a mean-field phase transition Kay Kirkpatrick, Urbana-Champaign June

More information

9 Radon-Nikodym theorem and conditioning

9 Radon-Nikodym theorem and conditioning Tel Aviv University, 2015 Functions of real variables 93 9 Radon-Nikodym theorem and conditioning 9a Borel-Kolmogorov paradox............. 93 9b Radon-Nikodym theorem.............. 94 9c Conditioning.....................

More information

Probabilistic Methods in Asymptotic Geometric Analysis.

Probabilistic Methods in Asymptotic Geometric Analysis. Probabilistic Methods in Asymptotic Geometric Analysis. C. Hugo Jiménez PUC-RIO, Brazil September 21st, 2016. Colmea. RJ 1 Origin 2 Normed Spaces 3 Distribution of volume of high dimensional convex bodies

More information

On isotropicity with respect to a measure

On isotropicity with respect to a measure On isotropicity with respect to a measure Liran Rotem Abstract A body is said to be isoptropic with respect to a measure µ if the function θ x, θ dµ(x) is constant on the unit sphere. In this note, we

More information

Invariances in spectral estimates. Paris-Est Marne-la-Vallée, January 2011

Invariances in spectral estimates. Paris-Est Marne-la-Vallée, January 2011 Invariances in spectral estimates Franck Barthe Dario Cordero-Erausquin Paris-Est Marne-la-Vallée, January 2011 Notation Notation Given a probability measure ν on some Euclidean space, the Poincaré constant

More information

LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011

LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011 LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS S. G. Bobkov and F. L. Nazarov September 25, 20 Abstract We study large deviations of linear functionals on an isotropic

More information

Displacement convexity of the relative entropy in the discrete h

Displacement convexity of the relative entropy in the discrete h Displacement convexity of the relative entropy in the discrete hypercube LAMA Université Paris Est Marne-la-Vallée Phenomena in high dimensions in geometric analysis, random matrices, and computational

More information

Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed

Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed 18.466 Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed 1. MLEs in exponential families Let f(x,θ) for x X and θ Θ be a likelihood function, that is, for present purposes,

More information

Geometric Inference for Probability distributions

Geometric Inference for Probability distributions Geometric Inference for Probability distributions F. Chazal 1 D. Cohen-Steiner 2 Q. Mérigot 2 1 Geometrica, INRIA Saclay, 2 Geometrica, INRIA Sophia-Antipolis 2009 June 1 Motivation What is the (relevant)

More information

OPTIMAL TRANSPORTATION PLANS AND CONVERGENCE IN DISTRIBUTION

OPTIMAL TRANSPORTATION PLANS AND CONVERGENCE IN DISTRIBUTION OPTIMAL TRANSPORTATION PLANS AND CONVERGENCE IN DISTRIBUTION J.A. Cuesta-Albertos 1, C. Matrán 2 and A. Tuero-Díaz 1 1 Departamento de Matemáticas, Estadística y Computación. Universidad de Cantabria.

More information

SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE

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

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17 EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko

More information

Large-deviation theory and coverage in mobile phone networks

Large-deviation theory and coverage in mobile phone networks Weierstrass Institute for Applied Analysis and Stochastics Large-deviation theory and coverage in mobile phone networks Paul Keeler, Weierstrass Institute for Applied Analysis and Stochastics, Berlin joint

More information

NEW FUNCTIONAL INEQUALITIES

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

Problem Set 6: Solutions Math 201A: Fall a n x n,

Problem Set 6: Solutions Math 201A: Fall a n x n, Problem Set 6: Solutions Math 201A: Fall 2016 Problem 1. Is (x n ) n=0 a Schauder basis of C([0, 1])? No. If f(x) = a n x n, n=0 where the series converges uniformly on [0, 1], then f has a power series

More information

Entropy, Inference, and Channel Coding

Entropy, Inference, and Channel Coding Entropy, Inference, and Channel Coding Sean Meyn Department of Electrical and Computer Engineering University of Illinois and the Coordinated Science Laboratory NSF support: ECS 02-17836, ITR 00-85929

More information

MET Workshop: Exercises

MET Workshop: Exercises MET Workshop: Exercises Alex Blumenthal and Anthony Quas May 7, 206 Notation. R d is endowed with the standard inner product (, ) and Euclidean norm. M d d (R) denotes the space of n n real matrices. When

More information

Gärtner-Ellis Theorem and applications.

Gärtner-Ellis Theorem and applications. Gärtner-Ellis Theorem and applications. Elena Kosygina July 25, 208 In this lecture we turn to the non-i.i.d. case and discuss Gärtner-Ellis theorem. As an application, we study Curie-Weiss model with

More information

Reconstruction from Anisotropic Random Measurements

Reconstruction from Anisotropic Random Measurements Reconstruction from Anisotropic Random Measurements Mark Rudelson and Shuheng Zhou The University of Michigan, Ann Arbor Coding, Complexity, and Sparsity Workshop, 013 Ann Arbor, Michigan August 7, 013

More information

Statistics 612: L p spaces, metrics on spaces of probabilites, and connections to estimation

Statistics 612: L p spaces, metrics on spaces of probabilites, and connections to estimation Statistics 62: L p spaces, metrics on spaces of probabilites, and connections to estimation Moulinath Banerjee December 6, 2006 L p spaces and Hilbert spaces We first formally define L p spaces. Consider

More information

Today we will prove one result from probability that will be useful in several statistical tests. ... B1 B2 Br. Figure 23.1:

Today we will prove one result from probability that will be useful in several statistical tests. ... B1 B2 Br. Figure 23.1: Lecture 23 23. Pearson s theorem. Today we will prove one result from probability that will be useful in several statistical tests. Let us consider r boxes B,..., B r as in figure 23.... B B2 Br Figure

More information

Random matrix pencils and level crossings

Random matrix pencils and level crossings Albeverio Fest October 1, 2018 Topics to discuss Basic level crossing problem 1 Basic level crossing problem 2 3 Main references Basic level crossing problem (i) B. Shapiro, M. Tater, On spectral asymptotics

More information

Convex inequalities, isoperimetry and spectral gap III

Convex inequalities, isoperimetry and spectral gap III Convex inequalities, isoperimetry and spectral gap III Jesús Bastero (Universidad de Zaragoza) CIDAMA Antequera, September 11, 2014 Part III. K-L-S spectral gap conjecture KLS estimate, through Milman's

More information

Random Bernstein-Markov factors

Random Bernstein-Markov factors Random Bernstein-Markov factors Igor Pritsker and Koushik Ramachandran October 20, 208 Abstract For a polynomial P n of degree n, Bernstein s inequality states that P n n P n for all L p norms on the unit

More information

Statistical inference on Lévy processes

Statistical inference on Lévy processes Alberto Coca Cabrero University of Cambridge - CCA Supervisors: Dr. Richard Nickl and Professor L.C.G.Rogers Funded by Fundación Mutua Madrileña and EPSRC MASDOC/CCA student workshop 2013 26th March Outline

More information

Lévy Processes and Infinitely Divisible Measures in the Dual of afebruary Nuclear2017 Space 1 / 32

Lévy Processes and Infinitely Divisible Measures in the Dual of afebruary Nuclear2017 Space 1 / 32 Lévy Processes and Infinitely Divisible Measures in the Dual of a Nuclear Space David Applebaum School of Mathematics and Statistics, University of Sheffield, UK Talk at "Workshop on Infinite Dimensional

More information

Isodiametric problem in Carnot groups

Isodiametric problem in Carnot groups Conference Geometric Measure Theory Université Paris Diderot, 12th-14th September 2012 Isodiametric inequality in R n Isodiametric inequality: where ω n = L n (B(0, 1)). L n (A) 2 n ω n (diam A) n Isodiametric

More information

Geometric Inference for Probability distributions

Geometric Inference for Probability distributions Geometric Inference for Probability distributions F. Chazal 1 D. Cohen-Steiner 2 Q. Mérigot 2 1 Geometrica, INRIA Saclay, 2 Geometrica, INRIA Sophia-Antipolis 2009 July 8 F. Chazal, D. Cohen-Steiner, Q.

More information

Large Deviations for Random Matrices and a Conjecture of Lukic

Large Deviations for Random Matrices and a Conjecture of Lukic Large Deviations for Random Matrices and a Conjecture of Lukic Jonathan Breuer Hebrew University of Jerusalem Joint work with B. Simon (Caltech) and O. Zeitouni (The Weizmann Institute) Western States

More information

Fokker-Planck Equation on Graph with Finite Vertices

Fokker-Planck Equation on Graph with Finite Vertices Fokker-Planck Equation on Graph with Finite Vertices January 13, 2011 Jointly with S-N Chow (Georgia Tech) Wen Huang (USTC) Hao-min Zhou(Georgia Tech) Functional Inequalities and Discrete Spaces Outline

More information

Lecture 5: Importance sampling and Hamilton-Jacobi equations

Lecture 5: Importance sampling and Hamilton-Jacobi equations Lecture 5: Importance sampling and Hamilton-Jacobi equations Henrik Hult Department of Mathematics KTH Royal Institute of Technology Sweden Summer School on Monte Carlo Methods and Rare Events Brown University,

More information

Robustness of Principal Components

Robustness of Principal Components PCA for Clustering An objective of principal components analysis is to identify linear combinations of the original variables that are useful in accounting for the variation in those original variables.

More information

2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space.

2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space. University of Bergen General Functional Analysis Problems with solutions 6 ) Prove that is unique in any normed space. Solution of ) Let us suppose that there are 2 zeros and 2. Then = + 2 = 2 + = 2. 2)

More information

Geometry and Optimization of Relative Arbitrage

Geometry and Optimization of Relative Arbitrage Geometry and Optimization of Relative Arbitrage Ting-Kam Leonard Wong joint work with Soumik Pal Department of Mathematics, University of Washington Financial/Actuarial Mathematic Seminar, University of

More information

Weak and strong moments of l r -norms of log-concave vectors

Weak and strong moments of l r -norms of log-concave vectors Weak and strong moments of l r -norms of log-concave vectors Rafał Latała based on the joint work with Marta Strzelecka) University of Warsaw Minneapolis, April 14 2015 Log-concave measures/vectors A measure

More information

THE MULTIPLICATIVE ERGODIC THEOREM OF OSELEDETS

THE MULTIPLICATIVE ERGODIC THEOREM OF OSELEDETS THE MULTIPLICATIVE ERGODIC THEOREM OF OSELEDETS. STATEMENT Let (X, µ, A) be a probability space, and let T : X X be an ergodic measure-preserving transformation. Given a measurable map A : X GL(d, R),

More information

High-dimensional distributions with convexity properties

High-dimensional distributions with convexity properties High-dimensional distributions with convexity properties Bo az Klartag Tel-Aviv University A conference in honor of Charles Fefferman, Princeton, May 2009 High-Dimensional Distributions We are concerned

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

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

Stable Process. 2. Multivariate Stable Distributions. July, 2006

Stable Process. 2. Multivariate Stable Distributions. July, 2006 Stable Process 2. Multivariate Stable Distributions July, 2006 1. Stable random vectors. 2. Characteristic functions. 3. Strictly stable and symmetric stable random vectors. 4. Sub-Gaussian random vectors.

More information

Stability results for Logarithmic Sobolev inequality

Stability results for Logarithmic Sobolev inequality Stability results for Logarithmic Sobolev inequality Daesung Kim (joint work with Emanuel Indrei) Department of Mathematics Purdue University September 20, 2017 Daesung Kim (Purdue) Stability for LSI Probability

More information

The sample size required in importance sampling. Sourav Chatterjee

The sample size required in importance sampling. Sourav Chatterjee Importance sampling Let µ and ν be two probability measures on a set X, with ν µ. Let ρ = dν dµ. Let X 1, X 2,... i.i.d µ. Let f : X R be a measurable function. The goal is to estimate the integral I (f

More information

Gradient Gibbs measures with disorder

Gradient Gibbs measures with disorder Gradient Gibbs measures with disorder Codina Cotar University College London April 16, 2015, Providence Partly based on joint works with Christof Külske Outline 1 The model 2 Questions 3 Known results

More information

PROBLEMS. (b) (Polarization Identity) Show that in any inner product space

PROBLEMS. (b) (Polarization Identity) Show that in any inner product space 1 Professor Carl Cowen Math 54600 Fall 09 PROBLEMS 1. (Geometry in Inner Product Spaces) (a) (Parallelogram Law) Show that in any inner product space x + y 2 + x y 2 = 2( x 2 + y 2 ). (b) (Polarization

More information

Approximately Gaussian marginals and the hyperplane conjecture

Approximately Gaussian marginals and the hyperplane conjecture Approximately Gaussian marginals and the hyperplane conjecture Tel-Aviv University Conference on Asymptotic Geometric Analysis, Euler Institute, St. Petersburg, July 2010 Lecture based on a joint work

More information

) ) = γ. and P ( X. B(a, b) = Γ(a)Γ(b) Γ(a + b) ; (x + y, ) I J}. Then, (rx) a 1 (ry) b 1 e (x+y)r r 2 dxdy Γ(a)Γ(b) D

) ) = γ. and P ( X. B(a, b) = Γ(a)Γ(b) Γ(a + b) ; (x + y, ) I J}. Then, (rx) a 1 (ry) b 1 e (x+y)r r 2 dxdy Γ(a)Γ(b) D 3 Independent Random Variables II: Examples 3.1 Some functions of independent r.v. s. Let X 1, X 2,... be independent r.v. s with the known distributions. Then, one can compute the distribution of a r.v.

More information

Comparative and qualitative robustness for law-invariant risk measures

Comparative and qualitative robustness for law-invariant risk measures Comparative and qualitative robustness for law-invariant risk measures Volker Krätschmer Alexander Schied Henryk Zähle Abstract When estimating the risk of a P&L from historical data or Monte Carlo simulation,

More information

Bennett-type Generalization Bounds: Large-deviation Case and Faster Rate of Convergence

Bennett-type Generalization Bounds: Large-deviation Case and Faster Rate of Convergence Bennett-type Generalization Bounds: Large-deviation Case and Faster Rate of Convergence Chao Zhang The Biodesign Institute Arizona State University Tempe, AZ 8587, USA Abstract In this paper, we present

More information

PACKING-DIMENSION PROFILES AND FRACTIONAL BROWNIAN MOTION

PACKING-DIMENSION PROFILES AND FRACTIONAL BROWNIAN MOTION PACKING-DIMENSION PROFILES AND FRACTIONAL BROWNIAN MOTION DAVAR KHOSHNEVISAN AND YIMIN XIAO Abstract. In order to compute the packing dimension of orthogonal projections Falconer and Howroyd 997) introduced

More information

Topological properties of Z p and Q p and Euclidean models

Topological properties of Z p and Q p and Euclidean models Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete

More information

A dual form of the sharp Nash inequality and its weighted generalization

A dual form of the sharp Nash inequality and its weighted generalization A dual form of the sharp Nash inequality and its weighted generalization Elliott Lieb Princeton University Joint work with Eric Carlen, arxiv: 1704.08720 Kato conference, University of Tokyo September

More information

On John type ellipsoids

On John type ellipsoids On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and non-trivial continuous map u K which associates ellipsoids to

More information

Superconcentration inequalities for centered Gaussian stationnary processes

Superconcentration inequalities for centered Gaussian stationnary processes Superconcentration inequalities for centered Gaussian stationnary processes Kevin Tanguy Toulouse University June 21, 2016 1 / 22 Outline What is superconcentration? Convergence of extremes (Gaussian case).

More information

Overview of normed linear spaces

Overview of normed linear spaces 20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural

More information

Model Selection and Geometry

Model Selection and Geometry Model Selection and Geometry Pascal Massart Université Paris-Sud, Orsay Leipzig, February Purpose of the talk! Concentration of measure plays a fundamental role in the theory of model selection! Model

More information

Aliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide

Aliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide aliprantis.tex May 10, 2011 Aliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide Notes from [AB2]. 1 Odds and Ends 2 Topology 2.1 Topological spaces Example. (2.2) A semimetric = triangle

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 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à

More information

Lecture 1 Measure concentration

Lecture 1 Measure concentration CSE 29: Learning Theory Fall 2006 Lecture Measure concentration Lecturer: Sanjoy Dasgupta Scribe: Nakul Verma, Aaron Arvey, and Paul Ruvolo. Concentration of measure: examples We start with some examples

More information

Lecture 5 Theorems of Fubini-Tonelli and Radon-Nikodym

Lecture 5 Theorems of Fubini-Tonelli and Radon-Nikodym Lecture 5: Fubini-onelli and Radon-Nikodym 1 of 13 Course: heory of Probability I erm: Fall 2013 Instructor: Gordan Zitkovic Lecture 5 heorems of Fubini-onelli and Radon-Nikodym Products of measure spaces

More information

Theoretical Statistics. Lecture 1.

Theoretical Statistics. Lecture 1. 1. Organizational issues. 2. Overview. 3. Stochastic convergence. Theoretical Statistics. Lecture 1. eter Bartlett 1 Organizational Issues Lectures: Tue/Thu 11am 12:30pm, 332 Evans. eter Bartlett. bartlett@stat.

More information

Part II Probability and Measure

Part II Probability and Measure Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

Mahler Conjecture and Reverse Santalo

Mahler Conjecture and Reverse Santalo Mini-Courses Radoslaw Adamczak Random matrices with independent log-concave rows/columns. I will present some recent results concerning geometric properties of random matrices with independent rows/columns

More information

Large Deviations Techniques and Applications

Large Deviations Techniques and Applications Amir Dembo Ofer Zeitouni Large Deviations Techniques and Applications Second Edition With 29 Figures Springer Contents Preface to the Second Edition Preface to the First Edition vii ix 1 Introduction 1

More information

b i (µ, x, s) ei ϕ(x) µ s (dx) ds (2) i=1

b i (µ, x, s) ei ϕ(x) µ s (dx) ds (2) i=1 NONLINEAR EVOLTION EQATIONS FOR MEASRES ON INFINITE DIMENSIONAL SPACES V.I. Bogachev 1, G. Da Prato 2, M. Röckner 3, S.V. Shaposhnikov 1 The goal of this work is to prove the existence of a solution to

More information

X n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2)

X n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2) 14:17 11/16/2 TOPIC. Convergence in distribution and related notions. This section studies the notion of the so-called convergence in distribution of real random variables. This is the kind of convergence

More information

Information Theoretic Asymptotic Approximations for Distributions of Statistics

Information Theoretic Asymptotic Approximations for Distributions of Statistics Information Theoretic Asymptotic Approximations for Distributions of Statistics Ximing Wu Department of Agricultural Economics Texas A&M University Suojin Wang Department of Statistics Texas A&M University

More information

at time t, in dimension d. The index i varies in a countable set I. We call configuration the family, denoted generically by Φ: U (x i (t) x j (t))

at time t, in dimension d. The index i varies in a countable set I. We call configuration the family, denoted generically by Φ: U (x i (t) x j (t)) Notations In this chapter we investigate infinite systems of interacting particles subject to Newtonian dynamics Each particle is characterized by its position an velocity x i t, v i t R d R d at time

More information

Spring 2012 Math 541A Exam 1. X i, S 2 = 1 n. n 1. X i I(X i < c), T n =

Spring 2012 Math 541A Exam 1. X i, S 2 = 1 n. n 1. X i I(X i < c), T n = Spring 2012 Math 541A Exam 1 1. (a) Let Z i be independent N(0, 1), i = 1, 2,, n. Are Z = 1 n n Z i and S 2 Z = 1 n 1 n (Z i Z) 2 independent? Prove your claim. (b) Let X 1, X 2,, X n be independent identically

More information

Distributed Optimization over Networks Gossip-Based Algorithms

Distributed Optimization over Networks Gossip-Based Algorithms Distributed Optimization over Networks Gossip-Based Algorithms Angelia Nedić angelia@illinois.edu ISE Department and Coordinated Science Laboratory University of Illinois at Urbana-Champaign Outline Random

More information

A description of transport cost for signed measures

A description of transport cost for signed measures A description of transport cost for signed measures Edoardo Mainini Abstract In this paper we develop the analysis of [AMS] about the extension of the optimal transport framework to the space of real measures.

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

Packing-Dimension Profiles and Fractional Brownian Motion

Packing-Dimension Profiles and Fractional Brownian Motion Under consideration for publication in Math. Proc. Camb. Phil. Soc. 1 Packing-Dimension Profiles and Fractional Brownian Motion By DAVAR KHOSHNEVISAN Department of Mathematics, 155 S. 1400 E., JWB 233,

More information

Moment Measures. Bo az Klartag. Tel Aviv University. Talk at the asymptotic geometric analysis seminar. Tel Aviv, May 2013

Moment Measures. Bo az Klartag. Tel Aviv University. Talk at the asymptotic geometric analysis seminar. Tel Aviv, May 2013 Tel Aviv University Talk at the asymptotic geometric analysis seminar Tel Aviv, May 2013 Joint work with Dario Cordero-Erausquin. A bijection We present a correspondence between convex functions and Borel

More information

Rare event simulation for the ruin problem with investments via importance sampling and duality

Rare event simulation for the ruin problem with investments via importance sampling and duality Rare event simulation for the ruin problem with investments via importance sampling and duality Jerey Collamore University of Copenhagen Joint work with Anand Vidyashankar (GMU) and Guoqing Diao (GMU).

More information

Theory and Applications of Stochastic Systems Lecture Exponential Martingale for Random Walk

Theory and Applications of Stochastic Systems Lecture Exponential Martingale for Random Walk Instructor: Victor F. Araman December 4, 2003 Theory and Applications of Stochastic Systems Lecture 0 B60.432.0 Exponential Martingale for Random Walk Let (S n : n 0) be a random walk with i.i.d. increments

More information

Extremal properties of the variance and the quantum Fisher information; Phys. Rev. A 87, (2013).

Extremal properties of the variance and the quantum Fisher information; Phys. Rev. A 87, (2013). 1 / 24 Extremal properties of the variance and the quantum Fisher information; Phys. Rev. A 87, 032324 (2013). G. Tóth 1,2,3 and D. Petz 4,5 1 Theoretical Physics, University of the Basque Country UPV/EHU,

More information

Sparse Legendre expansions via l 1 minimization

Sparse Legendre expansions via l 1 minimization Sparse Legendre expansions via l 1 minimization Rachel Ward, Courant Institute, NYU Joint work with Holger Rauhut, Hausdorff Center for Mathematics, Bonn, Germany. June 8, 2010 Outline Sparse recovery

More information

A LARGE DEVIATION PRINCIPLE FOR THE ERDŐS RÉNYI UNIFORM RANDOM GRAPH

A LARGE DEVIATION PRINCIPLE FOR THE ERDŐS RÉNYI UNIFORM RANDOM GRAPH A LARGE DEVIATION PRINCIPLE FOR THE ERDŐS RÉNYI UNIFORM RANDOM GRAPH AMIR DEMBO AND EYAL LUBETZKY Abstract. Starting with the large deviation principle (ldp) for the Erdős Rényi binomial random graph G(n,

More information

N. GOZLAN, C. ROBERTO, P-M. SAMSON

N. GOZLAN, C. ROBERTO, P-M. SAMSON FROM DIMENSION FREE CONCENTRATION TO THE POINCARÉ INEQUALITY N. GOZLAN, C. ROBERTO, P-M. SAMSON Abstract. We prove that a probability measure on an abstract metric space satisfies a non trivial dimension

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

Ordinal optimization - Empirical large deviations rate estimators, and multi-armed bandit methods

Ordinal optimization - Empirical large deviations rate estimators, and multi-armed bandit methods Ordinal optimization - Empirical large deviations rate estimators, and multi-armed bandit methods Sandeep Juneja Tata Institute of Fundamental Research Mumbai, India joint work with Peter Glynn Applied

More information

ON THE DEFINITION OF RELATIVE PRESSURE FOR FACTOR MAPS ON SHIFTS OF FINITE TYPE. 1. Introduction

ON THE DEFINITION OF RELATIVE PRESSURE FOR FACTOR MAPS ON SHIFTS OF FINITE TYPE. 1. Introduction ON THE DEFINITION OF RELATIVE PRESSURE FOR FACTOR MAPS ON SHIFTS OF FINITE TYPE KARL PETERSEN AND SUJIN SHIN Abstract. We show that two natural definitions of the relative pressure function for a locally

More information

Asymptotics of minimax stochastic programs

Asymptotics 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

Combinatorics in Banach space theory Lecture 12

Combinatorics in Banach space theory Lecture 12 Combinatorics in Banach space theory Lecture The next lemma considerably strengthens the assertion of Lemma.6(b). Lemma.9. For every Banach space X and any n N, either all the numbers n b n (X), c n (X)

More information

Convolutions and Their Tails. Anirban DasGupta

Convolutions and Their Tails. Anirban DasGupta Convolutions and Their Tails Anirban DasGupta 1 Y, Z : (Ω, A, P) (X, B), Y, Z independent. Distribution of Y + Z = Convolution of the distributions of Y, Z. Colloquial: Convolution of Y and Z. 2 Convolution

More information

Introduction to optimal transport

Introduction to optimal transport Introduction to optimal transport Nicola Gigli May 20, 2011 Content Formulation of the transport problem The notions of c-convexity and c-cyclical monotonicity The dual problem Optimal maps: Brenier s

More information

Approximations of displacement interpolations by entropic interpolations

Approximations of displacement interpolations by entropic interpolations Approximations of displacement interpolations by entropic interpolations Christian Léonard Université Paris Ouest Mokaplan 10 décembre 2015 Interpolations in P(X ) X : Riemannian manifold (state space)

More information

Optimal Estimation of a Nonsmooth Functional

Optimal Estimation of a Nonsmooth Functional Optimal Estimation of a Nonsmooth Functional T. Tony Cai Department of Statistics The Wharton School University of Pennsylvania http://stat.wharton.upenn.edu/ tcai Joint work with Mark Low 1 Question Suppose

More information

Math 5051 Measure Theory and Functional Analysis I Homework Assignment 2

Math 5051 Measure Theory and Functional Analysis I Homework Assignment 2 Math 551 Measure Theory and Functional nalysis I Homework ssignment 2 Prof. Wickerhauser Due Friday, September 25th, 215 Please do Exercises 1, 4*, 7, 9*, 11, 12, 13, 16, 21*, 26, 28, 31, 32, 33, 36, 37.

More information

Asymptotic efficiency of simple decisions for the compound decision problem

Asymptotic efficiency of simple decisions for the compound decision problem Asymptotic efficiency of simple decisions for the compound decision problem Eitan Greenshtein and Ya acov Ritov Department of Statistical Sciences Duke University Durham, NC 27708-0251, USA e-mail: eitan.greenshtein@gmail.com

More information

Random regular digraphs: singularity and spectrum

Random regular digraphs: singularity and spectrum Random regular digraphs: singularity and spectrum Nick Cook, UCLA Probability Seminar, Stanford University November 2, 2015 Universality Circular law Singularity probability Talk outline 1 Universality

More information

Generalized Orlicz spaces and Wasserstein distances for convex concave scale functions

Generalized Orlicz spaces and Wasserstein distances for convex concave scale functions Bull. Sci. math. 135 (2011 795 802 www.elsevier.com/locate/bulsci Generalized Orlicz spaces and Wasserstein distances for convex concave scale functions Karl-Theodor Sturm Institut für Angewandte Mathematik,

More information

Towards control over fading channels

Towards control over fading channels Towards control over fading channels Paolo Minero, Massimo Franceschetti Advanced Network Science University of California San Diego, CA, USA mail: {minero,massimo}@ucsd.edu Invited Paper) Subhrakanti

More information

Abstract Convexity: Results and Speculations

Abstract Convexity: Results and Speculations Abstract Convexity: Results and Speculations Tobias Fritz Max Planck Institut für Mathematik, Bonn Mathematical Colloquium Hagen, 26 Nov 29 Overview. Introducing convex spaces 2. A Hahn-Banach theorem

More information