Coalescing random walk on unimodular graphs

Electronic Communications in Probability

Eric Foxall¹ 

关键词: coalescing random walk;    unimodular random graph;    voter model;   

DOI  :  10.1214/18-ECP136

学科分类：统计和概率

来源: Institute of Mathematical Statistics

【 摘 要 】

Coalescing random walk on a unimodular random rooted graph for which the root has finite expected degree visits each site infinitely often almost surely. A corollary is that an opinion in the voter model on such graphs has infinite expected lifetime. Additionally, we deduce an adaptation of our main theorem that holds uniformly for coalescing random walk on finite random unimodular graphs with degree distribution stochastically dominated by a probability measure with finite mean.

【 授权许可】

CC BY