Related papers: Normal approximation of subgraph counts in the ran…

Subordinators are infinitely divisible distributions on the positive half-line. They are often used as mixing distributions in Poisson mixtures. We show that appropriately scaled Poisson mixtures can approximate the mixing subordinator and…

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…

Upper bounds for the probabilities $\mathbb{P}(F\geq \mathbb{E} F + r)$ and $\mathbb{P}(F\leq \mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process…

Feature selection procedures for spatial point processes parametric intensity estimation have been recently developed since more and more applications involve a large number of covariates. In this paper, we investigate the setting where the…

The survey is dedicated to a celebrated series of quantitave results, developed by the Lithuanian school of probability, on the normal approximation for a real-valued random variable. The key ingredient is a bound on cumulants of the type…

This article derives quantitative limit theorems for multivariate Poisson and Poisson process approximations. Employing the solution of Stein's equation for Poisson random variables, we obtain an explicit bound for the multivariate Poisson…

We consider discrete-time distributed averaging algorithms over multi-agent networks with measurement noises and time-varying random graph flows. Each agent updates its state by relative states between neighbours with both additive and…

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…

In this paper we present results on asymptotic characteristics of multivariate function classes in the uniform norm. Our main interest is the approximation of functions with mixed smoothness parameter not larger than $1/2$. Our focus will…

We obtain Stein approximation bounds for stochastic integrals with respect to a Poisson random measure over ${\Bbb R}^d$, $d\geq 2$. This approach relies on third cumulant Edgeworth-type expansions based on derivation operators defined by…

We propose a combinatorial and graph-theoretic theory of dropout by modeling training as a random walk over a high-dimensional graph of binary subnetworks. Each node represents a masked version of the network, and dropout induces stochastic…

We present analytical results for the structural evolution of random networks undergoing contraction processes via generic node deletion scenarios, namely, random deletion, preferential deletion and propagating deletion. Focusing on…

In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…

We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…

The convergence of a sequence of point processes with dependent points, defined by a symmetric function of iid high-dimensional random vectors, to a Poisson random measure is proved. This also implies the convergence of the joint…

Random graph models play a central role in network analysis. The Chung-Lu model, which connects nodes based on their expected degrees is of particular interest. It is widely used to generate null-graph models with expected degree sequences…

The $k$-core decomposition is a widely studied summary statistic that describes a graph's global connectivity structure. In this paper, we move beyond using $k$-core decomposition as a tool to summarize a graph and propose using $k$-core…

We consider the number of crossings in a random labelled tree with vertices in convex position. We give a new proof of the fact that this quantity is asymptotically Gaussian with mean $n^2/6$ and variance $n^3/45$. Furthermore, we give an…

Continuing the analysis initiated in Lachi\'eze-Rey and Peccati (2011), we use contraction operators to study the normal approximation of random variables having the form of a U-statistic written on the points in the support of a random…

In this article we propose a general framework for normal approximation using Stein's method. We introduce the new concept of Stein couplings and we show that it lies at the heart of popular approaches such as the local approach,…