




















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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。