Path formation conjecture for vertex-reinforced non-backtracking random walks
Statement
Let be a vertex-reinforced non-backtracking random walk on a connected finite undirected graph, with reinforcement function . Let be a random path as in Proposition 0.1, and let denote its length. Path formation conjecture. If , then almost surely there exist such a path and such that, for every and every ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.