Mathematics – Probability
Scientific paper
2012-03-27
Mathematics
Probability
14 Pages
Scientific paper
In this paper, we study abundance of self-avoiding paths of a given length on a supercritical percolation percolation cluster for percolation on $\mathbb Z^d$. More precisely, we count $Z_N$ the number of self-avoiding paths of length $N$ on the supercritical cluster, starting from the origin (that we condition to be in the cluster), and are interested in estimating the upper growth rate of $Z_N$ ($\limsup_{N\to \infty} Z_N^{1/N}$, we call it connective constant of the dilute lattice). After proving that the connective constant of the supercritical percolation cluster is a.s.\ non-random, we focus on the two-dimensional case and show that for every percolation parameter $p\in (1/2,1)$, almost surely, $Z_N$ grows exponentially slower than its expected value, that is $\limsup_{N\to \infty} Z_N^{1/N}<\lim_{N\to \infty} (\mathbb E[Z_N])^{1/N}$ where expectation is taken with respect to the percolation process. Our method combining change of measure and coarse graining arguments does not rely on specificities of percolation on $\mathbb Z^2$, so that our result can be extended to a large family of two dimensional models including self-avoiding walk in random environment.
No associations
LandOfFree
On the two dimensional supercritical percolation cluster, the number of self-avoiding paths is much smaller than expected does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the two dimensional supercritical percolation cluster, the number of self-avoiding paths is much smaller than expected, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the two dimensional supercritical percolation cluster, the number of self-avoiding paths is much smaller than expected will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-641354