Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 86 tok/s
Gemini 2.5 Pro 45 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 111 tok/s Pro
Kimi K2 178 tok/s Pro
GPT OSS 120B 452 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

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

Published 19 Dec 2012 in math.PR, math-ph, and math.MP

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).

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (1)