Locality of percolation critical probabilities: uniformly nonamenable case (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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.