English
Related papers

Related papers: Uniform Hanson-Wright type concentration inequalit…

200 papers

We prove the following type of discrete entropy monotonicity for sums of isotropic, log-concave, independent and identically distributed random vectors $X_1,\dots,X_{n+1}$ on $\mathbb{Z}^d$: $$ H(X_1+\cdots+X_{n+1}) \geq H(X_1+\cdots+X_{n})…

Probability · Mathematics 2025-12-18 Matthieu Fradelizi , Lampros Gavalakis , Martin Rapaport

We study the self-normalized concentration of vector-valued stochastic processes. We focus on bounds for "sub-$\psi$" processes, a well-known and quite general class of process that encompasses a wide variety of well-known tail conditions…

Probability · Mathematics 2026-02-06 Ben Chugg , Aaditya Ramdas

This paper develops inferential methods for a very general class of ill-posed models in econometrics encompassing the nonparametric instrumental variable regression, various functional regressions, and the density deconvolution. We focus on…

Statistics Theory · Mathematics 2020-12-22 Andrii Babii

We prove area inequalities for stable marginally outer trapped surfaces in Einstein-Maxwell-dilaton theory. Our inspiration comes on the one hand from a corresponding upper bound for the area in terms of the charges obtained recently by…

General Relativity and Quantum Cosmology · Physics 2015-09-01 David Fajman , Walter Simon

In this paper, we investigate the asymptotic stability of finite-dimensional stochastic integrable Hamiltonian systems via information entropy. Specifically, we establish the asymptotic vanishing of Shannon entropy difference (with…

Dynamical Systems · Mathematics 2025-10-28 Chen Wang , Yong Li

Following Talagrand's concentration results for permutations picked uniformly at random from a symmetric group [Tal95], Luczak and McDiarmid have generalized it to more general groups G of permutations which act suitably 'locally'. Here we…

Probability · Mathematics 2017-06-28 Paul-Marie Samson

We use the generic chaining device proposed by Talagrand to establish exponential bounds on the deviation probability of some suprema of random processes. Then, given a random vector $\xi$ in $\R^{n}$ the components of which are independent…

Statistics Theory · Mathematics 2009-04-22 Yannick Baraud

The concentration of measure phenomenon may be summarized as follows: a function of many weakly dependent random variables that is not too sensitive to any of its individual arguments will tend to take values very close to its expectation.…

Probability · Mathematics 2016-11-18 Aryeh Kontorovich , Maxim Raginsky

The first part of this work considers the entropy of the sum of (possibly dependent and non-identically distributed) Bernoulli random variables. Upper bounds on the error that follows from an approximation of this entropy by the entropy of…

Information Theory · Computer Science 2013-04-30 Igal Sason

This work obtains sharp closed-form exponential concentration inequalities of Bernstein type for the ubiquitous beta distribution, improving upon sub-gaussian and sub-gamma bounds previously studied in this context. The proof leverages a…

Probability · Mathematics 2024-10-21 Maciej Skorski

In this paper, we investigate the Hausdorff dimension of naturally occurring sets of inhomogeneous well-approximable points with a sequence of real invertible matrices $\mathcal{A}=(A_n)_{n\in\mathbb{N}}$. Specifically, for a given point…

Number Theory · Mathematics 2025-12-17 Zhang-nan Hu , Junjie Huang , Bing Li , Jun Wu

Analyzing concentration of large random matrices is a common task in a wide variety of fields. Given independent random variables, many tools are available to analyze random matrices whose entries are linear in the variables, e.g. the…

Computational Complexity · Computer Science 2023-01-19 Goutham Rajendran , Madhur Tulsiani

We give a concentration inequality based on the premise that random variables take values within a particular region. The concentration inequality guarantees that, for any sequence of correlated random variables, the difference between the…

Probability · Mathematics 2020-02-21 Go Kato

We consider the conformal decomposition of Einstein's constraint equations introduced by Lichnerowicz and York, on a compact manifold with boundary. We use order relations on appropriate Banach spaces to derive weak solution generalizations…

General Relativity and Quantum Cosmology · Physics 2007-08-28 M. Holst , J. Kommemi , G. Nagy

A unified presentation of the perturbation and variational methods for the generalized statistical mechanics based on Tsallis entropy is given here. In the case of the variational method, the Bogoliubov inequality is generalized in a very…

Statistical Mechanics · Physics 2009-10-31 E. K. Lenzi , L. C. Malacarne , R. S. Mendes

The purpose of this dissertation is to introduce a version of Stein's method of exchangeable pairs to solve problems in measure concentration. We specifically target systems of dependent random variables, since that is where the power of…

Probability · Mathematics 2016-03-09 Sourav Chatterjee

Existing error-bound-based analyses for stochastic algorithms that exhibit certain descent properties, such as randomized coordinate descent and randomized projection methods, are often limited in scope and typically lead to overly…

Optimization and Control · Mathematics 2026-03-19 Zhichun Yang , Li Jiang , Tianxiang Liu , Man-Chung Yue

We consider the variant of stochastic homogenization theory introduced in [X. Blanc, C. Le Bris and P.-L. Lions, C. R. Acad. Sci. Serie I 2006 and Journal de Mathematiques Pures et Appliquees 2007]. The equation under consideration is a…

Analysis of PDEs · Mathematics 2019-02-20 Frederic Legoll , Florian Thomines

We provide convergence guarantees in Wasserstein distance for a variety of variance-reduction methods: SAGA Langevin diffusion, SVRG Langevin diffusion and control-variate underdamped Langevin diffusion. We analyze these methods under a…

Machine Learning · Statistics 2018-02-16 Niladri S. Chatterji , Nicolas Flammarion , Yi-An Ma , Peter L. Bartlett , Michael I. Jordan

The phenomenon of entropy concentration provides strong support for the maximum entropy method, MaxEnt, for inferring a probability vector from information in the form of constraints. Here we extend this phenomenon, in a discrete setting,…

Information Theory · Computer Science 2021-01-11 Kostas N. Oikonomou
‹ Prev 1 4 5 6 7 8 10 Next ›