Related papers: P\'olya Urn Schemes with Infinitely Many Colors

We propose a method of detecting a phase transition in a generalized P\'olya urn in an information cascade experiment. The method is based on the asymptotic behavior of the correlation $C(t)$ between the first subject's choice and the…

We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…

Brooks' theorem states that all connected graphs but odd cycles and cliques can be colored with $\Delta$ colors, where $\Delta$ is the maximum degree of the graph. Such colorings have been shown to admit non-trivial distributed algorithms…

We consider an infinite balls-in-boxes occupancy scheme with boxes organised in nested hierarchy, and random probabilities of boxes defined in terms of iterated fragmentation of a unit mass. We obtain a multivariate functional limit theorem…

We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…

This paper studies a very general urn model stimulated by designs in clinical trials, where the number of balls of different types added to the urn at trial n depends on a random outcome directed by the composition at trials 1,2,...,n-1.…

We derive a simple expression for the tail-asymptotics of an explosive birth process at a fixed observation time conditioned on non-explosion. Using the well-established exponential embedding, we apply this result to compute the tail…

We introduce a class of absorption mechanisms and study the behavior of real-valued centered random walks with finite variance that do not get absorbed. In particular, we prove persistence and scaling limit results, which, in many cases of…

Juggling patterns can be mathematically modeled as closed walks within directed state graphs. In this paper, we present a unified framework of unbounded juggling patterns and its variations (including multiplex, colored, and passing)…

A nested occupancy scheme in random environment is a generalization of the classical Karlin infinite balls-in-boxes occupancy scheme in random environment (with random probabilities). Unlike the Karlin scheme in which the collection of…

In this paper, we study the spatial averages of the solution to the parabolic Anderson model driven by a space-time Gaussian homogeneous noise that is colored in time and space. We establish quantitative central limit theorems (CLT) of this…

We consider the discrepancy problem of coloring $n$ intervals with $k$ colors such that at each point on the line, the maximal difference between the number of intervals of any two colors is minimal. Somewhat surprisingly, a coloring with…

We study several exactly solvable Polya-Eggenberger urn models with a \emph{diminishing} character, namely, balls of a specified color, say $x$ are completely drawn after a finite number of draws. The main quantity of interest here is the…

We consider a time-dependent version of a P\'olya urn containing black and white balls. At each time $n$ a ball is drawn from the urn at random and replaced in the urn along with $\sigma_n$ additional balls of the same colour. The…

Consider edge colorings of digraphs where edges $v_1 v_2$ and $v_2 v_3$ have different colors. This coloring induces a vertex coloring by sets of edge colors, in which edge $v_1 v_2$ in the graph implies that the set color of $v_1$ contains…

Consider a balanced non triangular two-color P\'olya-Eggenberger urn process, assumed to be large which means that the ratio sigma of the replacement matrix eigenvalues satisfies 1/2<sigma <1. The composition vector of both discrete time…

We consider a non-nestling random walk in a product random environment. We assume an exponential moment for the step of the walk, uniformly in the environment. We prove an invariance principle (functional central limit theorem) under almost…

We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…

Let $f:[0,1)^d \to {\mathbb R}$ be an integrable function. An objective of many computer experiments is to estimate $\int_{[0,1)^d} f(x) dx$ by evaluating f at a finite number of points in [0,1)^d. There is a design issue in the choice of…

We consider a randomized urn model with objects of finitely many colors. The replacement matrices are random, and are conditionally independent of the color chosen given the past. Further, the conditional expectations of the replacement…