Related papers: Interacting Urns on a Finite Directed Graph

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…

We introduce a novel preferential attachment model using the draw variables of a modified P\'olya urn with an expanding number of colors, notably capable of modeling influential opinions (in terms of vertices of high degree) as the graph…

We study a P\'olya-type urn model defined as follows. Start at time 0 with a single ball of some colour. Then, at each time n>0, choose a ball from the urn uniformly at random. With probability 1/2<p<1, return the ball to the urn along with…

We consider weighted negatively reinforced urn schemes with finitely many colours. An urn scheme is called negatively reinforced, if the selection probability for a colour is proportional to the weight $w$ of the colour proportion, where…

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…

In classical urn models, one usually draws one ball with replacement at each time unit and then adds one ball of the same colour. Given a weight sequence $(w_k)_{k\in\N}$, the probability of drawing a ball of a certain colour is…

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…

Consider the multicolored urn model where, after every draw, balls of the different colors are added to the urn in a proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not…

We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite or infinite) connected graph, so that each particle has…

In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…

We study P\'olya urns on hypergraphs and prove that, when the incidence matrix of the hypergraph is injective, there exists a point $v=v(H)$ such that the random process converges to $v$ almost surely. We also provide a partial result when…

Consider a generalized time-dependent P\'olya urn process defined as follows. Let $d\in \mathbb{N}$ be the number of urns/colors. At each time $n$, we distribute $\sigma_n$ balls randomly to the $d$ urns, proportionally to $f$, where $f$ is…

This is the second part of a two-part investigation. We continue the study of a class of balanced urn schemes on balls of two colors (white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn and ball addition rules…

We consider an urn model with multiple drawing and random time-dependent addition matrix. The model is very general with respect to previous literature: the number of sampled balls at each time-step is random, the addition matrix has…

In this paper, we consider a multi-drawing urn model with random addition. At each discrete time step, we draw a sample of m balls. According to the composition of the drawn colors, we return the balls together with a random number of balls…

Building on recent work by Medvedev (2014) we establish new connections between a basic consensus model, called the voting model, and the theory of graph limits. We show that in the voting model if consensus is attained in the continuum…

We consider P\'olya urns with infinitely many colours that are of a random walk type, in two related version. We show that the colour distribution a.s., after rescaling, converges to a normal distribution, assuming only second moments on…

We study a general preferential attachment and Polya's urn model. At each step a new vertex is introduced, which can be connected to at most one existing vertex. If it is disconnected, it becomes a pioneer vertex. Given that it is not…

This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…

In this article, we study the large-population limit of interacting particle systems posed on weighted random graphs. In that aim, we introduce a general framework for the construction of weighted random graphs, generalizing the concept of…