Abstract

AbstractBuilding on the inequalities for homogeneous tetrahedral polynomials in independent Gaussian variables due to R. Latała we provide a concentration inequality for not necessarily Lipschitz functions $$f:\mathbb {R}^n \rightarrow \mathbb {R}$$ f : R n → R with bounded derivatives of higher orders, which holds when the underlying measure satisfies a family of Sobolev type inequalities $$\begin{aligned} \Vert g- \mathbb Eg\Vert _p \le C(p)\Vert \nabla g\Vert _p. \end{aligned}$$ ‖ g - E g ‖ p ≤ C ( p ) ‖ ∇ g ‖ p . Such Sobolev type inequalities hold, e.g., if the underlying measure satisfies the log-Sobolev inequality (in which case $$C(p) \le C\sqrt{p}$$ C ( p ) ≤ C p ) or the Poincaré inequality (then $$C(p) \le Cp$$ C ( p ) ≤ C p ). Our concentration estimates are expressed in terms of tensor-product norms of the derivatives of $$f$$ f . When the underlying measure is Gaussian and $$f$$ f is a polynomial (not necessarily tetrahedral or homogeneous), our estimates can be reversed (up to a constant depending only on the degree of the polynomial). We also show that for polynomial functions, analogous estimates hold for arbitrary random vectors with independent sub-Gaussian coordinates. We apply our inequalities to general additive functionals of random vectors (in particular linear eigenvalue statistics of random matrices) and the problem of counting cycles of fixed length in Erdős–Rényi random graphs, obtaining new estimates, optimal in a certain range of parameters.

Highlights

  • Concentration of measure inequalities are one of the basic tools in modern probability theory

  • The most basic case is the probabilistic analysis of polynomials in independent random variables, which arise naturally, e.g., in the study of multiple stochastic integrals, in discrete harmonic analysis as elements of the Fourier expansions on the discrete cube or in numerous problems of random graph theory, to mention just the famous subgraph counting problem [22,23,26,27,35,36,49]

  • In view of Theorem 3.3 a natural question arises: for what measures is the inequality (11) satisfied? Before we provide examples, for technical reasons let us recall the definition of the length of the gradient of a locally Lipschitz function

Read more

Summary

Introduction

Concentration of measure inequalities are one of the basic tools in modern probability theory (see the monograph [46]). Let us proceed to the presentation of our results To do this we will first formulate a two-sided tail and moment inequality for homogeneous tetrahedral polynomials in i.i.d. standard Gaussian variables due to Latała [44]. Our inequalities cannot be in general compared e.g. to the estimates by Kim and Vu [37,38] For this reason and since it would require introducing new notation, we will not discuss their estimates and just indicate, when presenting applications of Theorem 1.4, several situations when our inequalities perform in a better or worse way than those by Kim and Vu. Let us only mention that the Kim-Vu inequalities as ours are expressed in terms of higher order derivatives of the polynomials. In the Appendix we collect some additional facts used in the proofs

Notation
A concentration inequality for non-Lipschitz functions
Polynomials
Additive functionals and related statistics
C L2n3 f
Linear statistics of eigenvalues of random matrices
Two-sided estimates of moments for Gaussian polynomials
Polynomials in independent sub-Gaussian random variables
Application: subgraph counting in random graphs
Counting triangles
Counting cycles
Decoupling inequalities
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.