Counterexamples for percolation on unimodular random graphs

UNIMODULARITY IN RANDOMLY GENERATED GRAPHS(2017)

引用 3|浏览2
暂无评分
摘要
We construct an example of a bounded degree, nonamenable, unimodular random rooted graph with $p_c=p_u$ for Bernoulli bond percolation, as well as an example of a bounded degree, unimodular random rooted graph with $p_c<1$ but with an infinite cluster at criticality. These examples show that two well-known conjectures of Benjamini and Schramm are false when generalised from transitive graphs to unimodular random rooted graphs.
更多
查看译文
关键词
Unimodular random graphs, percolation, uniqueness, connectivity, nonamenable
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要