Monotonicity conjecture for the speed of once-reinforced walk on regular trees

Let dd be fixed, and consider the once-reinforced walk on a dd-regular tree with forward-edge weights u0u_0 before reinforcement and u1u_1 after reinforcement. Monotonicity conjecture. The speed given in the cited speed theorem is monotone increasing in both u1u_1 and u0u_0, and is strictly monotone in the transient regime. The conjecture concerns how the asymptotic speed depends on the two reinforcement weights on regular trees; the source provides no resolution of this expectation.

Sources & referencesView supporting material

Primary source

Andrea Collevecchio, Mark Holmes and Daniel Kious, “On the speed of once-reinforced biased random walk on trees”, arXiv:1702.01982 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.