Related papers: $\mathcal{L}_{q}$-maximal inequality for high dime…

For a sequence $\{X_{n}, \, n \geqslant 1 \}$ of random variables satisfying $\mathbb{E} \lvert X_{n} \rvert < \infty$ for all $n \geqslant 1$, a maximal inequality is established, and used to obtain strong law of large numbers for…

A {\em maximal inequality} seeks to estimate $\mathbb{E}\max_i X_i$ in terms of properties of the $X_i$. When the latter are independent, the union bound (in its various guises) can yield tight upper bounds. If, however, the $X_i$ are…

We establish a generic symmetrization property for dependent random variables $\{x_{t}\}_{t=1}^{n}$ on $\mathbb{R}^{p}$, where $p$ $>>$ $n$ is allowed. We link $\mathbb{E}\psi (\max_{1\leq i\leq p}|1/n\sum_{t=1}^{n}(x_{i,t}$ $-$…

Let $(\xi_i)_{i=1,...,n}$ be a sequence of independent and symmetric random variables. We consider the upper bounds on tail probabilities of self-normalized deviations $$ \mathbf{P} \Big( \max_{1\leq k \leq n} \sum_{i=1}^{k} |\xi_i|\big/…

In this paper, we considier the limiting distribution of the maximum interpoint Euclidean distance $M_n=\max _{1 \leq i<j \leq n}\left\|\boldsymbol{X}_i-\boldsymbol{X}_j\right\|$, where $\boldsymbol{X}_1, \boldsymbol{X}_2, \ldots,…

Linear independence testing is a fundamental information-theoretic and statistical problem that can be posed as follows: given $n$ points $\{(X_i,Y_i)\}^n_{i=1}$ from a $p+q$ dimensional multivariate distribution where $X_i \in…

We give exponential upper bounds for $P(S \le k)$, in particular $P(S=0)$, where $S$ is a sum of indicator random variables that are positively associated. These bounds allow, in particular, a comparison with the independent case. We give…

We show that for every mean zero log-concave real random variable $X$ one has $\|X\|_p \leq \frac{p}{q} \|X\|_q$ for $p \geq q \geq 1$, going beyond the well-known case of symmetric random variables. We also prove that in the class of…

We consider the problem of estimating the $L_1$ distance between two discrete probability measures $P$ and $Q$ from empirical data in a nonasymptotic and large alphabet setting. When $Q$ is known and one obtains $n$ samples from $P$, we…

In this paper, the maximum L$q$-likelihood estimator (ML$q$E), a new parameter estimator based on nonextensive entropy [Kibernetika 3 (1967) 30--35] is introduced. The properties of the ML$q$E are studied via asymptotic analysis and…

Based on a maximal inequality type result of Cuculescu, we establish some noncommutative maximal inequalities such as Haj\'ek--Penyi inequality and Etemadi inequality. In addition, we present a noncommutative Kolmogorov type inequality by…

A common statistical situation concerns inferring an unknown distribution Q(x) from a known distribution P(y), where X (dimension n), and Y (dimension m) have a known functional relationship. Most commonly, n<m, and the task is relatively…

In this paper, we study the behavior of the bounds of matrix-valued maximal inequality in $\mathbb{R}^n$ for large $n$. The main result of this paper is that the $L_p$-bounds ($p>1$) can be taken to be independent of $n$, which is a…

Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n=\epsilon_{1}+...+\epsilon_{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that…

Let $X$ be a random variable and define its concentration function by $$\mathcal{Q}_{h}(X)=\sup_{x\in \mathbb{R}}\mathbb{P}(X\in (x,x+h]).$$ For a sum $S_n=X_1+\cdots+X_n$ of independent real-valued random variables the Kolmogorov-Rogozin…

Maximal inequalities refer to bounds on expected values of the supremum of averages of random variables over a collection. They play a crucial role in the study of non-parametric and high-dimensional estimators, and especially in the study…

Let $(X,\mathcal{B}, \mu, T)$ be an ergodic dynamical system on a non-atomic finite measure space. We assume without loss of generality that $\mu(X)=1.$ Consider the maximal function $\dis R^*:(f, g) \in L^p\times L^q \to R^*(f, g)(x) =…

We consider the problem of testing mutual independence among the components of a high-dimensional random vector. Building on the rank-based max-sum framework, we introduce fixed finite-$L_q$ power-sum statistics under three general classes…

In this article we derive the best possible upper bound for $E[\max{X_i}-\min_i{X_i}]$ under given means and variances on $n$ random variables $X_i$. The random vector $(X_1,...,X_n)$ is allowed to have any dependence structure, provided $E…

We establish tight inapproximability bounds for max-LINSAT, the problem of maximizing the number of satisfied linear constraints over the finite field $\mathbb{F}_q$, where each constraint accepts $r$ values. Specifically, we prove by a…