For strongly edge-reinforced random walk with a reciprocally summable weight function, does the walk on graphs containing odd cycles, in particular a triangle, eventually…
Statement
For strongly edge-reinforced random walk with a reciprocally summable weight function, does the walk on graphs containing odd cycles, in particular a triangle, eventually visit one random edge back and forth as it does on bounded-degree graphs without odd cycles?
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.