Related papers: Functional Central Limit Theorem for Subgraph Coun…
We study the convergence in distribution norms in the Central Limit Theorem for non identical distributed random variables that is $$ \varepsilon_{n}(f):={\mathbb{E}}\Big(f\Big(\frac 1{\sqrt…
We establish central limit theorems for general functionals on binomial point processes and their Poissonized version. As an application, a central limit theorem for Betti numbers of random geometric complexes in the thermodynamic regime is…
The central limit for the product of free random variables are studied by evaluating all the moments of the limit distribution. The logarithm of the central limit is found to be the same as the sum of two independent free random variables:…
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…
In this paper, we extend the central limit theorem of the additive functional of the nearest-neighbor zero-range process given in \cite{Quastel2002} to the long-range case. Our main results show that in several cases the limit processes are…
A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information…
We consider versions of the FIND algorithm where the pivot element used is the median of a subset chosen uniformly at random from the data. For the median selection we assume that subsamples of size asymptotic to $c \cdot n^\alpha$ are…
We study the number of occurrences of any fixed vincular permutation pattern. We show that this statistics on uniform random permutations is asymptotically normal and describe the speed of convergence. To prove this central limit theorem,…
We get central limit type theorems for the total number of edges in the generalized random graphs with random vertex weights under different moment conditions on distributions of the weights.
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…
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks on the simplex of probability measures over a finite set. Due to a reinforcement mechanism, the increments of the walks are…
Topological Data Analysis (TDA) refers to an approach that uses concepts from algebraic topology to study the "shapes" of datasets. The main focus of this paper is persistent homology, a ubiquitous tool in TDA. Basing our study on this, we…
In this paper we consider a dynamic version of the Erd\H{o}s-R\'{e}nyi random graph, in which edges independently appear and disappear in time, with the on- and off times being exponentially distributed. The focus lies on the evolution of…
We investigate the dependence of the center-of-mass tomogram of a system with many degrees of freedom $N$ on the Planck constant $\hbar $. It is shown that to use the central limit theorem under taking the limit $N\to +\infty $ one should…
We consider the determinantal point processes associated with the spectral projectors of a Schr\"odinger operator on $\mathbb{R}$, with a smooth confining potential. In the semiclassical limit, where the number of particles tends to…
Graph convolutional networks (GCNs) are a widely used method for graph representation learning. To elucidate the capabilities and limitations of GCNs, we investigate their power, as a function of their number of layers, to distinguish…
In this paper, we establish a spatial central limit theorem for a large class of supercritical branching, not necessarily symmetric, Markov processes with spatially dependent branching mechanisms satisfying a second moment condition. This…
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…
Fix an integer $p\geq 1$ and refer to it as the number of growing domains. For each $i\in\{1,\ldots,p\}$, fix a compact subset $D_i\subseteq\mathbb R^{d_i}$ where $d_1,\ldots,d_p\ge 1$. Let $d= d_1+\dots+d_{p}$ be the total underlying…
In this paper, we establish a central limit theorem for a large class of general supercritical superprocesses with immigration with spatially dependent branching mechanisms satisfying a second moment condition. This central limit theorem…