Related papers: Random connection models in the thermodynamic regi…

We show how a central limit theorem for Poisson model random polygons implies a central limit theorem for uniform model random polygons. To prove this implication, it suffices to show that in the two models, the variables in question have…

We develop a new toolbox for the analysis of the global behavior of stochastic discrete particle systems. We introduce and study the notion of the Schur generating function of a random discrete configuration. Our main result provides a…

We consider the existence of the integrated density of states (IDS) of the Anderson model on the Hilbert space $\ell^2(\mathbb{Z}^d)$ as analogues to the law of large numbers (LLN). In this work, we prove the analogues central limit theorem…

In this article, we first establish the joint central limit theorem (CLT) for the extreme eigenvalues of the sample correlation matrix of high-dimensional random walks with cross-sectional dependence. We further investigate the asymptotic…

In this paper we consider a dynamic Erd\H{o}s-R\'{e}nyi random graph with independent identically distributed edge processes. Our aim is to describe the joint evolution of the entries of a subgraph count vector. The main result of this…

The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…

Consider a simple random walk on a realization of an Erd\H{o}s-R\'enyi graph. Assume that it is asymptotically almost surely (a.a.s.) connected. Conditional on an eigenvector delocalization conjecture, we prove a Central Limit Theorem (CLT)…

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…

This paper provides a necessary and sufficient condition for a random network with nodes Poissonly distributed on a unit square and a pair of nodes directly connected following a generic random connection model to be asymptotically almost…

We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…

We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…

We use a multivariate central limit theorem (CLT) to study the distribution of random geometric graphs (RGGs) on the cube and torus in the high-dimensional limit with general node distributions. We find that the distribution of RGGs on the…

This work improves the existing central limit theorems (CLTs) for geometric functionals of Gibbs processes in three aspects. First, we derive a CLT for weakly stabilizing functionals, thereby improving on the previously used assumption of…

Let $T\in C^{2+\varepsilon}(S^{1}\setminus\{x_{b}\}),\,\,\varepsilon>0,$ be an orientation preserving circle homeomorphism with rotation number $\rho_T=[k_{1},k_{2},..,k_{m},1,1,...],\,\,m\geq1$, and a single break point $x_{b}$. We…

This paper develops central limit theorems (CLT's) and large deviations results for additive functionals associated with reflecting diffusions in which the functional may include a term associated with the cumulative amount of boundary…

Let $\Cal S$ be an abelian finitely generated semigroup of endomorphisms of a probability space $(\Omega, {\Cal A}, \mu)$, with $(T_1, ..., T_d)$ a system of generators in ${\Cal S}$. Given an increasing sequence of domains $(D_n) \subset…

In the original (1961) Gilbert model of random geometric graphs, nodes are placed according to a Poisson point process, and links formed between those within a fixed range. Motivated by wireless ad-hoc networks "soft" or "probabilistic"…

This paper re-examines the limit theorems of Abadie and Imbens for nearest-neighbor matching estimators of average treatment effects with a fixed number of matches. We establish, for the first time, a non-normalized central limit theorem…

We study persistent Betti numbers and persistence diagrams obtained from time series and random fields. It is well known that the persistent Betti function is an efficient descriptor of the topology of a point cloud. So far, convergence…

We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a…