arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0907.3828math.PR
收藏

论一维批判性“向邻居学习”模型

On the One Dimensional Critical "Learning from Neighbours" Model

Antar Bandyopadhyay, Rahul Roy, Anish Sarkar

摘要:

我们考虑一个模型的离散时间“相互作用的粒子系统”的整数线上的无限多的变化是允许在每个时刻。我们使用两种不同颜色的变色龙{ \it viz}来描述模型,红色($R$)和蓝色($B$)。在每一个时刻,变色龙都会进行一个独立但相同的抛硬币实验,以$α$的概率决定是否改变自己的颜色。如果硬币正面朝上,那么这个生物保持它的颜色(这被解释为“成功”),否则它会观察它的两个最近邻居的颜色和硬币投掷,只有在它的邻居(包括它自己)中,另一种颜色的成功比例大于它自己颜色的成功比例时,它才会改变它的颜色。这产生了具有无限状态空间${R, B}^{\Zbold}$的马尔可夫链。该模型首先由Chatterjee和Xu(2004)研究,其中不同的颜色具有不同的成功概率。在这项工作中,我们认为“关键”的情况下,成功概率,$α$,是相同的变色龙的颜色无关。我们表明,从任何初始的颜色的平移不变分布的马尔可夫链收敛到一个单一的颜色的限制,即,即使在临界情况下,在极限处也不存在两种颜色的“共存”。此外,我们表明,开始与i.i.d.颜色分布极限分布给“劣势者”一些优势。

英文摘要:

We consider a model of a discrete time "interacting particle system" on the integer line where infinitely many changes are allowed at each instance of time. We describe the model using chameleons of two different colours, {\it viz}., red ($R$) and blue ($B$). At each instance of time each chameleon performs an independent but identical coin toss experiment with probability $α$ to decide whether to change its colour or not. If the coin lands head then the creature retains its colour (this is to be interpreted as a "success"), otherwise it observes the colours and coin tosses of its two nearest neighbours and changes its colour only if, among its neighbors and including itself, the proportion of successes of the other colour is larger than the proportion of successes of its own colour. This produces a Markov chain with infinite state space ${R, B}^{\Zbold}$. This model was first studied by Chatterjee and Xu (2004) where different colours had different success probabilities. In this work we consider the "critical" case where the success probability, $α$, is the same irrespective of the colour of the chameleon. We show that starting from any initial translation invariant distribution of colours the Markov chain converges to a limit of a single colour, i.e., even at the critical case there is no "coexistence" of the two colours at the limit. Moreover we show that starting with an i.i.d. colour distribution the limiting distribution gives some advantage to the "underdog".

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑