ProV Logo
0
Graph-based Polya's urn: completion of t...
Lima, Yuri...

Free

Graph-based Polya's urn: completion of the linear case by Lima, Yuri ( Author )
Lemonjar Open Access
N.A
27-09-2014
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 proportional to its current number of balls. Previous works proved that when G is not balanced bipartite, the proportion of balls in the bins converges to a point w(G) almost surely. We prove almost sure convergence for balanced bipartite graphs: the possible limit is either a single point w(G) or a closed interval J(G).
-
Article
pdf
36.88 KB
English
-
MYR 0.01
-
https://arxiv.org/abs/1409.7826
Share this eBook