Upper bounds on the percolation correlation length

arXiv: Probability(2019)

引用 2|浏览21
暂无评分
摘要
We study the size of the near-critical window for Bernoulli percolation on $mathbb Z^d$. More precisely, we use a quantitative Grimmett-Marstrand theorem to prove that the correlation length, both below and above criticality, is bounded from above by $exp(C/|p-p_c|^2)$. Improving on this bound would be a further step towards the conjecture that there is no infinite cluster at criticality on $mathbb Z^d$ for every $dge2$.
更多
查看译文
关键词
percolation correlation length,bounds
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要