ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX be a vertex-reinforced non-backtracking random walk on a connected finite undirected graph, with reinforcement function W(k)=(1+k)αW(k)=(1+k)^\alpha. Let C={i1,…,iℓ}C=\{i_1,\dots,i_\ell\} be a random path as in Proposition 0.1, and let LL denote its length. Path formation conjecture. If α>3\alpha>3, then almost surely there exist such a path CC and k0≥1k_0\geq 1 such that, for every k≥k0k\geq k_0 and every ℓ∈{1,…,L}\ell\in\{1,\dots,L\},

XkL+ℓ=iℓ.X_{kL+\ell}=i_\ell.

The conjecture predicts eventual periodic traversal of a single random path; the preceding results establish this behavior in the complete-graph setting, while the general connected-graph case remains open.

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.