English
Related papers

Related papers: Infinite Divisibility and Max-Infinite Divisibilit…

200 papers

Let $\mathbb{B}_p^N$ be the $N$-dimensional unit ball corresponding to the $\ell_p$-norm. For each $N\in\mathbb N$ we sample a uniform random subspace $E_N$ of fixed dimension $m\in\mathbb{N}$ and consider the volume of $\mathbb{B}_p^N$…

Probability · Mathematics 2024-12-23 Joscha Prochno , Christoph Thaele , Philipp Tuchel

In this note we correct an omission in our paper (Satheesh and Sandhya, 2005) in defining semi-selfdecomposable laws and also show with examples that the marginal distributions of a stationary AR(1) process need not even be infinitely…

Probability · Mathematics 2007-05-23 S Satheesh , E Sandhya

We study compressible types in the context of (local and global) NIP. By extending a result in machine learning theory (the existence of a bound on the recursive teaching dimension), we prove density of compressible types. Using this, we…

Logic · Mathematics 2026-04-02 Martin Bays , Itay Kaplan , Pierre Simon

For fixed $m > 1$, we study the product of $m$ independent $N \times N$ elliptic random matrices as $N$ tends to infinity. Our main result shows that the empirical spectral distribution of the product converges, with probability $1$, to the…

Probability · Mathematics 2015-06-26 Sean O'Rourke , David Renfrew , Alexander Soshnikov , Van Vu

We state some inequalities for m-divisible and infinite divisible characteristic functions. Basing on them we propose a statistical test for a distribution to be infinitely divisible. Keywords: infinite divisible distributions; statistical…

Probability · Mathematics 2019-04-17 Lev B. Klebanov , Ashot V. Kakosyan , Irina V. Volchenkova

We present a general approach, based on exponential inequalities, to derive bounds on the generalization error of randomized learning algorithms. Using this approach, we provide bounds on the average generalization error as well as bounds…

Machine Learning · Computer Science 2023-03-10 Fredrik Hellström , Giuseppe Durisi

Manifold regularization is a commonly used technique in semi-supervised learning. It enforces the classification rule to be smooth with respect to the data-manifold. Here, we derive sample complexity bounds based on pseudo-dimension for…

Machine Learning · Computer Science 2020-07-31 Alexander Mey , Tom Viering , Marco Loog

A Fr\'echet mean of a random variable $Y$ with values in a metric space $(\mathcal Q, d)$ is an element of the metric space that minimizes $q \mapsto \mathbb E[d(Y,q)^2]$. This minimizer may be non-unique. We study strong laws of large…

Probability · Mathematics 2025-08-04 Christof Schötz

We show the equivalence of three properties for an infinitely divisible distribution: the subexponentiality of the density, the subexponentiality of the density of its L\'evy measure and the tail equivalence between the density and its…

Probability · Mathematics 2023-02-16 Muneya Matsui

Many machine learning algorithms used for dimensional reduction and manifold learning leverage on the computation of the nearest neighbours to each point of a dataset to perform their tasks. These proximity relations define a so-called…

Statistical Mechanics · Physics 2020-07-22 Vittorio Erba , Sebastiano Ariosto , Marco Gherardi , Pietro Rotondo

We study two-faced families of random variables having bi-free infinitely divisible distributions. We prove a limit theorem of the sums of bi-free two-faced pairs of random variables within a triangular array. Then, by using the full Fock…

Operator Algebras · Mathematics 2016-02-16 Mingchu Gao

We derive a strong law of large numbers, a central limit theorem, a law of the iterated logarithm and a large deviation theorem for so-called deviation means of independent and identically distributed random variables (for the strong law of…

Probability · Mathematics 2023-11-21 Matyas Barczy , Zsolt Páles

In this paper we investigate the asymptotic distribution of likelihood ratio tests in models with several groups, when the number of groups converges with the dimension and sample size to infinity. We derive central limit theorems for the…

Statistics Theory · Mathematics 2019-07-17 Holger Dette , Nina Dörnemann

This paper studies new classes of infinitely divisible distributions on R^d. Firstly, the connecting classes with a continuous parameter between the Jurek class and the class of selfdecomposable distributions are revisited. Secondly, the…

Probability · Mathematics 2009-09-11 Makoto Maejima , Muneya Matsui , Mayo Suzuki

Given finite-dimensional random vectors $Y$, $X$, and $Z$ that form a Markov chain in that order (i.e., $Y \to X \to Z$), we derive upper bounds on the excess minimum risk using generalized information divergence measures. Here, $Y$ is a…

Information Theory · Computer Science 2025-06-02 Ananya Omanwar , Fady Alajaji , Tamás Linder

We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…

Probability · Mathematics 2016-11-17 Sem Borst , Milan Bradonjić

We derive novel concentration inequalities that bound the statistical error for a large class of stochastic optimization problems, focusing on the case of unbounded objective functions. Our derivations utilize the following key tools: 1) A…

Machine Learning · Statistics 2026-01-01 Jeremiah Birrell

Zipf's law describes the empirical size distribution of the components of many systems in natural and social sciences and humanities. We show, by solving a statistical model, that Zipf's law co-occurs with the maximization of the diversity…

Statistical Mechanics · Physics 2021-10-05 Onofrio Mazzarisi , Amanda de Azevedo-Lopes , Jeferson J. Arenzon , Federico Corberi

Let $\Omega$ be a countable infinite product $\Omega^\N$ of copies of the same probability space $\Omega_1$, and let ${\Xi_n}$ be the sequence of the coordinate projection functions from $\Omega$ to $\Omega_1$. Let $\Psi$ be a possibly…

Probability · Mathematics 2014-08-22 Alexander R. Pruss

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson