arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1803.09686math.PRmath.COmath.GR
收藏

覆盖映射下渗流阈值的严格单调性

Strict monotonicity of percolation thresholds under covering maps

Sébastien Martineau, Franco Severo

摘要:

我们回答了Benjamini和Schramm的一个问题,证明了在合理的条件下,严格地表示一个图会增加其渗流临界参数$p_c$的值。更精确地说,令$\mathcal{G}=(V,E)$是一个具有$p_c(\mathcal{G})<1$的拟传递图,令$G$是一个通过图自同构自由作用于$V$的非平凡群。假设$\mathcal{H}:=\mathcal{G}/G$是准传递的。然后是$p_c(\mathcal{G})<p_c(\mathcal{H})$。我们提供的结果超出了这个设置:我们治疗的情况下,一般覆盖映射,并提供了一个类似的结果的唯一性参数$p_u$,根据一个额外的假设的有界性的纤维。证明使用了通过提升集群的探索而构建的耦合,以及Aizenman-Grimmett的基本增强的探索性对应物。

英文摘要:

We answer a question of Benjamini and Schramm by proving that under reasonable conditions, quotienting a graph strictly increases the value of its percolation critical parameter $p_c$. More precisely, let $\mathcal{G}=(V,E)$ be a quasi-transitive graph with $p_c(\mathcal{G})<1$, and let $G$ be a nontrivial group that acts freely on $V$ by graph automorphisms. Assume that $\mathcal{H}:=\mathcal{G}/G$ is quasi-transitive. Then one has $p_c(\mathcal{G})<p_c(\mathcal{H})$. We provide results beyond this setting: we treat the case of general covering maps and provide a similar result for the uniqueness parameter $p_u$, under an additional assumption of boundedness of the fibres. The proof makes use of a coupling built by lifting the exploration of the cluster, and an exploratory counterpart of Aizenman-Grimmett's essential enhancements.

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

↑