Related papers: Limit theorems for the painting of graphs by clust…

Given a graph $G$ and an integer $p$, a coloring $f : V(G) \to \mathbb{N}$ is \emph{$p$-centered} if for every connected subgraph $H$ of $G$, either $f$ uses more than $p$ colors on $H$ or there is a color that appears exactly once in $H$.…

The general model of coagulation is considered. For basic classes of unbounded coagulation kernels the central limit theorem (CLT) is obtained for the fluctuations around the dynamic law of large numbers (LLN). A rather precise rate of…

We prove analogs of Brooks' Theorem for the list-distinguishing chromatic number of different classes of simple finite connected graphs. Moreover, we determine two upper bounds for the list-distinguishing chromatic number of a graph G in…

Let $G$ be an $N \times N$ real matrix whose entries are independent identically distributed standard normal random variables $G_{ij} \sim \mathcal{N}(0,1)$. The eigenvalues of such matrices are known to form a two-component system…

The law of large numbers for the empirical density for the pairs of uniformly distributed integers with a given greatest common divisor is a classic result in number theory. In this paper, we study the large deviations of the empirical…

Graph coloring is fundamental to distributed computing. We give the first sub-logarithmic distributed algorithm for coloring cluster graphs. These graphs are obtained from the underlying communication network by contracting nodes and edges,…

The asymptotic behaviour of a generalised P\'olya--Eggenberger urn is well--known to depend on the spectrum of its replacement matrix: If its dominant eigenvalue $r$ is simple and no other eigenvalue is `large' in the sense that its real…

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…

Let $(\tau_n)$ be a sequence of toral automorphisms $\tau_n : x \rightarrow A_n x \hbox{mod}\ZZ^d$ with $A_n \in {\cal A}$, where ${\cal A}$ is a finite set of matrices in $SL(d, \mathbb{Z})$. Under some conditions the method of…

We prove quenched versions of a central limit theorem, a large deviations principle as well as a local central limit theorem for expanding on average cocycles. This is achieved by building an appropriate modification of the spectral method…

Suppose we have two finitely supported, admissible, probability measures on a hyperbolic group $\Gamma$. In this article we prove that the corresponding two Green metrics satisfy a counting central limit theorem when we order the elements…

Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…

We prove a Central Limit Theorem for the sequence of random compositions of a two-color randomly reinforced urn. As a consequence, we are able to show that the distribution of the urn limit composition has no point masses.

Let $X$ be a (repetitive) infinite connected simple graph with a finite upper bound $\Delta$ on the vertex degrees. The main theorem states that $X$ admits a (repetitive) limit aperiodic vertex coloring by $\Delta$ colors. This refines a…

For a given number of colors, $s$, the guessing number of a graph is the (base $s$) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph such that the color of each vertex can be determined from the…

We analyze the high temperature fluctuations of the magnetization of the so-called Ising block model. This model was recently introduced by Berthet, Rigollet and Srivastava. We prove a Central Limit Theorems (CLT) for the magnetization in…

A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…

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 construct an independent increments Gaussian process associated to a class of multicolor urn models. The construction uses random variables from the urn model which are different from the random variables for which central limit theorems…

In this paper we consider a branching particle system consisting of particles moving according to the Ornstein-Uhlenbeck process in $\Rd$ and undergoing a binary, supercritical branching with a constant rate $\lambda>0$. This system is…