Related papers: L_p moments of random vectors via majorizing measu…
We prove some sufficient conditions implying $l^p$ inequalities of the form $||x||_p \leq ||y||_p$ for vectors $ x, y \in [0,\infty)^n$ and for $p$ in certain positive real intervals. Our sufficient conditions are strictly weaker than the…
We investigate the complete $p$-th moment convergence for weighted sums of independent, identically distributed random variables under sublinear expectations space. Using moment inequality and truncation methods, we prove the equivalent…
Let $n_j$ be a lacunary sequence of integers, such that $n_{j+1}/n_j\geq r$. We are interested in linear combinations of the sequence of finite Riesz products $\prod_{j=1}^N(1+\cos(n_j t))$. We prove that, whenever the Riesz products are…
We establish $L^p$-type universal approximation theorems for general and non-anticipative functionals on suitable rough path spaces, showing that linear functionals acting on signatures of time-extended rough paths are dense with respect to…
Several important families of computational and statistical results in machine learning and randomized algorithms rely on uniform bounds on quadratic forms of random vectors or matrices. Such results include the Johnson-Lindenstrauss (J-L)…
Given n (discrete or continuous) random variables X_i, the (2^n-1)-dimensional vector obtained by evaluating the joint entropy of all non-empty subsets of {X_1,...,X_n} is called an entropic vector. Determining the region of entropic…
We study a class of positive random variables having moments of Gamma type, whose density can be expressed by the three-parametric Mittag-Leffler functions. We give some necessary conditions and some sufficient conditions for their…
We identify shortcomings in two popular measures of localization of functions: the $L^p-L^q$ participation ratio and the mass concentration comparison. We then introduce a novel localization measure for functions on bounded subsets of…
We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…
In this paper we study $L_p$-norm spherical copulas for arbitrary $p \in [1,\infty]$ and arbitrary dimensions. The study is motivated by a conjecture that these distributions lead to a sharp bound for the value of a certain generalized mean…
We prove an asymptotic expansion of the second moment of the central values of the $\mathrm{GL}(n)\times\mathrm{GL}(n)$ Rankin--Selberg $L$-functions $L(1/2,\pi\otimes\pi_0)$, for a fixed cuspidal automorphic representation $\pi_0$, over…
Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…
In recent years, bootstrap methods have drawn attention for their ability to approximate the laws of "max statistics" in high-dimensional problems. A leading example of such a statistic is the coordinate-wise maximum of a sample average of…
We consider the binomial random set model $[n]_p$ where each element in $\{1,\dots,n\}$ is chosen independently with probability $p:=p(n)$. We show that for essentially all regimes of $p$ and very general conditions for a matrix $A$ and a…
We consider positive, integral-preserving linear operators acting on $L^1$ space, known as stochastic operators or Markov operators. We show that, on finite-dimensional spaces, any stochastic operator can be approximated by a sequence of…
We study the large deviation behaviour of the trajectories of empirical distributions of independent copies of time-homogeneous Feller processes on locally compact metric spaces. Under the condition that we can find a suitable core for the…
We propose a "decomposition method" to prove non-asymptotic bound for the convergence of empirical measures in various dual norms. The main point is to show that if one measures convergence in duality with sufficiently regular observables,…
One of the crucial tasks in many inference problems is the extraction of sparse information out of a given number of high-dimensional measurements. In machine learning, this is frequently achieved using, as a penality term, the $L_p$ norm…
In this paper, we discuss tests for mean vector of high-dimensional data when the dimension $p$ is a function of sample size $n$. One of the tests, called the decomposite $T^{2}$-test, in the high-dimensional testing problem is constructed…
The entropy of an ergodic finite-alphabet process can be computed from a single typical sample path x_1^n using the entropy of the k-block empirical probability and letting k grow with $n$ roughly like log n. We further assume that the…