Kai-Nan Xiang | Searcharxiv

arXiv2014

Locality of percolation critical probabilities: uniformly nonamenable case

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.

math.PR↗

arXiv2014

Connective Constants on Cayley Graphs

For a transitive infinite connected graph $G$, let $μ(G)$ be its connective constant. Denote by $\mathbf{\cal G}$ the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of other generators. Assume $G\in\mathbf{\cal G}$ is a Cayley graph of a finitely presented group, and Cayley graph sequence $\{G_n\}_{n=1}^{\infty}\subset \mathbf{\cal G}$ converges locally to $G.$ Then $μ(G_n)$ converges to $μ(G)$ as $n\rightarrow\infty.$ This confirms partially a conjecture raised by Benjamini [2013. {\it Coarse geometry and randomness.} Lect. Notes Math. {\bf 2100}. Springer.] that connective constant is continuous with respect to local convergence of infinite transitive connected graphs.

math.PR↗