Related papers: Limit theorems for the painting of graphs by clust…
The much-discussed \emph{Weak Gravity Conjecture} is interesting and important in both the asymptotically flat and the asymptotically AdS contexts. In the latter case, it is natural to ask what conditions it (and the closely related Cosmic…
The Beta coalescents are stochastic processes modeling the genealogy of a population. They appear as the rescaled limits of the genealogical trees of numerous stochastic population models. In this article, we take interest in the number of…
In this talk I first review at an elementary level a selection of central limit theorems, including some lesser known cases, for sums and maxima of uncorrelated and correlated random variables. I recall why several of them appear in…
We study the list-chromatic number and the coloring number of graphs, especially uncountable graphs. We show that the coloring number of a graph coincides with its list-chromatic number provided that the diamond principle holds. Under the…
The field of analytic combinatorics is dedicated to the creation of effective techniques to study the large-scale behaviour of combinatorial objects. Although classical results in analytic combinatorics are mainly concerned with univariate…
In this note we re-visit the fundamental question of the strong law of large numbers and central limit theorem for processes in continuous time with conditional stationary and independent increments. For convenience we refer to them as…
We prove two theorems related to the Central Limit Theorem (CLT) for Martin-L\"of Random (MLR) sequences. Martin-L\"of randomness attempts to capture what it means for a sequence of bits to be "truly random". By contrast, CLTs do not make…
We consider a borderline case: the central limit theorem for a strictly stationary time series with infinite variance but a Gaussian limit. In the iid case a well-known sufficient condition for this central limit theorem is regular…
A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…
We obtain large deviations estimates for both sequential and random compositions of intermittent maps. We also address the question of whether or not centering is necessary for the quenched central limit theorems (CLT) obtained by Nicol,…
A vertex coloring $\phi$ of a graph $G$ is $p$-centered if for every connected subgraph $H$ of $G$ either $\phi$ uses more than $p$ colors on $H$ or there is a color that appears exactly once on $H$. Centered colorings form one of the…
This paper addresses the following classical question: giving a sequence of identically distributed random variables in the domain of attraction of a normal law, does the associated linear process satisfy the central limit theorem? We study…
The generalised colouring numbers $\mathrm{col}_r(G)$ and $\mathrm{wcol}_r(G)$ were introduced by Kierstead and Yang as a generalisation of the usual colouring number, and have since then found important theoretical and algorithmic…
A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial automorphism of a locally finite graph moves infinitely many…
Colored tensor models have been recently shown to admit a large N expansion, whose leading order encodes a sum over a class of colored triangulations of the D-sphere. The present paper investigates in details this leading order. We show…
This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…
$\DeclareMathOperator{\chicen}{\chi_{\mathrm{cen}}}\DeclareMathOperator{\chilin}{\chi_{\mathrm{lin}}}$ A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a…
This paper establishes limit theorems and quantitative statistical stability for a class of piecewise partially hyperbolic maps that are not necessarily continuous nor locally invertible. By employing a flexible functional-analytic…
Linear statistics of eigenvalues in many familiar classes of random matrices are known to obey gaussian central limit theorems. The proofs of such results are usually rather difficult, involving hard computations specific to the model in…
In this paper we consider a branching particle system consisting of particles moving according to the Ornstein-Uhlenbeck process in R^d and undergoing a binary, supercritical branching with a constant rate \lambda>0. This system is known to…