English
Related papers

Related papers: Upper bounds for the maximum deviation of the Pear…

200 papers

We study a Markov process with two components: the first component evolves according to one of finitely many underlying Markovian dynamics, with a choice of dynamics that changes at the jump times of the second component. The second…

Probability · Mathematics 2015-04-14 Bertrand Cloez , Martin Hairer

How much dependence is there in the prime factorization of a random integer distributed uniformly from 1 to n? How much dependence is there in the decomposition into cycles of a random permutation of n points? What is the relation between…

Number Theory · Mathematics 2013-05-07 Richard Arratia

We study the limiting extremal and cluster point processes of branching Brownian motion. The former records the heights of all extreme values of the process, while the latter records the relative heights of extreme values in a genealogical…

Probability · Mathematics 2024-05-29 Lisa Hartung , Oren Louidor , Tianqi Wu

Time-irreversible stochastic processes are frequently used in natural sciences to explain non-equilibrium phenomena and to design efficient stochastic algorithms. Our main goal in this thesis is to analyse their dynamics by means of large…

Probability · Mathematics 2021-09-21 Mikola C. Schlottke

The goal of this article is to study how much the eigenvalues of large Hermitian random matrices deviate from certain deterministic locations -- or in other words, to investigate optimal rigidity estimates for the eigenvalues. We do this in…

Probability · Mathematics 2019-06-05 Tom Claeys , Benjamin Fahs , Gaultier Lambert , Christian Webb

This paper starts by considering the minimization of the Renyi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points $\bigl( D(Q\|P_1),…

Information Theory · Computer Science 2015-10-27 Igal Sason

In this work, we study the generalization capability of algorithms from an information-theoretic perspective. It has been shown that the expected generalization error of an algorithm is bounded from above by a function of the relative…

Information Theory · Computer Science 2021-10-27 Borja Rodríguez-Gálvez , Germán Bassi , Mikael Skoglund

We establish a large deviation principle for the empirical measure process associated with a general class of finite-state mean field interacting particle systems with Lipschitz continuous transition rates that satisfy a certain ergodicity…

Probability · Mathematics 2016-01-26 Paul Dupuis , Kavita Ramanan , Wei Wu

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

Probability · Mathematics 2012-11-01 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

The singular values of a product of $M$ independent Ginibre matrices of size $N\times N$ form a determinantal point process. Near the soft edge, as both $M$ and $N$ go to infinity in such a way that $M/N\to \alpha$, $\alpha>0$, a scaling…

Probability · Mathematics 2021-12-21 Sergey Berezin , Eugene Strahov

Let M_n denote the number of sites in the largest cluster in critical site percolation on the triangular lattice inside a box side length n. We give lower and upper bounds on the probability that M_n / E(M_n) > x of the form exp(- C…

Probability · Mathematics 2014-04-09 Demeter Kiss

There are many ways of establishing upper bounds on fluctuations of random variables, but there is no systematic approach for lower bounds. As a result, lower bounds are unknown in many important problems. This paper introduces a general…

Probability · Mathematics 2018-07-30 Sourav Chatterjee

We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a…

Probability · Mathematics 2013-03-21 Erol A. Peköz , Adrian Röllin , Nathan Ross

We study the maximum of the random assignment process on rectangular matrices. We derive first-order asymptotics for the expected maximum, prove a law of large numbers under mild tail assumptions, and obtain exponential upper bounds for the…

Probability · Mathematics 2025-09-23 Timofey Moskalenko

In this paper, with motivation from [30] by Piterbarg (Extremes 7:161--177, 2004) and the considerable interest in stationary chi-processes, we derive asymptotic joint distributions of maxima of stationary strongly dependent chi-processes…

Probability · Mathematics 2015-04-14 Chengxiu Ling , Zhongquan Tan

We prove fluctuation bounds for the particle current in totally asymmetric zero range processes in one dimension with nondecreasing, concave jump rates whose slope decays exponentially. Fluctuations in the characteristic directions have…

Probability · Mathematics 2012-01-25 M. Balázs , J. Komjáthy , T. Seppäläinen

We consider the long-time behavior of a diffusion process on $\mathbb{R}^d$ advected by a stationary random vector field which is assumed to be divergence-free, dihedrally symmetric in law and have a log-correlated potential. A special case…

Probability · Mathematics 2024-09-19 Scott Armstrong , Ahmed Bou-Rabee , Tuomo Kuusi

Murthy and Sethi (Sankhya Ser B \textbf{27}, 201--210 (1965)) gave a sharp upper bound on the variance of a real random variable in terms of the range of values of that variable. We generalise this bound to the complex case and, more…

Functional Analysis · Mathematics 2011-04-28 Koenraad M. R. Audenaert

The likelihood function of a finite mixture model is a non-convex function with multiple local maxima and commonly used iterative algorithms such as EM will converge to different solutions depending on initial conditions. In this paper we…

Machine Learning · Computer Science 2016-08-19 Elad Mezuman , Yair Weiss

By a result of Heinrich, Novak, Wasilkowski and Wo\'zniakowski the inverse of the star discrepancy $n(d,\varepsilon)$ satisfies $n(d,\varepsilon)\leq c_{\abs}d\varepsilon^{-2}$. Equivalently for any $N$ and $d$ there exists a set of $N$…

Probability · Mathematics 2014-08-12 Thomas Löbbe