[HTML][HTML] Malliavin–Stein method: a survey of some recent developments

E Azmoodeh, G Peccati, X Yang - Modern Stochastics: Theory and …, 2021 - vmsta.org
Initiated around the year 2007, the Malliavin–Stein approach to probabilistic approximations
combines Stein's method with infinite-dimensional integration by parts formulae based on …

Central limit theorem for Euclidean minimal spanning acycles

P Skraba, D Yogeshwaran - arXiv preprint arXiv:2205.12348, 2022 - arxiv.org
We investigate asymptotics for the minimal spanning acycles of the (Alpha)-Delaunay
complex on a stationary Poisson process on $\mathbb {R}^ d, d\geq 2$. Minimal spanning …

Normal approximation of subgraph counts in the random-connection model

Q Liu, N Privault - arXiv preprint arXiv:2301.12145, 2023 - arxiv.org
This paper derives normal approximation results for subgraph counts written as
multiparameter stochastic integrals in a random-connection model based on a Poisson point …

Normal to Poisson phase transition for subgraph counting in the random-connection model

Q Liu, N Privault - arXiv preprint arXiv:2409.16222, 2024 - arxiv.org
This paper studies the limiting behavior of the count of subgraphs isomorphic to a graph $ G
$ with $ m\geq 0$ fixed endpoints in the random-connection model, as the intensity …

Graph connectivity with fixed endpoints in the random-connection model

Q Liu, N Privault - arXiv preprint arXiv:2312.12745, 2023 - arxiv.org
We consider the count of subgraphs with an arbitrary configuration of endpoints in the
random-connection model based on a Poisson point process on ${\Bbb R}^ d $. We present …

The cumulant method for counting variables and typical cells in poisson line tessellations

N Heerten - 2024 - hss-opus.ub.ruhr-uni-bochum.de
This dissertation is divided into two main parts: The first part focuses on the cumulant
method, which provides various results concerning the distribution of the underlying random …