Related papers: Random connection models in the thermodynamic regi…
We give a general local central limit theorem for the sum of two independent random variables, one of which satisfies a central limit theorem while the other satisfies a local central limit theorem with the same order variance. We apply…
In this paper, we focus on studying central limit theorems for functionals of some specific stationary random processes. In classical probability theory, it is well-known that for non-linear functionals of stationary Gaussian sequences, we…
It is well known that central order statistics exhibit a central limit behavior and converge to a Gaussian distribution as the sample size grows. This paper strengthens this known result by establishing an entropic version of the CLT that…
In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on…
We consider sequences of needlet random fields defined as weighted averaged forms of spherical Gaussian eigenfunctions. Our main result is a Central Limit Theorem in the high energy setting, for the boundary lengths of their excursion sets.…
We study the relationship between chaotic behavior and the Central Limit Theorem (CLT) in the Kuramoto model. We calculate sums of angles at equidistant times along deterministic trajectories of single oscillators and we show that, when…
This paper develops new limit theory for data that are generated by networks or more generally display cross-sectional dependence structures that are governed by observable and unobservable characteristics. Strategic network formation…
When the underlying random variables are Gaussian, the classical Central Limit Theorem (CLT) is trivial, but the functional CLT is not. The objective of the paper is to investigate the functional CLT for stationary Gaussian processes in the…
The law of large numbers (LLN) and central limit theorem (CLT) are long and widely been known as two fundamental results in probability theory. Recently problems of model uncertainties in statistics, measures of risk and superhedging in…
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…
In this paper we propose a new approach to the central limit theorem (CLT), based on functions of bounded F\'echet variation for the continuously differentiable linear statistics of random matrix ensembles which relies on: a weaker form of…
The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…
We investigate a spatial random graph model whose vertices are given as a marked Poisson process on $\mathbb{R}^d$. Edges are inserted between any pair of points independently with probability depending on the spatial displacement of the…
Let $\{X_k\}_{k \in \mathbb{Z}}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal{H}_1$, and let $G:\mathcal{H}_1 \to \mathcal{H}_2$ be an operator acting on $X_k$. Under suitable conditions on the…
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
We consider soft random geometric graphs, constructed by distributing points (nodes) randomly according to a Poisson Point Process, and forming links between pairs of nodes with a probability that depends on their mutual distance, the…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
In this article we consider a natural class of random walks on free products of graphs, which arise as convex combinations of random walks on the single factors. From the works of Gilch [6,7] it is well-known that for these random walks the…
We study aspects of chaos and thermodynamics at strong coupling in a scalar model using LCT numerical methods. We find that our eigenstate spectrum satisfies Wigner-Dyson statistics and that the coefficients describing eigenstates in our…
We study the properties of the giant connected component in random graphs with arbitrary degree distribution. We concentrate on the degree-degree correlations. We show that the adjoining nodes in the giant connected component are correlated…