Related papers: Central Limit Theorems for Multicolor Urns with Do…

We address the issue of the Central Limit Theorem for (both local and global) empirical measures of diffusions interacting on a possibly diluted Erd\H{o}s-R\'enyi graph. Special attention is given to the influence of initial condition (not…

Consider a well-shuffled deck of cards of $n$ different types where each type occurs $m$ times. In a complete feedback game, a player is asked to guess the top card from the deck. After each guess, the top card is revealed to the player and…

We consider a special case of the generalized P\'{o}lya's urn model introduced by Benaim et al (2013). Given a finite connected graph $G$, place a bin at each vertex. Two bins are called a pair if they share an edge of $G$. At discrete…

We introduce a class of reinforcement models where, at each time step $t$, one first chooses a random subset $A_t$ of colours (independent of the past) from $n$ colours of balls, and then chooses a colour $i$ from this subset with…

We present a general approach to establish the Central Limit Theorem with error bounds for sequential dynamical systems. The main tool we develop is the application to this setting of a projective metric on complex cones, following the…

We consider edge colorings of graphs. An edge coloring is a majority coloring if for every vertex at most half of the edges incident with it are in one color. And edge coloring is a distinguishing coloring if for every non-trivial…

We give bounds for (central) moments for balanced P\'olya urns under very general conditions. In some cases, these bounds imply that moment convergence holds in earlier known results on asymptotic distribution. The results overlap with…

Let L_1, ..., L_d be pairwise disjoint collections of lines in a d-dimensional vector space over some field. If the collections are sufficiently generic we prove that there exists a d-colouring of the set of multijoints J such that for each…

A well-known result of Alon shows that the coloring number of a graph is bounded by a function of its choosability. We explore this relationship in a more general setting with relaxed assumptions on color classes, encoded by a graph…

We establish self-norming central limit theorems for non-stationary time series arising as observations on sequential maps possessing an indifferent fixed point. These transformations are obtained by perturbing the slope in the…

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 derive a strong law of large numbers, a central limit theorem, a law of the iterated logarithm and a large deviation theorem for so-called deviation means of independent and identically distributed random variables (for the strong law of…

Concentration bounds are given for throwing balls into bins independently according to a distribution $p$. The probability of a $k$-loaded bin after $m$ balls is shown to be controlled on both sides by $\rho_{m,k} := m \|p\|_k / k$. This…

The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…

The de Moivre-Laplace theorem is a special case of the central limit theorem for Bernoulli random variables, and can be proved by direct computation. We deduce the central limit theorem for any random variable with finite variance from the…

We give a simpler proof of Seymour's Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colored with a given number of colors.

Consider a graph whose vertices are colored in one of two colors, say black or white. A white vertex is called integrated if it has at least as many black neighbors as white neighbors, and similarly for a black vertex. The coloring as a…

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…

We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several exampls of colorings of the integers which do not…

Given a finite connected graph $G$, place a bin at each vertex. Two bins are called a pair if they share an edge of $G$. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with…