Related papers: Normal approximation for coverage models over bino…
New bounds for the $k$-th order derivatives of the solutions of the normal and multivariate normal Stein equations are obtained. Our general order bounds involve fewer derivatives of the test function than those in the existing literature.…
We derive optimal estimates for the Bergman kernel and the Bergman metric for certain model domains in $\mathbb{C}^2$ near boundary points that are of infinite type. Being unbounded models, these domains obey certain geometric constraints…
We use Stein's method to prove a generalization of the Lindeberg-Feller CLT providing an upper and a lower bound for the superior limit of the Kolmogorov distance between a normally distributed random variable and the rowwise sums of a…
We develop techniques for determining an explicit Berry-Esseen bound in the Kolmogorov distance for the normal approximation of a ratio of Gaussian functionals. We provide an upper bound in terms of the third and fourth cumulants, using…
In this paper, we propose and analyze a trust-region model-based algorithm for solving unconstrained stochastic optimization problems. Our framework utilizes random models of an objective function $f(x)$, obtained from stochastic…
Kernel based methods provide a way to reconstruct potentially high-dimensional functions from meshfree samples, i.e., sampling points and corresponding target values. A crucial ingredient for this to be successful is the distribution of the…
The family of Mat\'ern kernels are often used in spatial statistics, function approximation and Gaussian process methods in machine learning. One reason for their popularity is the presence of a smoothness parameter that controls, for…
We study rates of convergence in central limit theorems for the partial sum of squares of general Gaussian sequences, using tools from analysis on Wiener space. No assumption of stationarity, asymptotically or otherwise, is made. The main…
Let $M$ be a random matrix in the orthogonal group $\O_n$, distributed according to Haar measure, and let $A$ be a fixed $n\times n$ matrix over $\R$ such that $\tr(AA^t)=n$. Then the total variation distance of the random variable…
We analyze the Nystr\"om approximation of a positive definite kernel associated with a probability measure. We first prove an improved error bound for the conventional Nystr\"om approximation with i.i.d. sampling and singular-value…
We study two dimensional conformal field theories in the semiclassical limit. In this limit, the four-point function is dominated by intermediate primaries of particular weights along with their descendants, and the crossing equations…
We consider inhomogeneous branching diffusions on an infinite domain of $\mathbb{R}^d$. The first aim of this article is to derive a general criterium under which the size process (number of particles) and the genealogy of the particle…
We consider mean-field models for data--clustering problems starting from a generalization of the bounded confidence model for opinion dynamics. The microscopic model includes information on the position as well as on additional features of…
We investigate the multivariate central limit theorem for nonlinear statistics by means of Stein's method and Slepian's smart path interpolation method. Based on certain difference operators in theory of concentration inequalities, we…
Germs of tubular neighborhood embeddings for submanifolds N of manifolds M are in one-one correspondence with germs of Euler-like vector fields near N. In many contexts, this reduces the proof of `normal forms results' for geometric…
This paper considers a distributionally robust chance constraint model with a general ambiguity set. We show that a sample based approximation of this model converges under suitable sufficient conditions. We also show that upper and lower…
Generalizing the well-known lilypond model we introduce a growth-maximal hard-core model based on a space-time point process of convex particles. Using a purely deterministic algorithm we prove under fairly general assumptions that the…
Applying Stein's method, an inductive technique and size bias coupling yields a Berry-Esseen theorem for normal approximation without the usual restriction that the coupling be bounded. The theorem is applied to counting the number of…
Stein's method is used to obtain two theorems on multivariate normal approximation. Our main theorem, Theorem 1.2, provides a bound on the distance to normality for any nonnegative random vector. Theorem 1.2 requires multivariate size bias…
Finite volume methods for problems involving second order operators with full diffusion matrix can be used thanks to the definition of a discrete gradient for piecewise constant functions on unstructured meshes satisfying an orthogonality…