Related papers: Normal approximation for the net flux through a ra…
We develop a higher regularity theory for general quasilinear elliptic equations and systems in divergence form with random coefficients. The main result is a large-scale $L^\infty$-type estimate for the gradient of a solution. The estimate…
In this paper we provide explicit upper bounds on some distances between the (law of the) output of a random Gaussian NN and (the law of) a random Gaussian vector. Our results concern both shallow random Gaussian neural networks with…
We obtain some fine gradient estimates near the boundary for solutions to fractional elliptic problems subject to exterior Dirichlet boundary conditions. Our results provide, in particular, the sign of the normal derivative of such…
An explicit bound is given for the Kolmogorov distance between a mixture of normal distributions and a normal distribution with properly chosen parameter values. A random variable X has a mixture of normal distributions if its conditional…
We refine the classical Lindeberg-Feller central limit theorem by obtaining asymptotic bounds on the Kolmogorov distance, the Wasserstein distance, and the parametrized Prokhorov distances in terms of a Lindeberg index. We thus obtain more…
The statistics of random band--matrices with width and strength of the band slowly varying along the diagonal is considered. The Dyson equation for the averaged Green function close to the edge of spectrum is reduced to the Painlev\'{e} I…
In this article, we investigate the existence and uniqueness of random-field solutions to the elliptic SPDE $-\mathcal{L}u=\dot{\xi}$ on a bounded domain $D$ with Dirichlet boundary conditions $u=0$ on $\partial D$, driven by symmetric…
We combine Stein's method with Malliavin calculus in order to obtain explicit bounds in the multidimensional normal approximation (in the Wasserstein distance) of functionals of Gaussian fields. Our results generalize and refine the main…
The standard diffusion processes are known to be obtained as the limits of appropriate random walks. These prelimiting random walks can be quite different however. The diffusion coefficient can be made responsible for the size of jumps or…
The sliced-Wasserstein flow is an evolution equation where a probability density evolves in time, advected by a velocity field computed as the average among directions in the unit sphere of the optimal transport displacements from its 1D…
We prove a general normal approximation theorem for local graph statistics in the configuration model, together with an explicit bound on the error in the approximation with respect to the Wasserstein metric. Such statistics take the form…
We give a deterministic, nearly logarithmic-space algorithm that given an undirected graph $G$, a positive integer $r$, and a set $S$ of vertices, approximates the conductance of $S$ in the $r$-step random walk on $G$ to within a factor of…
We study the statistics of the relative separation between two fluid particles in a spatially smooth and temporally random flow. The Lagrangian strain is modelled by a telegraph noise, which is a stationary random Markov process that can…
We consider the ordinary differential equation (ODE) $dx_{t} =b(t,x_{t} ) dt+ dw_{t}$ where $w$ is a continuous driving function and $b$ is a time-dependent vector field which possibly is only a distribution in the space variable. We…
We use a new method via $p$-Wasserstein bounds to prove Cram\'er-type moderate deviations in (multivariate) normal approximations. In the classical setting that $W$ is a standardized sum of $n$ independent and identically distributed…
We consider $M/Ph/n+M$ queueing systems in steady state. We prove that the Wasserstein distance between the stationary distribution of the normalized system size process and that of a piecewise Ornstein-Uhlenbeck (OU) process is bounded by…
We prove a local limit theorem for nearest neighbours random walks in stationary random environment of conductances on Z without using any of both classic assumptions of uniform ellipticity and independence on the conductances. Besides the…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
In this paper we use a Malliavin-Stein type method to investigate Poisson and normal approximations for the measurable functions of infinitely many independent random variables. We combine Stein's method with the difference operators in…
We prove $L_p$ estimates of solutions to a conormal derivative problem for divergence form complex-valued higher-order elliptic systems on a half space and on a Reifenberg flat domain. The leading coefficients are assumed to be merely…