Existence of a non-averaging regime for the self-avoiding walk on a high-dimensional infinite percolation cluster
Abstract
Let ZN be the number of self-avoiding paths of length N starting from the origin on the infinite cluster obtained after performing Bernoulli percolation on Zd with parameter p>pc(Zd). The object of this paper is to study the connective constant of the dilute lattice N ∞ ZN1/N, which is a non-random quantity. We want to investigate if the inequality N ∞ (ZN)1/N N ∞ E[ZN]1/N obtained with the Borel-Cantelli Lemma is strict or not. In other words, we want to know the the quenched and annealed versions of the connective constant are the same. On a heuristic level, this indicates whether or not localization of the trajectories occurs. We prove that when d is sufficiently large there exists p(2)c>pc such that the inequality is strict for p∈ (pc,p(2)c).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.