Related papers: P\'olya Urn Schemes with Infinitely Many Colors
Consider a branching random walk in which the offspring distribution and the moving law both depend on an independent and identically distributed random environment indexed by the time.For the normalised counting measure of the number of…
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…
Let $S$ be an orthogonal array $OA(d,k)$ and let $c$ be an $r$--coloring of its ground set $X$. We give a combinatorial identity which relates the number of vectors in $S$ with given color patterns under $c$ with the cardinalities of the…
Distribution of colors and patterns in images is observed through cascades that adjust spatial resolution and dynamics. Cascades of colors reveal the emergent universal property that Fully Colored Images (FCIs) of natural scenes adhere to…
We present an affine-invariant random walk for drawing uniform random samples from a convex body $\mathcal{K} \subset \mathbb{R}^n$ that uses maximum volume inscribed ellipsoids, known as John's ellipsoids, for the proposal distribution.…
There are many classical random walk in random environment results that apply to ergodic random planar environments. We extend some of these results to random environments in which the length scale varies from place to place, so that the…
We consider multicolor urn models with multiple drawings. An urn model is called linear if the conditional expected value of the urn composition at time $n$ is a linear function of the composition at time $n-1$. For four different sampling…
The behaviour and functioning of a variety of complex physical and biological systems depend on the spatial organisation of their constituent units, and on the presence and formation of clusters of functionally similar or related…
Set-coloring a graph means giving each vertex a subset of a fixed color set so that no two adjacent subsets have the same cardinality. When the graph is complete one gets a new distribution problem with an interesting generating function.…
We study survival among two competing types in two settings: a planar growth model related to two-neighbour bootstrap percolation, and a system of urns with graph-based interactions. In the planar growth model, uncoloured sites are given a…
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…
Some coloring algorithms gives an upper bound for the locating chromatic number of trees with all the vertices not in an end-path colored by only two colors. That means, a better coloring algorithm could be achieved by optimizing the number…
In this paper we are concerned with a family of $N$-urn branching processes, where some particles are put into $N$ urns initially and then each particle gives birth to several new particles in some urn when dies. This model includes the…
We study the so-called nonconventional averages in the context of lattice spin systems, or equivalently random colourings of the integers. For i.i.d. colourings, we prove a large deviation principle for the number of monochromatic…
We derive the asymptotic distribution of the domination number of a new family of random digraph called proximity catch digraph (PCD), which has application to statistical testing of spatial point patterns and to pattern recognition. The…
We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…
In this paper we propose a deterministic algorithm for approximately counting the $k$-colourings of sparse random graphs $G(n,d/n)$. In particular, our algorithm computes in polynomial time a $(1\pm n^{-\Omega(1)})$approximation of the…
We investigate a specific infinite urn scheme first considered by Karlin (1967). We prove functional central limit theorems for the total number of urns with at least k balls for different k.
A major research area in discrete geometry is to consider the best way to partition the $d$-dimensional Euclidean space $\mathbb{R}^d$ under various quality criteria. In this paper we introduce a new type of space partitioning that is…
For a set $A\subset C[0,\infty)$, we give new results on the growth of the number of particles in a dyadic branching Brownian motion whose paths fall within A. We show that it is possible to work without rescaling the paths. We give large…