Hypercontractivity of spherical averages in Hamming space
|
|
- Ezra Bradley
- 5 years ago
- Views:
Transcription
1 Hypercontractivity of spherical averages in Hamming space Yury Polyanskiy Department of EECS MIT Allerton Conference, Oct 2, 2014 Yury Polyanskiy Hypercontractivity in Hamming space 1
2 Hypercontractivity: definition L p -norms of random variables: ( f(x) Lp(µ) f(x) p µ(dx) U p (E[ U p ]) 1 p ) 1 p Let P XY joint distribution. Define T Y X stochastic (Markov) averaging operator T Y X f(x) E[f(Y ) X = x] = T f p f p by Jensen s. Yury Polyanskiy Hypercontractivity in Hamming space 2
3 Hypercontractivity: definition L p -norms of random variables: ( f(x) Lp(µ) f(x) p µ(dx) U p (E[ U p ]) 1 p ) 1 p Let P XY joint distribution. Define T Y X stochastic (Markov) averaging operator T Y X f(x) E[f(Y ) X = x] = T f p f p by Jensen s. T is hypercontractive if T p q = 1 for p < q: T f q f p, T p q sup f T f q f p T f gains integrability! (by smoothing peaks) T is HC for some p T is HC for all p. Yury Polyanskiy Hypercontractivity in Hamming space 2
4 Hypercontractivity: examples Nelson-Gross: (X, Y ) jointly Gaussian: E[f(Y ) X] 4 f(y ) 2 ρ(x, Y ) 1 3. [ ] Bonami-Gross: (X, Y ) 1 1 δ δ 2 BSS(δ): δ 1 δ E[f(Y ) X] q f(y ) p p 1 (1 2δ)2 q 1 Bonami-Beckner: T p q = 1 T n p q = 1 Ahslwede-Gács: for finite X, Y pretty much any T Y X is HC Yury Polyanskiy Hypercontractivity in Hamming space 3
5 What is HC good for? Canonical example: Estimate probability of a rectangle P[X A, Y B], where P[X A] P[Y B] = θ 1. Spectral gap (expanders, etc): 1 = σ 1 (T ) > σ 2 (T ) > P[X A, Y B] θ 2 + σ 2 θ(1 θ) σ 2 θ Hypercontractivity: P[X A, Y B] = (1 A, T 1 B ) 1 A q T 1 B q 1 A q 1 B p = θ 1 1 q + 1 p = θ 1+ɛ σ 2 θ (!) Note: Used 0/1 nature of indicator functions. Yury Polyanskiy Hypercontractivity in Hamming space 4
6 Hypercontractivity and KL-divergence P X P Y X P Y X Y Q X Q Y Apply to typical sets: So we get: 2 nd(q X P X ) P[X n T n [Q X ], Y n T n [Q Y ] ] 2 n 1 q D(Q X P X ) n 1 p D(Q Y P Y ) T Y X p q = 1 = D(Q Y P Y ) p q D(Q X P X ) Q X Yury Polyanskiy Hypercontractivity in Hamming space 5
7 Hypercontractivity and KL-divergence P X P Y X P Y X Y Q X Q Y Apply to typical sets: So we get: 2 nd(q X P X ) P[X n T n [Q X ], Y n T n [Q Y ] ] 2 n 1 q D(Q X P X ) n 1 p D(Q Y P Y ) T Y X p q = 1 = D(Q Y P Y ) p q D(Q X P X ) Q X = Yury Polyanskiy Hypercontractivity in Hamming space 5
8 Hypercontractivity and KL-divergence P X P Y X P Y X Y Q X Q Y For fixed P XY, KL-contraction ratio: η KL (P XY ) sup Q X D(Q Y P Y ) D(Q X P X ) = sup U X Y I(U; Y ) I(U; X) Yury Polyanskiy Hypercontractivity in Hamming space 6
9 Hypercontractivity and KL-divergence P X P Y X P Y X Y Q X Q Y For fixed P XY, KL-contraction ratio: Theorem (Ahlswede-Gács) Roughly: η KL (P XY ) sup Q X D(Q Y P Y ) D(Q X P X ) = η KL (P XY ) = inf sup U X Y { } p q : T Y X p q = 1 I(U; Y ) I(U; X) Q X : D(Q Y P Y ) rd(q X P X ) = T Y X p p r = 1, p 1 Yury Polyanskiy Hypercontractivity in Hamming space 6
10 Hypercontractivity and KL-divergence [Nair 2014]: Apply HC to typical sets of arbitrary Q XY to get T Y X p q = 1 = 1 p D(Q Y P Y ) 1 q D(Q X P X ) + D(Q Y X P Y X Q X ) Q XY Yury Polyanskiy Hypercontractivity in Hamming space 7
11 Hypercontractivity and KL-divergence [Nair 2014]: Apply HC to typical sets of arbitrary Q XY to get T Y X p q = 1 1 p D(Q Y P Y ) 1 q D(Q X P X ) + D(Q Y X P Y X Q X ) Q XY Proof: Take g 1 1 = 1 and let f = (g 1 ) 1 p STP: T f q 1. Ahlswede-Gács: L p Nair: Q X (x) = P X (x) T f(x)q T f q q Q Y X (y x) = P Y X (y x) Q X (x) =... same... Q Y X (y x) = P Y X (y x) f(y) T f(x) log T f q 1 p D(Q Y P Y ) 1 q D(Q X P X ) D(Q Y X P Y X Q X ) 0 Yury Polyanskiy Hypercontractivity in Hamming space 7
12 Hypercontractivity and KL-divergence [Nair 2014]: Apply HC to typical sets of arbitrary Q XY to get T Y X p q = 1 1 p D(Q Y P Y ) 1 q D(Q X P X ) + D(Q Y X P Y X Q X ) Q XY Proof: Take g 1 1 = 1 and let f = (g 1 ) 1 p STP: T f q 1. Ahlswede-Gács: L p Nair: Q X (x) = P X (x) T f(x)q T f q q Q Y X (y x) = P Y X (y x) Q X (x) =... same... Q Y X (y x) = P Y X (y x) f(y) T f(x) log T f q 1 p D(Q Y P Y ) 1 q D(Q X P X ) D(Q Y X P Y X Q X ) 0 Note: For p 1 both have Q Y X P Y X. Yury Polyanskiy Hypercontractivity in Hamming space 7
13 L p L q norm as measure of dependence T Y X p q measures dependence: Invariant to relabeling Satisfies data-processing Unusual: sticky at 1. Yury Polyanskiy Hypercontractivity in Hamming space 8
14 L p L q norm as measure of dependence T Y X p q measures dependence: Invariant to relabeling Satisfies data-processing Unusual: sticky at 1. Turns out the last one is a general phenomenon: All operators T sufficiently noisy are p q HC. Yury Polyanskiy Hypercontractivity in Hamming space 8
15 Semenov-Shneiberg 88 Theorem For any q 2 p there is ɛ = ɛ(p, q) s.t. simultaneously for all P XY : T Y X E Y p q ɛ T Y X p q = 1 where E Y f 1 X E[f(Y )]. Remarks: Also for general q < p with extra condition: T E 2 2 ɛ Also for other operators of the type: T 1 Y = 1 X, (1 X, T ) = (1 X, E ) Orig. result is for P X = P Y, but proof easily generalizes. For finite (X, Y ), suff. to check P XY P X P Y T V ɛ = ɛ (p, q, P X, P Y ) Yury Polyanskiy Hypercontractivity in Hamming space 9
16 Semenov-Shneiberg 88: Proof Proof for q 2 p: WLOG can take f = 1 + Z with Z 1. Decompose T = E +. STP: ( ) 1 + Z q 1 + Z p Cool fact: universal τ, a, b s.t. 1 + Z q 1 + a Z 2 q if Z q τ 1 + Z p 1 + b Z 2 p if Z p τ Whenever 2 p q b a and Z p τ: 1 + Z) q 1 + a Z 2 q 1 + Z p Yury Polyanskiy Hypercontractivity in Hamming space 10
17 Semenov-Shneiberg 88: Proof Proof for q 2 p: WLOG can take f = 1 + Z with Z 1. Decompose T = E +. STP: ( ) 1 + Z q 1 + Z p Cool fact: universal τ, a, b s.t. 1 + Z q 1 + a Z 2 q if Z q τ 1 + Z p 1 + b Z 2 p if Z p τ Whenever 2 p q b a and Z p τ: 1 + Z) q 1 + a Z 2 q 1 + Z p Large Z: Another cool fact: universal β p ( ) 1 + Z p 1 + β p ( Z p ), and β p(u) u increasing So (*) holds if p q βp(τ) τ. Yury Polyanskiy Hypercontractivity in Hamming space 10
18 Spherical averages in Hamming space Hamming space F n 2 with uniform probability Bonami-Gross operator N δ f(x) E[f(x + Z)], Z Bern(δ) n Spherical average: T δ f(x) E[f(x + Z)], Z Unif(S δn ) where S j {y : wt(y) = j}. Theorem (P 13) δ 1 2 and p = 1 + (1 2δ)2 there is a dim-independent C p,δ s.t. T δ f 2 C p,δ f p Remark: Bonami-Gross N δ f 2 1 f p Yury Polyanskiy Hypercontractivity in Hamming space 11
19 Hypercontractivity of T δ : exact version 1 + (1 2δ)2 p 2 F = (δ, p) : 0 δ 1 p 1 Theorem (P 13) For any compact subset K F there is a constant C K s.t. T δ p 2 C K (δ, p) K, where T δ f = f P Z, P Z = Unif(S δn ). For p = 1, δ = 1/2: T 1 p 2 = θ(n 1 4 ). 2 Note: for Bernoulli noise N δ p 2 = 1 everywhere on closure of F. Yury Polyanskiy Hypercontractivity in Hamming space 12
20 Proof: Prelim remarks Why is constant not 1? Let 1 even = 1{x : wt(x)-even} Then: T δ 1 even = 1 even (or 1 odd ) So: T δ p q 2 1 p 1 q > 1. Yury Polyanskiy Hypercontractivity in Hamming space 13
21 Proof: Prelim remarks Why is constant not 1? Let 1 even = 1{x : wt(x)-even} Then: T δ 1 even = 1 even (or 1 odd ) So: T δ p q 2 1 p 1 q > 1. Beautiful methods that failed: Tensorization (T δ not a tensor power) Semigroup method, aka d dδ (T δ not a semigroup) Comparison of Dirichlet forms (not useful for δ 1 n ) Ugly method that worked: Direct computation of eigenvalues of T δ Yury Polyanskiy Hypercontractivity in Hamming space 13
22 Proof: Orthogonal decomposition T δ and N δ are S n -equivariant f(x) = poly(( 1) x 1,..., ( 1) xn ) = n f a (x), a=0 where f a (x) = degree a part of the poly. By odd/even trick can assume f a = 0 for a n/2. Have: N δ f a = (1 2δ) a f a T δ f a = (?? ) f a Yury Polyanskiy Hypercontractivity in Hamming space 14
23 Proof: Orthogonal decomposition T δ and N δ are S n -equivariant f(x) = poly(( 1) x 1,..., ( 1) xn ) = n f a (x), a=0 where f a (x) = degree a part of the poly. By odd/even trick can assume f a = 0 for a n/2. Have: N δ f a = (1 2δ) a f a T δ f a = κ δn (a) f a and κ δn (a) Krawtchouk polynomial of degree δn. Yury Polyanskiy Hypercontractivity in Hamming space 14
24 Proof (cont d): Eigenvalues of N δ vs T δ 0 Asymptotic spectra of T δ and N δ : δ = 0.1 Bernoulli noise N δ Spherical average T δ 0.05 (1/n) log(fourier coef.) a/n Yury Polyanskiy Hypercontractivity in Hamming space 15
25 Proof (cont d): Eigenvalues of N δ vs T δ 0 Asymptotic spectra of T δ and N δ : δ = 0.1 Bernoulli noise N δ Spherical average T δ 0.05 (1/n) log(fourier coef.) For any eigenspace a λ a (T δ ) λ a (N δ ) a/n Yury Polyanskiy Hypercontractivity in Hamming space 15
26 Proof (cont d): Eigenvalues of N δ vs T δ 0 Asymptotic spectra of T δ and N δ : δ = 0.1 Bernoulli noise N δ Spherical average T δ 0.05 (1/n) log(fourier coef.) For any eigenspace a λ a (T δ ) λ a (N δ ) But only for δ 0.17! a/n Yury Polyanskiy Hypercontractivity in Hamming space 15
27 Proof (cont d): Failure for δ Asymptotic spectra of T δ and N δ : δ = 0.25 Fourier projection norm Π a p(δ) > Bernoulli noise N δ Spherical average T δ (1/n) log(fourier coef.) a/n Yury Polyanskiy Hypercontractivity in Hamming space 16
28 Proof (cont d): Failure for δ Asymptotic spectra of T δ and N δ : δ = 0.25 Fourier projection norm Π a p(δ) > Bernoulli noise N δ Spherical average T δ 0.1 (1/n) log(fourier coef.) When δ > 0.17 and a large λ a (T δ ) λ a (N δ ) 0.35 Fortunately: f a 2 f a/n Yury Polyanskiy Hypercontractivity in Hamming space 16
29 Proof (cont d): Overall argument Know: N δ f 2 2 = a (1 2δ) 2a f a 2 2 f 2 p by Bonami! Need to show: T δ f 2 2 = a κ δn (a) 2 f a 2 2 C f 2 p a a crit : κ δn (a) 2 f a 2 2 C (1 2δ) 2a f a 2 2 a a crit a = C N δ f 2 2 C f 2 p a > a crit : Need extra estimate: κ δn (a) f a 2 e Cn f p = a ξ crit n contributes C f 2 p. Yury Polyanskiy Hypercontractivity in Hamming space 17
30 Proof (cont d): Overall argument Know: N δ f 2 2 = a (1 2δ) 2a f a 2 2 f 2 p by Bonami! Need to show: T δ f 2 2 = a κ δn (a) 2 f a 2 2 C f 2 p a a crit : For δ < 0.17: a crit = n/2! κ δn (a) 2 f a 2 2 C (1 2δ) 2a f a 2 2 a a crit a a > a crit : Need extra estimate: = C N δ f 2 2 C f 2 p κ δn (a) f a 2 e Cn f p = a ξ crit n contributes C f 2 p. Yury Polyanskiy Hypercontractivity in Hamming space 17
31 Application to additive-combinatorics Known fact: Subspace L F n 2 s.t. L S δn S δn implies dim L n. Yury Polyanskiy Hypercontractivity in Hamming space 18
32 Application to additive-combinatorics Known fact: Subspace L F n 2 s.t. L S δn S δn implies dim L n. Corollary Let A F n 2 be a subset s.t. sumset A + A intersects some S δn with average multiplicty > λ A. Then Proof: Statement means A λ ɛ 2 n. 2 n (1 A 1 A, 1 Sδn ) λ A S δn Rearrange (1 A 1 A, 1 S ) = (T δ 1 A, 1A) Apply Hölder and HC. Yury Polyanskiy Hypercontractivity in Hamming space 18
33 Thank you! References R. Ahlswede and P. Gacs, Spreading of sets in product spaces and hypercontraction of the Markov operator, Ann. Probab., pp , E. M. Semenov and I. Y. Shneiberg, Hypercontractive operators and Khinchin s inequality, Func. Analysis and Appl., vol. 22, no. 3, pp , Y. Polyanskiy, Hypercontractivity of spherical averages in Hamming space, arxiv: , Sep Y. Polyanskiy, Hypothesis testing via a comparator and hypercontractivity, preprint, Feb C. Nair, Equivalent formulations of hypercontractivity using information measures, Zurich Seminar on Comm., 2014 Yury Polyanskiy Hypercontractivity in Hamming space 19
34 Dobrushin coefficient total variation P Q TV = 1 2 dp dq Dobrushin coefficient η TV = P Y Q Y sup TV P X Q X P X Q X TV Original motivation: mixing of Markov chains = sup x,x P Y X=x P Y X=x TV. Yury Polyanskiy Hypercontractivity in Hamming space 20
35 Contraction coeffs and mixing of Markov chains Consider a M.C. with invariant dist. P : Contraction: X 0 X 1 X 2 P Xn P TV (η TV ) n χ 2 (P Xn P ) (η χ 2) n χ 2 (P X0 P ) D(P Xn P ) (η KL ) n D(P X0 P ) (Dobrushin) (spectral gap) (log-sobolev) Yury Polyanskiy Hypercontractivity in Hamming space 21
36 Contraction coeffs and mixing of Markov chains Consider a M.C. with invariant dist. P : Contraction: X 0 X 1 X 2 P Xn P TV (η TV ) n χ 2 (P Xn P ) (η χ 2) n χ 2 (P X0 P ) D(P Xn P ) (η KL ) n D(P X0 P ) (Dobrushin) (spectral gap) (log-sobolev) TODO: add mixing estimate via HC Yury Polyanskiy Hypercontractivity in Hamming space 21
37 From TV to KL... and further Theorem (Cohen-Iwasa-Rautu-Ruskai-Seneta-Zbăganu 93) η KL η TV Yury Polyanskiy Hypercontractivity in Hamming space 22
38 From TV to KL... and further Theorem (Cohen-Iwasa-Rautu-Ruskai-Seneta-Zbăganu 93) η KL η TV Fun application: Let T kernel of a finite-state M.C. with invariant distribution P. Let E be indep. M.C.: Ef fdp If T (x, ) E(x, ) TV < 1/2 then η TV = max x,x T (x, ) T (x, ) TV < 1 Then η KL < 1. By Ahslwede-Gács q 1 T f q f p, p = η KL q < q (hypercont) There is a ball around E s.t. for all T : T Lp L q = 1. Yury Polyanskiy Hypercontractivity in Hamming space 22
39 From TV to KL... and further Theorem (Cohen-Iwasa-Rautu-Ruskai-Seneta-Zbăganu 93) η KL η TV Fun application: Let T kernel of a finite-state M.C. with invariant distribution P. Let E be indep. M.C.: Ef fdp If T (x, ) E(x, ) TV < 1/2 then η TV = max x,x T (x, ) T (x, ) TV < 1 Then η KL < 1. By Ahslwede-Gács q 1 T f q f p, p = η KL q < q (hypercont) There is a ball around E s.t. for all T : T Lp L q = 1. Every (mixing) M.C. eventually (hyper-)contracts L p L q. Yury Polyanskiy Hypercontractivity in Hamming space 22
40 From TV to KL... and further Theorem (Cohen-Iwasa-Rautu-Ruskai-Seneta-Zbăganu 93) η KL η TV Fun application: Let T kernel of a finite-state M.C. with invariant distribution P. Let E be indep. M.C.: Ef fdp If T (x, ) E(x, ) TV < 1/2 then η TV = max x,x T (x, ) T (x, ) TV < 1 Then η KL < 1. By Ahslwede-Gács q 1 T f q f p, p = η KL q < q (hypercont) There is a ball around E s.t. for all T : T Lp L q = 1. Every (mixing) M.C. eventually (hyper-)contracts L p L q. Euclidean space: planar face of the ball of Fourier multipliers: [Segal 70], [Fefferman-Shapiro 72], [Semenov-Shneiberg 88] Yury Polyanskiy Hypercontractivity in Hamming space 22
Chapter 9: Basic of Hypercontractivity
Analysis of Boolean Functions Prof. Ryan O Donnell Chapter 9: Basic of Hypercontractivity Date: May 6, 2017 Student: Chi-Ning Chou Index Problem Progress 1 Exercise 9.3 (Tightness of Bonami Lemma) 2/2
More informationStrong data processing inequalities in power-constrained Gaussian channels
Strong data processing inequalities in power-constrained Gaussian channels The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation
More informationNon-interactive Simulation of Joint Distributions: The Hirschfeld-Gebelein-Rényi Maximal Correlation and the Hypercontractivity Ribbon
Non-interactive Simulation of Joint Distributions: The Hirschfeld-Gebelein-Rényi Maximal Correlation and the Hypercontractivity Ribbon Sudeep Kamath and Venkat Anantharam EECS Department University of
More informationx log x, which is strictly convex, and use Jensen s Inequality:
2. Information measures: mutual information 2.1 Divergence: main inequality Theorem 2.1 (Information Inequality). D(P Q) 0 ; D(P Q) = 0 iff P = Q Proof. Let ϕ(x) x log x, which is strictly convex, and
More informationECE598: Information-theoretic methods in high-dimensional statistics Spring 2016
ECE598: Information-theoretic methods in high-dimensional statistics Spring 06 Lecture : Mutual Information Method Lecturer: Yihong Wu Scribe: Jaeho Lee, Mar, 06 Ed. Mar 9 Quick review: Assouad s lemma
More informationMixing in Product Spaces. Elchanan Mossel
Poincaré Recurrence Theorem Theorem (Poincaré, 1890) Let f : X X be a measure preserving transformation. Let E X measurable. Then P[x E : f n (x) / E, n > N(x)] = 0 Poincaré Recurrence Theorem Theorem
More informationMGMT 69000: Topics in High-dimensional Data Analysis Falll 2016
MGMT 69000: Topics in High-dimensional Data Analysis Falll 2016 Lecture 14: Information Theoretic Methods Lecturer: Jiaming Xu Scribe: Hilda Ibriga, Adarsh Barik, December 02, 2016 Outline f-divergence
More informationHypercontractivity, Maximal Correlation and Non-interactive Simulation
Hypercontractivity, Maximal Correlation and Non-interactive Simulation Dept. Electrical Engineering, Stanford University Dec 4, 2014 Non-interactive Simulation Scenario: non-interactive simulation: Alice
More informationLogarithmic Harnack inequalities
Logarithmic Harnack inequalities F. R. K. Chung University of Pennsylvania Philadelphia, Pennsylvania 19104 S.-T. Yau Harvard University Cambridge, assachusetts 02138 1 Introduction We consider the relationship
More informationFourier analysis of boolean functions in quantum computation
Fourier analysis of boolean functions in quantum computation Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical Physics, University of Cambridge
More informationReverse Hyper Contractive Inequalities: What? Why?? When??? How????
Reverse Hyper Contractive Inequalities: What? Why?? When??? How???? UC Berkeley Warsaw Cambridge May 21, 2012 Hyper-Contractive Inequalities The noise (Bonami-Beckner) semi-group on { 1, 1} n 1 2 Def 1:
More informationON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS
Bendikov, A. and Saloff-Coste, L. Osaka J. Math. 4 (5), 677 7 ON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS ALEXANDER BENDIKOV and LAURENT SALOFF-COSTE (Received March 4, 4)
More informationDistance-Divergence Inequalities
Distance-Divergence Inequalities Katalin Marton Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences Motivation To find a simple proof of the Blowing-up Lemma, proved by Ahlswede,
More informationBrownian Motion. 1 Definition Brownian Motion Wiener measure... 3
Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................
More informationHOPF S DECOMPOSITION AND RECURRENT SEMIGROUPS. Josef Teichmann
HOPF S DECOMPOSITION AND RECURRENT SEMIGROUPS Josef Teichmann Abstract. Some results of ergodic theory are generalized in the setting of Banach lattices, namely Hopf s maximal ergodic inequality and the
More informationStrengthened Sobolev inequalities for a random subspace of functions
Strengthened Sobolev inequalities for a random subspace of functions Rachel Ward University of Texas at Austin April 2013 2 Discrete Sobolev inequalities Proposition (Sobolev inequality for discrete images)
More informationThe heat kernel meets Approximation theory. theory in Dirichlet spaces
The heat kernel meets Approximation theory in Dirichlet spaces University of South Carolina with Thierry Coulhon and Gerard Kerkyacharian Paris - June, 2012 Outline 1. Motivation and objectives 2. The
More informationBoolean Functions: Influence, threshold and noise
Boolean Functions: Influence, threshold and noise Einstein Institute of Mathematics Hebrew University of Jerusalem Based on recent joint works with Jean Bourgain, Jeff Kahn, Guy Kindler, Nathan Keller,
More informationLecture 3: Expected Value. These integrals are taken over all of Ω. If we wish to integrate over a measurable subset A Ω, we will write
Lecture 3: Expected Value 1.) Definitions. If X 0 is a random variable on (Ω, F, P), then we define its expected value to be EX = XdP. Notice that this quantity may be. For general X, we say that EX exists
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,
More information1 9/5 Matrices, vectors, and their applications
1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric
More information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More informationModern Discrete Probability Spectral Techniques
Modern Discrete Probability VI - Spectral Techniques Background Sébastien Roch UW Madison Mathematics December 22, 2014 1 Review 2 3 4 Mixing time I Theorem (Convergence to stationarity) Consider a finite
More informationLecture 35: December The fundamental statistical distances
36-705: Intermediate Statistics Fall 207 Lecturer: Siva Balakrishnan Lecture 35: December 4 Today we will discuss distances and metrics between distributions that are useful in statistics. I will be lose
More informationConvergence of Feller Processes
Chapter 15 Convergence of Feller Processes This chapter looks at the convergence of sequences of Feller processes to a iting process. Section 15.1 lays some ground work concerning weak convergence of processes
More informationDetailed Proofs of Lemmas, Theorems, and Corollaries
Dahua Lin CSAIL, MIT John Fisher CSAIL, MIT A List of Lemmas, Theorems, and Corollaries For being self-contained, we list here all the lemmas, theorems, and corollaries in the main paper. Lemma. The joint
More informationSpectral Gap and Concentration for Some Spherically Symmetric Probability Measures
Spectral Gap and Concentration for Some Spherically Symmetric Probability Measures S.G. Bobkov School of Mathematics, University of Minnesota, 127 Vincent Hall, 26 Church St. S.E., Minneapolis, MN 55455,
More informationAnalytic families of multilinear operators
Analytic families of multilinear operators Mieczysław Mastyło Adam Mickiewicz University in Poznań Nonlinar Functional Analysis Valencia 17-20 October 2017 Based on a joint work with Loukas Grafakos M.
More informationAn upper bound on l q norms of noisy functions
Electronic Collouium on Computational Complexity, Report No. 68 08 An upper bound on l norms of noisy functions Alex Samorodnitsky Abstract Let T ɛ, 0 ɛ /, be the noise operator acting on functions on
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationLogarithmic Sobolev inequalities in discrete product spaces: proof by a transportation cost distance
Logarithmic Sobolev inequalities in discrete product spaces: proof by a transportation cost distance Katalin Marton Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences Relative entropy
More information215 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that
15 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that µ ν tv = (1/) x S µ(x) ν(x) = x S(µ(x) ν(x)) + where a + = max(a, 0). Show that
More informationMeasure and Integration: Solutions of CW2
Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost
More information7 Convergence in R d and in Metric Spaces
STA 711: Probability & Measure Theory Robert L. Wolpert 7 Convergence in R d and in Metric Spaces A sequence of elements a n of R d converges to a limit a if and only if, for each ǫ > 0, the sequence a
More informationTrotter s product formula for projections
Trotter s product formula for projections Máté Matolcsi, Roman Shvydkoy February, 2002 Abstract The aim of this paper is to examine the convergence of Trotter s product formula when one of the C 0-semigroups
More informationLectures 22-23: Conditional Expectations
Lectures 22-23: Conditional Expectations 1.) Definitions Let X be an integrable random variable defined on a probability space (Ω, F 0, P ) and let F be a sub-σ-algebra of F 0. Then the conditional expectation
More informationImproved log-sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube
Improved log-sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube Yury Polyanskiy a, Alex Samorodnitsky b a Department of Electrical Engineering and Computer Science, MIT,
More informationPCA 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 informationThe Logarithmic Sobolev Constant of Some Finite Markov Chains. Wai Wai Liu
CORNELL UNIVERSITY MATHEMATICS DEPARTMENT SENIOR THESIS The Logarithmic Sobolev Constant of Some Finite Markov Chains A THESIS PRESENTED IN PARTIAL FULFILLMENT OF CRITERIA FOR HONORS IN MATHEMATICS Wai
More information21.1 Lower bounds on minimax risk for functional estimation
ECE598: Information-theoretic methods in high-dimensional statistics Spring 016 Lecture 1: Functional estimation & testing Lecturer: Yihong Wu Scribe: Ashok Vardhan, Apr 14, 016 In this chapter, we will
More informationA COUNTEREXAMPLE TO AN ENDPOINT BILINEAR STRICHARTZ INEQUALITY TERENCE TAO. t L x (R R2 ) f L 2 x (R2 )
Electronic Journal of Differential Equations, Vol. 2006(2006), No. 5, pp. 6. ISSN: 072-669. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) A COUNTEREXAMPLE
More informationHigh-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 informationRATE-OPTIMAL GRAPHON ESTIMATION. By Chao Gao, Yu Lu and Harrison H. Zhou Yale University
Submitted to the Annals of Statistics arxiv: arxiv:0000.0000 RATE-OPTIMAL GRAPHON ESTIMATION By Chao Gao, Yu Lu and Harrison H. Zhou Yale University Network analysis is becoming one of the most active
More informationIntroduction to Empirical Processes and Semiparametric Inference Lecture 12: Glivenko-Cantelli and Donsker Results
Introduction to Empirical Processes and Semiparametric Inference Lecture 12: Glivenko-Cantelli and Donsker Results Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics
More informationNonparametric Bayesian Methods (Gaussian Processes)
[70240413 Statistical Machine Learning, Spring, 2015] Nonparametric Bayesian Methods (Gaussian Processes) Jun Zhu dcszj@mail.tsinghua.edu.cn http://bigml.cs.tsinghua.edu.cn/~jun State Key Lab of Intelligent
More information5 Compact linear operators
5 Compact linear operators One of the most important results of Linear Algebra is that for every selfadjoint linear map A on a finite-dimensional space, there exists a basis consisting of eigenvectors.
More information16.1 Bounding Capacity with Covering Number
ECE598: Information-theoretic methods in high-dimensional statistics Spring 206 Lecture 6: Upper Bounds for Density Estimation Lecturer: Yihong Wu Scribe: Yang Zhang, Apr, 206 So far we have been mostly
More informationA Note on the Approximation of Perpetuities
Discrete Mathematics and Theoretical Computer Science (subm.), by the authors, rev A Note on the Approximation of Perpetuities Margarete Knape and Ralph Neininger Department for Mathematics and Computer
More informationHeat Flows, Geometric and Functional Inequalities
Heat Flows, Geometric and Functional Inequalities M. Ledoux Institut de Mathématiques de Toulouse, France heat flow and semigroup interpolations Duhamel formula (19th century) pde, probability, dynamics
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationRemarks on Extremization Problems Related To Young s Inequality
Remarks on Extremization Problems Related To Young s Inequality Michael Christ University of California, Berkeley University of Wisconsin May 18, 2016 Part 1: Introduction Young s convolution inequality
More informationCommutative 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 informationConsistency 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 informationQuantile Processes for Semi and Nonparametric Regression
Quantile Processes for Semi and Nonparametric Regression Shih-Kang Chao Department of Statistics Purdue University IMS-APRM 2016 A joint work with Stanislav Volgushev and Guang Cheng Quantile Response
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationCONTENTS. 4 Hausdorff Measure Introduction The Cantor Set Rectifiable Curves Cantor Set-Like Objects...
Contents 1 Functional Analysis 1 1.1 Hilbert Spaces................................... 1 1.1.1 Spectral Theorem............................. 4 1.2 Normed Vector Spaces.............................. 7 1.2.1
More informationLARGE 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 informationA LOWER BOUND ON THE SUBRIEMANNIAN DISTANCE FOR HÖLDER DISTRIBUTIONS
A LOWER BOUND ON THE SUBRIEMANNIAN DISTANCE FOR HÖLDER DISTRIBUTIONS SLOBODAN N. SIMIĆ Abstract. Whereas subriemannian geometry usually deals with smooth horizontal distributions, partially hyperbolic
More informationFKN Theorem on the biased cube
FKN Theorem on the biased cube Piotr Nayar Abstract In this note we consider Boolean functions defined on the discrete cube { γ, γ 1 } n equipped with a product probability measure µ n, where µ = βδ γ
More informationON THE ZERO-ONE LAW AND THE LAW OF LARGE NUMBERS FOR RANDOM WALK IN MIXING RAN- DOM ENVIRONMENT
Elect. Comm. in Probab. 10 (2005), 36 44 ELECTRONIC COMMUNICATIONS in PROBABILITY ON THE ZERO-ONE LAW AND THE LAW OF LARGE NUMBERS FOR RANDOM WALK IN MIXING RAN- DOM ENVIRONMENT FIRAS RASSOUL AGHA Department
More informationLogarithmic Sobolev Inequalities
Logarithmic Sobolev Inequalities M. Ledoux Institut de Mathématiques de Toulouse, France logarithmic Sobolev inequalities what they are, some history analytic, geometric, optimal transportation proofs
More informationSmall 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 informationMath The Laplacian. 1 Green s Identities, Fundamental Solution
Math. 209 The Laplacian Green s Identities, Fundamental Solution Let be a bounded open set in R n, n 2, with smooth boundary. The fact that the boundary is smooth means that at each point x the external
More informationSPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS
SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS TSOGTGEREL GANTUMUR Abstract. After establishing discrete spectra for a large class of elliptic operators, we present some fundamental spectral properties
More informationare Banach algebras. f(x)g(x) max Example 7.4. Similarly, A = L and A = l with the pointwise multiplication
7. Banach algebras Definition 7.1. A is called a Banach algebra (with unit) if: (1) A is a Banach space; (2) There is a multiplication A A A that has the following properties: (xy)z = x(yz), (x + y)z =
More informationBALANCING GAUSSIAN VECTORS. 1. Introduction
BALANCING GAUSSIAN VECTORS KEVIN P. COSTELLO Abstract. Let x 1,... x n be independent normally distributed vectors on R d. We determine the distribution function of the minimum norm of the 2 n vectors
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationStable 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 informationOptimal Polynomial Admissible Meshes on the Closure of C 1,1 Bounded Domains
Optimal Polynomial Admissible Meshes on the Closure of C 1,1 Bounded Domains Constructive Theory of Functions Sozopol, June 9-15, 2013 F. Piazzon, joint work with M. Vianello Department of Mathematics.
More informationConcentration inequalities for Feynman-Kac particle models. P. Del Moral. INRIA Bordeaux & IMB & CMAP X. Journées MAS 2012, SMAI Clermond-Ferrand
Concentration inequalities for Feynman-Kac particle models P. Del Moral INRIA Bordeaux & IMB & CMAP X Journées MAS 2012, SMAI Clermond-Ferrand Some hyper-refs Feynman-Kac formulae, Genealogical & Interacting
More informationInvertibility of symmetric random matrices
Invertibility of symmetric random matrices Roman Vershynin University of Michigan romanv@umich.edu February 1, 2011; last revised March 16, 2012 Abstract We study n n symmetric random matrices H, possibly
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationA Remark on Hypercontractivity and Tail Inequalities for the Largest Eigenvalues of Random Matrices
A Remark on Hypercontractivity and Tail Inequalities for the Largest Eigenvalues of Random Matrices Michel Ledoux Institut de Mathématiques, Université Paul Sabatier, 31062 Toulouse, France E-mail: ledoux@math.ups-tlse.fr
More informationOn Extracting Common Random Bits From Correlated Sources on Large Alphabets
University of Pennsylvania ScholarlyCommons Statistics Papers Wharton Faculty Research 3-2014 On Extracting Common Random Bits From Correlated Sources on Large Alphabets Siu On Chan Elchanan Mossel University
More informationVISCOSITY SOLUTIONS. We follow Han and Lin, Elliptic Partial Differential Equations, 5.
VISCOSITY SOLUTIONS PETER HINTZ We follow Han and Lin, Elliptic Partial Differential Equations, 5. 1. Motivation Throughout, we will assume that Ω R n is a bounded and connected domain and that a ij C(Ω)
More informationContraction properties of Feynman-Kac semigroups
Journées de Statistique Marne La Vallée, January 2005 Contraction properties of Feynman-Kac semigroups Pierre DEL MORAL, Laurent MICLO Lab. J. Dieudonné, Nice Univ., LATP Univ. Provence, Marseille 1 Notations
More informationQuantum boolean functions
Quantum boolean functions Ashley Montanaro 1 and Tobias Osborne 2 1 Department of Computer Science 2 Department of Mathematics University of Bristol Royal Holloway, University of London Bristol, UK London,
More informationSpectral theory for compact operators on Banach spaces
68 Chapter 9 Spectral theory for compact operators on Banach spaces Recall that a subset S of a metric space X is precompact if its closure is compact, or equivalently every sequence contains a Cauchy
More informationOn 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 informationConcentration inequalities for non-lipschitz functions
Concentration inequalities for non-lipschitz functions University of Warsaw Berkeley, October 1, 2013 joint work with Radosław Adamczak (University of Warsaw) Gaussian concentration (Sudakov-Tsirelson,
More information5.1 Inequalities via joint range
ECE598: Information-theoretic methods in high-dimensional statistics Spring 2016 Lecture 5: Inequalities between f-divergences via their joint range Lecturer: Yihong Wu Scribe: Pengkun Yang, Feb 9, 2016
More informationLecture 2: Convex Sets and Functions
Lecture 2: Convex Sets and Functions Hyang-Won Lee Dept. of Internet & Multimedia Eng. Konkuk University Lecture 2 Network Optimization, Fall 2015 1 / 22 Optimization Problems Optimization problems are
More informationTwo-sample hypothesis testing for random dot product graphs
Two-sample hypothesis testing for random dot product graphs Minh Tang Department of Applied Mathematics and Statistics Johns Hopkins University JSM 2014 Joint work with Avanti Athreya, Vince Lyzinski,
More informationClassical Fourier Analysis
Loukas Grafakos Classical Fourier Analysis Second Edition 4y Springer 1 IP Spaces and Interpolation 1 1.1 V and Weak IP 1 1.1.1 The Distribution Function 2 1.1.2 Convergence in Measure 5 1.1.3 A First
More informationMath 5210, Definitions and Theorems on Metric Spaces
Math 5210, Definitions and Theorems on Metric Spaces Let (X, d) be a metric space. We will use the following definitions (see Rudin, chap 2, particularly 2.18) 1. Let p X and r R, r > 0, The ball of radius
More informationMath 172 HW 1 Solutions
Math 172 HW 1 Solutions Joey Zou April 15, 2017 Problem 1: Prove that the Cantor set C constructed in the text is totally disconnected and perfect. In other words, given two distinct points x, y C, there
More informationDefinition 6.1. A metric space (X, d) is complete if every Cauchy sequence tends to a limit in X.
Chapter 6 Completeness Lecture 18 Recall from Definition 2.22 that a Cauchy sequence in (X, d) is a sequence whose terms get closer and closer together, without any limit being specified. In the Euclidean
More informationSCALE INVARIANT FOURIER RESTRICTION TO A HYPERBOLIC SURFACE
SCALE INVARIANT FOURIER RESTRICTION TO A HYPERBOLIC SURFACE BETSY STOVALL Abstract. This result sharpens the bilinear to linear deduction of Lee and Vargas for extension estimates on the hyperbolic paraboloid
More informationTopics in Harmonic Analysis Lecture 6: Pseudodifferential calculus and almost orthogonality
Topics in Harmonic Analysis Lecture 6: Pseudodifferential calculus and almost orthogonality Po-Lam Yung The Chinese University of Hong Kong Introduction While multiplier operators are very useful in studying
More informationReal Variables # 10 : Hilbert Spaces II
randon ehring Real Variables # 0 : Hilbert Spaces II Exercise 20 For any sequence {f n } in H with f n = for all n, there exists f H and a subsequence {f nk } such that for all g H, one has lim (f n k,
More informationHYPERCONTRACTIVE MEASURES, TALAGRAND S INEQUALITY, AND INFLUENCES
HYPERCONTRACTIVE MEASURES, TALAGRAND S INEQUALITY, AND INFLUENCES D. Cordero-Erausquin, M. Ledoux University of Paris 6 and University of Toulouse, France Abstract. We survey several Talagrand type inequalities
More informationRefined Bounds on the Empirical Distribution of Good Channel Codes via Concentration Inequalities
Refined Bounds on the Empirical Distribution of Good Channel Codes via Concentration Inequalities Maxim Raginsky and Igal Sason ISIT 2013, Istanbul, Turkey Capacity-Achieving Channel Codes The set-up DMC
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationbe the set of complex valued 2π-periodic functions f on R such that
. Fourier series. Definition.. Given a real number P, we say a complex valued function f on R is P -periodic if f(x + P ) f(x) for all x R. We let be the set of complex valued -periodic functions f on
More informationNon commutative Khintchine inequalities and Grothendieck s theo
Non commutative Khintchine inequalities and Grothendieck s theorem Nankai, 2007 Plan Non-commutative Khintchine inequalities 1 Non-commutative Khintchine inequalities 2 µ = Uniform probability on the set
More informationFRAMES AND TIME-FREQUENCY ANALYSIS
FRAMES AND TIME-FREQUENCY ANALYSIS LECTURE 5: MODULATION SPACES AND APPLICATIONS Christopher Heil Georgia Tech heil@math.gatech.edu http://www.math.gatech.edu/ heil READING For background on Banach spaces,
More informationSome lecture notes for Math 6050E: PDEs, Fall 2016
Some lecture notes for Math 65E: PDEs, Fall 216 Tianling Jin December 1, 216 1 Variational methods We discuss an example of the use of variational methods in obtaining existence of solutions. Theorem 1.1.
More informationA Sharpened Hausdorff-Young Inequality
A Sharpened Hausdorff-Young Inequality Michael Christ University of California, Berkeley IPAM Workshop Kakeya Problem, Restriction Problem, Sum-Product Theory and perhaps more May 5, 2014 Hausdorff-Young
More informationMetric Spaces Lecture 17
Metric Spaces Lecture 17 Homeomorphisms At the end of last lecture an example was given of a bijective continuous function f such that f 1 is not continuous. For another example, consider the sets T =
More information