ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an infinite transitive connected graph, and let {Gn}n=1∞\{G_n\}_{n=1}^{\infty} be a sequence of infinite transitive connected graphs that converges locally to GG. For each graph, let μ(G)\mu(G) denote its connective constant, defined as the exponential growth rate of the number of self-avoiding walks.

Continuity conjecture. The connective constant is continuous with respect to local convergence:

lim⁡n→∞μ(Gn)=μ(G).\lim_{n\to\infty}\mu(G_n)=\mu(G).

The connective constant governs the exponential growth of self-avoiding walks and is known explicitly for very few graphs. Continuity under local convergence would allow connective constants of locally approximating transitive graphs to determine that of the limit; the source provides no resolution of this assertion.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.