Papers
Topics
Authors
Recent
Search
2000 character limit reached

Locality of percolation critical probabilities: uniformly nonamenable case

Published 8 Oct 2014 in math.PR | (1410.2453v2)

Abstract: Let ${G_n}{n=1}{\infty}$ be a sequence of transitive infinite connected graphs with $\sup\limits{n\geq 1} p_c(G_n) < 1,$ where each $p_c(G_n)$ is bond percolation critical probability on $G_n.$ Schramm (2008) conjectured that if $G_n$ converges locally to a transitive infinite connected graph $G,$ then $p_c(G_n) \rightarrow p_c(G)$ as $n\rightarrow\infty.$ We prove the conjecture when $G$ satisfies two rough uniformities, and ${G_n}_{n=1}{\infty}$ is uniformly nonamenable.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.