In this paper, we study the Lévy-Milman concentration phenomenon of 1-Lipschitz maps from mm-spaces to $\mathbb{R}$-trees. Our main theorems assert that the concentration to $\mathbb{R}$-trees is equivalent to the concentration to the real line.
In this paper, we prove an exponential and Ganssian concentration inequality for 1-Lipschitz maps from mm-spaces to Hadamard manifolds. In particular, we give a complete answer to a question by M. Gromov.
We explore the question whether Lipschitz functions of random variables under various forms of negative correlation satisfy concentration bounds similar to McDiarmid's inequality for independent random variables. We prove such a concentration bound for random variables satisfying the condition of negative regression, correcting an earlier proof by Dubhashi and Ranjan.
Non-Gaussian concentration estimates are obtained for invariant probability measures of reversible Markov processes. We show that the functional inequalities approach combined with a suitable Lyapunov condition allows us to circumvent the classical Lipschitz assumption of the observables. Our method is general and covers diffusions as well as pure-jump Markov processes on unbounded spaces.
We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct application of a classical theorem due to Bobkov and Götze.
We show that for any metric probability space $(M,d,μ)$ with a subgaussian constant $σ^2(μ)$ and any set $A \subset M$ we have $σ^2(μ_A) \leq c \log\left(e/μ(A)\right)\,σ^2(μ)$, where $μ_A$ is a restriction of $μ$ to the set $A$ and $c$ is a universal constant. As a consequence we deduce concentration inequalities for non-Lipschitz functions.
Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a concentration inequality generalizing the classical Gaussian concentration inequality for sums of independent Bernoullis: P (S_n - E S_n > a) < exp (-2 a^2 / n). The class of strong Rayleigh measures includes determinantal measures, weighted uniform matroids and exclusion measures; some familiar examples from these classes are generalized negative binomials and …
It is well-known that measures whose density is the form $e^{-V}$ where $V$ is a uniformly convex potential on $\RR^n$ attain strong concentration properties. In search of a notion of log-concavity on the discrete hypercube, we consider measures on $\{-1,1\}^n$ whose multi-linear extension $f$ satisfies $\log \nabla^2 f(x) \preceq β\Id$, for $β\geq 0$, which we refer to as $β$-semi-log-concave. We prove that these measures satisfy a nontrivial concentration bound, namely, any Hamming Lipchitz test function $φ$ satisfies $\Var_ν[φ] \leq n^{2-C_β}$ for $C_β>0$. As a corollary, we prove a concent…
The classical Gaussian concentration inequality for Lipschitz functions is adapted to a setting where the classical assumptions (i.e. Lipschitz and Gaussian) are not met. The theory is more direct than much of the existing theory designed to handle related generalizations. An application is presented to linear combinations of heavy tailed random variables.
We consider the problem of recovering a real-valued $n$-dimensional signal from $m$ phaseless, linear measurements and analyze the amplitude-based non-smooth least squares objective. We establish local convergence of subgradient descent with optimal sample complexity based on the uniform concentration of a random, discontinuous matrix-valued operator arising from the objective's gradient dynamics. While common techniques to establish uniform concentration of random functions exploit Lipschitz continuity, we prove that the discontinuous matrix-valued operator satisfies a uniform matrix concentr…
In this note, we obtain a Gaussian concentration inequality for a class of non-Lipschitz functions. In the one-dimensional case, our results supplement those established by Paouris and Valettas in [8].
Building on the inequalities for homogeneous tetrahedral polynomials in independent Gaussian variables due to R. Latała we provide a concentration inequality for non-necessarily Lipschitz functions $f\colon \R^n \to \R$ with bounded derivatives of higher orders, which hold when the underlying measure satisfies a family of Sobolev type inequalities $\|g- \E g\|_p \le C(p)\|\nabla 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}$) or the Poincaré inequality (then $C(p) \le Cp$). Our concentration …
We consider the Markov chain $\{X_n^x\}_{n=0}^\infty$ on $\R^d$ defined by the stochastic recursion $X_{n}^{x}=\p_{θ_{n}}(X_{n-1}^{x})$, starting at $x\in\R^d$, where $θ_{1}, θ_{2},...$ are i.i.d. random variables taking their values in a metric space $(Θ, \mathfrak{r}),$ and $\p_{θ_{n}}:\R^d\mapsto\R^d$ are Lipschitz maps. Assume that the Markov chain has a unique stationary measure $ν$. Under appropriate assumptions on $\p_{θ_n}$, we will show that the measure $ν$ has a heavy tail with the exponent $α>0$ i.e. $ν(\{x\in\R^d: |x|>t\})\asymp t^{-α}$. Using this result we show that properly norm…
Let $M$ be a compact 1-manifold. Given a continuous function $g:M\to \mathbb R_+$ we consider the following ordinary differential equation: $\|\dot{f}(t)\|=g(t)$, where $f:M\to \mathbb R^2$. We construct a probability measure on the space of almost everywhere differentiable solutions of this differential equation and study this measure. A solution of this equation can be viewed as an isometric immersion of a compact 1-manifold into $\mathbb R^2$. Nash's convergence technique in the proof of isometric $C^1$-immersion theorem plays an important role in the construction.
Exhibiting a new type of measure concentration, we prove uniform concentration bounds for measurable Lipschitz functions on product spaces, where Lipschitz is taken with respect to the metric induced by a weighted covering of the index set of the product. Our proof combines the Herbst argument with an analogue of Shearer's lemma for differential entropy. We give a quantitative "geometric" classification of diffuse submeasures into elliptic, parabolic, and hyperbolic. We prove that any non-elliptic submeasure (for example, any measure, or any pathological submeasure) has a property that we call…
This paper studies concentration inequalities for functions of locally dependent random variables. We show that the usual definition of local dependence does not imply concentration for general Hamming Lipschitz functions. We define hypergraph dependence, which is a special case of local dependence, and show that it implies concentration if the maximal neighborhood size is small. We prove concentration in Hamming distance, Talagrand distance, and for self-bounding functions of a particular type under this dependence structure.
We estimate a median of $f(X_t)$ where $f$ is a Lipschitz function, $X$ is a Lévy process and $t$ an arbitrary time. This leads to concentration inequalities for $f(X_t)$. In turn, corresponding fluctuation estimates are obtained under assumptions typically satisfied if the process has a regular behavior in small time and a, possibly different, regular behavior in large time.
The purpose of these notes is to further complete our understanding of the stable concentration phenomenon, by obtaining the finite range behavior of $P(F-E[F]\geq x)$, with $F=f(X)$ where $f$ is a Lipschitz function and $X$ is a stable random vector or with $F$ a stochastic functional on the Poisson space equipped with a stable Lévy measure.
Université Paris Cité and Sorbonne Université, CNRS, Laboratoire Jacques Louis Lions & Laboratoire de Probabilités Statistique et Modélisation(巴黎西岱大学与索邦大学,法国国家科学研究中心,雅克-路易·利翁斯实验室与概率统计与建模实验室);Institut Universitaire de France (IUF)(法国高等研究院);Department of Mathematics, Massachusetts Institute of Technology(麻省理工学院数学系);Division of Applied Mathematics, Brown University(布朗大学应用数学部)
An inequality of K. Marton shows that the joint distribution of a Markov chain with uniformly contracting transition kernels exhibits concentration. We prove an analogous inequality for broadcast models on finite trees. We use this inequality to develop a condition for the sequence of depth-$k$ marginals of a broadcast model on a rooted infinite tree to form a normal Lévy family in terms of the Lipschitz constants of the transition kernels and the growth rate of the tree.