Related papers: A sharp correlation inequality with an application…

We prove invariance theorems for general inequalities of different metrics and apply them to limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities with the polyharmonic operator for…

A novel approach is proposed to establish a sharp upper bound on the expected supremum of a separable martingale random field, serving as an alternative to classical universal chaining-based methods. The proposed approach begins by deriving…

We establish a lower bound on the entropy of weighted sums of (possibly dependent) random variables $(X_1, X_2, \dots, X_n)$ possessing a symmetric joint distribution. Our lower bound is in terms of the joint entropy of $(X_1, X_2, \dots,…

In this article, we investigate the quantitative form of the classical Hardy inequality. In our first result, we prove the following quantitative bound under the assumption that the $\mathbb{M}^N$ is a Riemannian model satisfying the…

In this paper, based on the initiation of the notion of negatively associated random variables under nonlinear probability, a strong limit theorem for weighted sums of random variables within the same frame is achieved without assumptions…

We consider integrals on unitary groups $U_d$ of the form $$\int_{U_d}U_{i_1j_1}... U_{i_qj_q}U^*_{j'_{1}i'_{1}} ... U^*_{j'_{q'}i'_{q'}}dU$$ We give an explicit formula in terms of characters of symmetric groups and Schur functions, which…

Let $ V_{n} = X_{1,n} + X_{2,n} + \cdots + X_{n,n}$ where $X_{i,n}$ are Bernoulli random variables which take the value $1$ with probability $b(i;n)$. Let $\lambda_{n} = \sum\limits_{i=1}^{n} b(i;n) $, $\lambda = \lim\limits_{n \to \infty}…

We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…

We derive soft theorems for theories in which time symmetries -- symmetries that involve the transformation of time, an example of which are Lorentz boosts -- are spontaneously broken. The soft theorems involve unequal-time correlation…

A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of independently generated candidates, falling within a given set.…

In this paper, we establish an almost sure central limit theorem for a general random sequence under a strong approximation condition. Additionally, we derive the law of the iterated logarithm for the center of mass corresponding to a…

We revisit the classical broken sample problem: Two samples of i.i.d. data points $\mathbf{X}=\{X_1,\cdots, X_n\}$ and $\mathbf{Y}=\{Y_1,\cdots,Y_m\}$ are observed without correspondence with $m\leq n$. Under the null hypothesis,…

Under the assumption that the distribution of a nonnegative random variable $X$ admits a bounded coupling with its size biased version, we prove simple and strong concentration bounds. In particular the upper tail probability is shown to…

Suppose that the (normalised) partial sum of a stationary sequence converges to a standard normal random variable. Given sufficiently moments, when do we have a rate of convergence of $n^{-1/2}$ in the uniform metric, in other words, when…

The paper deals with studying a connection of the Littlewood--Offord problem with estimating the concentration functions of some symmetric infinitely divisible distributions. It is shown that the values at zero of the concentration…

We prove a general theorem showing that local good-$\lambda$ inequalities imply bounds in certain variable Orlicz spaces. We use this to prove results about variable Orlicz Hardy spaces in the unit disc.

This paper addresses the statistical problem of estimating the infinite-norm deviation from the empirical mean to the distribution mean for high-dimensional distributions on $\{0,1\}^d$, potentially with $d=\infty$. Unlike traditional…

An integer partition of $n$ is a decreasing sequence of positive integers that add up to $[n]$. Back in $1979$ Macdonald posed a question about the limit value of the probability that two partitions chosen uniformly at random, and…

A sharp-threshold theorem is proved for box-crossing probabilities on the square lattice. The models in question are the random-cluster model near the self-dual point $p_{\mathrm {sd}}(q)=\sqrt{q}/(1+\sqrt{q})$, the Ising model with…

We recently introduced a robust approach to the derivation of sharp asymptotic formula for correlation functions of statistical mechanics models in the high-temperature regime. We describe its application to the nonperturbative proof of…