Related papers: Central Limit Theorems for Multicolor Urns with Do…
Let $\{G_n: n\geq 1\}$ be a sequence of simple graphs. Suppose $G_n$ has $m_n$ edges and each vertex of $G_n$ is colored independently and uniformly at random with $c_n$ colors. Recently, Bhattacharya, Diaconis and Mukherjee (2013) proved…
We get central limit type theorems for the total number of edges in the generalized random graphs with random vertex weights under different moment conditions on distributions of the weights.
Given a graph $G$ and some initial labelling $\sigma : V(G) \to \{Red, Blue\}$ of its vertices, the \textit{majority dynamics model} is the deterministic process where at each stage, every vertex simultaneously replaces its label with the…
Let $G$ be a finite Abelian group of order $d$. We consider an urn in which, initially, there are labeled balls that generate the group $G$. Choosing two balls from the urn with replacement, observe their labels, and perform a group…
We consider a mean-field dynamical urn model, defined by rules which give the rate at which a ball is drawn from an urn and put in another one, chosen amongst an assembly. At equilibrium, this model possesses a fluid and a condensed phase,…
An urn contains a known number of balls of two different colors. We describe the random variable counting the smallest number of draws needed in order to observe at least $\,c\,$ of both colors when sampling without replacement for a…
We investigate in this paper the distribution of the discrepancy of various lattice counting functions. In particular, we prove that the number of lattice points contained in certain domains defined by products of linear forms satisfies a…
In this paper, we give the central limit theorem and almost sure central limit theorem for products of some partial sums of independent identically distributed random variables.
In this paper the question of the extent to which truncated heavy tailed random vectors, taking values in a Banach space, retain the characteristic features of heavy tailed random vectors, is answered from the point of view of the central…
An extended Polya urn Model with two colors, black and white, is studied with some SLLN and CLT on the proportion of white balls.
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
We consider triangular P\'olya urns and show under very weak conditions a general strong limit theorem of the form $X_{ni}/a_{ni}\to \mathcal{X}_i$ a.s., where $X_{ni}$ is the number of balls of colour $i$ after $n$ draws; the constants…
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 probability…
Drawing (a multiset of) coloured balls from an urn is one of the most basic models in discrete probability theory. Three modes of drawing are commonly distinguished: multinomial (draw-replace), hypergeometric (draw-delete), and Polya…
This is a note on some results of the central limit theorem for deterministic dynamical systems. First, we give the central limit theorem for martingales, which is a main tool. Then we give the main results on the central limit theorem in…
We prove limit theorems for sums of randomly chosen random variables conditioned on the summands. We consider several versions of the corner growth setting, including specific cases of dependence amongst the summands and summands with heavy…
Regarding the conjugacy representation on symmetric groups, we initiate a normalized measure emerging from this representation, namely the conjugacy measure. A central limit theorem for character ratios of random representations of the…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
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…
Given a set of $n$ colored balls, a \textit{majority, non-minority or plurality ball} is one whose color class has size more than $n/2$, at least $n/2$ or larger than any other color class, respectively. We describe linear time algorithms…