Papers
Topics
Authors
Recent
Search
2000 character limit reached

Existence of a non-averaging regime for the self-avoiding walk on a high-dimensional infinite percolation cluster

Published 19 Dec 2012 in math.PR, math-ph, and math.MP | (1212.4641v2)

Abstract: Let Z_N 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>p_c(Zd). The object of this paper is to study the connective constant of the dilute lattice \limsup_{N\to \infty} Z_N{1/N}, which is a non-random quantity. We want to investigate if the inequality \limsup_{N\to \infty} (Z_N){1/N} \le \lim_{N\to \infty} E[Z_N]{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>p_c such that the inequality is strict for p\in (p_c,p{(2)}_c).

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.