Related papers: Approaching the coupon collector's problem with gr…
In this article, we discuss the basic ideas of a general procedure to adapt the Stein-Chen method to bound the distance between conditional distributions. From an integration-by-parts formula (IBPF), we derive a Stein operator whose…
We study fluctuations of mean-field interacting particle systems around their McKean--Vlasov limit. Our main result provides a uniform-in-time quantitative central limit theorem for the fluctuation process, with convergence rate of order…
Given a set of coins arranged in a line, we remove heads-up coins one at a time and flip any adjacent coins after each removal. The coin-removal problem is to determine for which arrangements of coins it is possible to remove all of the…
We present, in a unified way, a Stein methodology for infinitely divisible laws (without Gaussian component) having finite first moment. Based on a correlation representation, we obtain a characterizing non-local Stein operator which boils…
We generalize the well-known zero bias distribution and the $\lambda$-Stein pair to an approximate zero bias distribution and an approximate $\lambda,R$-Stein pair, respectively. Berry Esseen type bounds to the normal, based on approximate…
There is a widespread recent interest in using ideas from statistical physics to model certain types of problems in economics and finance. The main idea is to derive the macroscopic behavior of the market from the random local interactions…
This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…
Using Chen-Stein method in combination with size-biased couplings, we obtain the multivariate Poisson approximation in terms of the Wasserstein distance. As applications, we study the multivariate Poisson approximation of the distribution…
We propose an aproach for asymptotic analysis of plane partition statistics related to counts of parts whose sizes exceed a certain suitably chosen level. In our study, we use the concept of conjugate trace of a plane partition of the…
We generalize the Poisson limit theorem to binary functions of random objects whose law is invariant under the action of an amenable group. Examples include stationary random fields, exchangeable sequences, and exchangeable graphs. A…
It is known that the fluctuations of suitable linear statistics of Haar distributed elements of the compact classical groups satisfy a central limit theorem. We show that if the corresponding test functions are sufficiently smooth, a rate…
In this paper, quantitative central limit theorems for $U$-statistics on the $q$-dimensional torus defined in the framework of the two-sample problem for Poisson processes are derived. In particular, the $U$-statistics are built over tight…
Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a…
Let W be either the number of descents or inversions of a permutation. Stein's method is applied to show that W satisfies a central limit theorem with error rate n^(-1/2). The construction of an exchangeable pair (W,W') used in Stein's…
Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…
Our main results are quantitative bounds in the multivariate normal approximation of centred subgraph counts in random graphs generated by a general graphon and independent vertex labels. We are interested in these statistics because they…
We prove a functional central limit theorem for subgraph counts in a dynamic version of the random connection model. To establish tightness, we develop a dynamic extension of the cumulant method.
We consider the so-called coupon-coloring of the vertices of a graph where every color appears in every open neighborhood, and our aim is to determine the maximal number of colors in such colorings. In other words, every color class must be…
We revisit from a modern bootstrap perspective the longstanding problem of solving QCD in the large $N$ limit. We derive universal bounds on the effective field theory of massless pions by imposing the full set of positivity constraints…
We overview results on the topic of Poisson approximation that are missed in existing surveys. The topic of Poisson approximation to the distribution of a sum of integer-valued random variables is presented as well. We do not restrict…