Abstract
In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical percolation cluster on $\bbZ^d$. More precisely, we count the number of self-avoiding paths of length on the infinite cluster, starting from the origin (that we condition to be in the cluster). We are interested in estimating the upper growth rate of , , that we call the connective constant of the dilute lattice. After proving that this connective constant is a.s.\ non-random, we focus on the two-dimensional case and show that for every percolation parameter , almost surely, grows exponentially slower than its expected value. In other word we prove that $\limsup_{N\to \infty} (Z_N)^{1/N} <\lim_{N\to \infty} \bbE[Z_N]^{1/N}$ where expectation is taken with respect to the percolation process. This result can be considered as a first mathematical attempt to understand the influence of disorder for self-avoiding walk on a (quenched) dilute lattice. Our method, which combines change of measure and coarse graining arguments, does not rely on specifics of percolation on $\bbZ^2$, so that our result can be extended to a large family of two dimensional models including general self-avoiding walk in random environment.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.