Interacting urn models with strong reinforcement

Abstract

For the interacting urn model with polynomial reinforcement, it has been conjectured that almost surely one color monopolizes all the urns if the interaction parameter $p>0$. We disprove the conjecture. For the case $p=1$, we give a sufficient condition for monopoly, which improves a previous result obtained by Launay.

33 pages