Related papers: Normal approximation for partial sums: general con…
We consider stochastic systems involving general -- non-Gaussian and asymmetric -- stable processes. The random quantities, either a stochastic force or a waiting time in a random walk process, explicitly depend on the position. A…
We study the notion of debiasability for cost functions arising in optimal transport. We call a symmetric cost function $c:\mathscr{X}\times\mathscr{X}\to\mathbb{R}\cup\{+\infty\}$ debiasable if it satisfies $c(x,y)\ge…
In the optimal partial transport problem, one is asked to transport a fraction $0<m \leq \min\{||f||_{L^1}, ||g||_{L^1}\}$ of the mass of $f=f \chi_\Omega$ onto $g=g\chi_\Lambda$ while minimizing a transportation cost. If $f$ and $g$ are…
For the perimeter length and the area of the convex hull of the first $n$ steps of a planar random walk, we study $n \to \infty$ mean and variance asymptotics and establish non-Gaussian distributional limits. Our results apply to random…
We investigate the asymptotic distribution of integrals of the $j$-function that are associated to ideal classes in a real quadratic field. To estimate the error term in our asymptotic formula, we prove a bound for sums of Kloosterman sums…
We study the free central limit theorem for not necessarily identically distributed free random variables where the limiting distribution is the semicircle distribution. Starting from an estimate for the Kolmogorov distance between the…
We study the convergence of the transport plans $\gamma_\epsilon$ towards $\gamma_0$ as well as the cost of the entropy-regularized optimal transport $(c,\gamma_\epsilon)$ towards $(c,\gamma_0)$ as the regularization parameter $\epsilon$…
We demonstrate and discuss nonasymptotic bounds in probability for the cost of a regression scheme with a general loss function from the perspective of the Rademacher theory, and for the optimality with respect to the average…
We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…
We prove several fundamental statistical bounds for entropic OT with the squared Euclidean cost between subgaussian probability measures in arbitrary dimension. First, through a new sample complexity result we establish the rate of…
We present a novel approach to estimating discrete distributions with (potentially) infinite support in the total variation metric. In a departure from the established paradigm, we make no structural assumptions whatsoever on the sampling…
Let $K_n$ be the convex hull of i.i.d. random variables distributed according to the standard normal distribution on $\R^d$. We establish variance asymptotics as $n \to \infty$ for the re-scaled intrinsic volumes and $k$-face functionals of…
We consider a type of nonnormal approximation of infinitely divisible distributions that incorporates compound Poisson, Gamma, and normal distributions. The approximation relies on achieving higher orders of cumulant matching, to obtain…
General Central limit theorem deals with weak limits (in type) of sums of row-elements of array random variables. In some situations as in the invariance principle problem, the sums may include only parts of the row-elements. For strictly…
Asymptotic distribution for the proportional covariance model under multivariate normal distributions is derived. To this end, the parametrization of the common covariance matrix by its Cholesky root is adopted. The derivations are made in…
This paper studies a variant of the minimum-cost flow problem in a graph with convex cost function where the demands at the vertices are functions depending on a one-dimensional parameter $\lambda$. We devise two algorithmic approaches for…
We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…
We deduce in this short report the non-asymptotic for exponential tail of distribution for sums of independent centered random variables.
A standard approach to computing expectations with respect to a given target measure is to introduce an overdamped Langevin equation which is reversible with respect to the target distribution, and to approximate the expectation by a…
We revisit the problem of condensation for independent, identically distributed random variables with a power-law tail, conditioned by the value of their sum. For large values of the sum, and for a large number of summands, a condensation…