Related papers: Limit theorems for the painting of graphs by clust…
In this paper, we review the representation theory of the infinite symmetric group, and we extend the works of Kerov and Vershik by proving that the irreducible characters of the infinite symmetric group always satisfy a central limit…
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…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
Given a Gromov-hyperbolic group $G$ endowed with a finite symmetric generating set, we study the statistics of counting measures on the spheres of the associated Cayley graph under linear representations of $G$. More generally, we obtain a…
We prove annealed central limit theorems for finite pattern counts in the measurement record of discrete-time quantum trajectories generated by repeated measurements in a disordered environment. Under summable mixing assumptions on the…
An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors…
The purpose of this paper is twofold. In one direction, we extend the spectral method for random piecewise expanding and hyperbolic dynamics developed by the first author \textit{et al}. to establish quenched versions of the large deviation…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
We study a mean-field spin model with three- and two-body interactions. The equilibrium measure for large volumes is shown to have three pure states, the phases of the model. They include the two with opposite magnetization and an…
In this paper we study supercritical super-OU processes with general branching mechanisms satisfying a second moment condition. We establish central limit theorems for the super-OU processes. In the small and crtical branching rate cases,…
We study supercritical age-structured branching models starting from a single particle with a random lifetime, where the reproduction law depends on the remaining lifetime of the parent. The lifespan of an individual is decided at its birth…
In this paper, we study the Exponential Random Graph Models (ERGMs) conditioning on the number of edges. In subcritical region of model parameters, we prove a conditional Central Limit Theorem (CLT) with explicit mean and variance for the…
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 the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
Vizing's theorem states that any $n$-vertex $m$-edge graph of maximum degree $\Delta$ can be edge colored using at most $\Delta + 1$ different colors. Vizing's original proof is easily translated into a deterministic $O(mn)$ time algorithm.…
Suppose $X = (X_x, x$ in $Z^d)$ is a family of i.i.d. variables in some measurable space, $B_0$ is a bounded set in $R^d$, and for $t > 1$, $H_t$ is a measure on $tB_0$ determined by the restriction of $X$ to lattice sites in or adjacent to…
We prove a general normal approximation theorem for local graph statistics in the configuration model, together with an explicit bound on the error in the approximation with respect to the Wasserstein metric. Such statistics take the form…
We analyze a model of dynamically broken topcolor in the limit in which the number of colors is large. We show that the second order nature of the phase transition, necessary for the success of topcolor models, passes the nontrivial check…
We prove a Central Limit Theorem (CLT) in the non-commutative setting of random matrix products where the underlying process is driven by a subshift of finite type (SFT) with Markov measure. We use the martingale method introduced by Y.…
We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number…