Related papers: Central limit theorems, Lee-Yang zeros, and graph-…
We exploit a result by Nerman which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs, where we obtain asymptotic normality…
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…
We prove a central limit theorem for random sums of the form $\sum_{i=1}^{N_n} X_i$, where $\{X_i\}_{i \geq 1}$ is a stationary $m-$dependent process and $N_n$ is a random index independent of $\{X_i\}_{i\geq 1}$. Our proof is a…
The Generalized Central Limit Theorem is a remarkable generalization of the Central Limit Theorem, showing that the sum of a large number of independent, identically-distributed (i.i.d) random variables with infinite variance may converge…
Let $G$ be a group with a non-elementary action on a proper CAT(0) space $X$, and let $\mu$ be a measure on $G$ such that the random walk $(Z_n)_n$ generated by $\mu$ has finite second moment on $X$. Let $o$ be a basepoint in $X$, and…
We study the fluctuations in the distribution of zeros of zeta functions of a family of hyperelliptic curves defined over a fixed finite field, in the limit of large genus. According to the Riemann Hypothesis for curves, the zeros all lie…
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…
Let $(Z_{n})$ be a supercritical branching process in a random environment $\xi $, and $W$ be the limit of the normalized population size $Z_{n}/\mathbb{E}[Z_{n}|\xi ]$. We show large and moderate deviation principles for the sequence $\log…
Let $L(s, \chi_1), \ldots, L(s, \chi_N)$ be primitive Dirichlet $L$-functions different from the Riemann zeta function. Under suitable hypotheses we prove that any linear combination $a_1\log|L(\rho,\chi_1)|+\dots+a_N\log|L(\rho,\chi_N)|$…
We formulate and prove a new sufficient conditions for Central Limit Theorem(CLT) in the space of continuous functions in the terms typical for the approximation theory. We prove that the conditions for continuous CLT obtained by N.C.Jain…
Using an averaged generating function for coloured hard-dimers, some random variables of interest are studied. The main result lies in the fact that all their probability distributions obey a central limit theorem.
Given a positive integer $n$, consider a random permutation $\tau$ of the set $\{1,2,\ldots, n\}$. In $\tau$, we look for sequences of consecutive integers that appear in adjacent positions: a maximal such a sequence is called a block. Each…
It is known that the fluctuations of suitable linear statistics of Haar distributed elements of the compact classical groups satisfy a central limit theorem. We show that if the corresponding test functions are sufficiently smooth, a rate…
We present new values and bounds on the (normalised) closeness centrality $\bar{\mathsf{C}}_C$ of connected graphs and on its product $\bar{l}\bar{\mathsf{C}}_C$ with the mean distance $\bar{l}$ of these graphs. Our main result presents the…
In this work we study and establish some quenched functional Central Limit Theorems (CLTs) for stationary random fields under a projective criteria. These results are functional generalizations of the theorems obtained by Zhang et al.…
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 study cosmological polytopes induced by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These graph-based lattice polytopes form a natural model of random lattice polytopes in which geometric features are determined by the…
In the present paper, we study central limit theorems (CLTs) for non-symmetric random walks on nilpotent covering graphs from a point of view of discrete geometric analysis developed by Kotani and Sunada. We establish a semigroup CLT for a…
The objective of this study is to investigate the limiting behavior of a subgraph counting process. The subgraph counting process we consider counts the number of subgraphs having a specific shape that exist outside an expanding ball as the…
In a recent work, a central limit theorem for pattern counts in random planar maps was proven by reducing the problem to a face count problem. We provide a shorter proof by circumventing this reduction through the computation of bivariate…