The stuck walk of Erschler, Tóth and Werner (2012) is a one-dimensional nearest-neighbour self-interacting random walk whose next-step bias is a fixed linear combination of the local times on the four edges nearest its current position. For , with decreasing to , the walk gets 'stuck': it is eventually confined to sites with positive probability, and the trapped local-time profile converges to an explicit deterministic -shaped vector. The authors left open whether localization on sites is almost sure (excluding larger traps), what happens at the critical parameters , whether the confined chain is positive recurrent with an invariant distribution, and how to extend the analysis to wider interaction ranges. Kious (2016) proved that localization on or sites is almost sure, and on exactly 3 sites for . This record asks for the completion: exclude the alternative for all , determine the behaviour at the critical parameters, establish positive recurrence and an invariant distribution for the confined chain, and prove precise trapping criteria for finite-range interactions beyond four edges.
Background
Self-interacting random walks are nearest-neighbour walks on the integer lattice whose transition probabilities depend on the whole past trajectory, typically through the local times of the edges or sites already visited; the local time of the unoriented edge (the edge connecting sites and ) counts how many times the walk has crossed that edge up to time . The best-studied example is the one-dimensional 'true' self-repelling walk (TSRW), which is pushed towards the less-visited of its two adjacent edges and has a non-trivial scaling limit. Erschler, Tóth and Werner introduced in the paper 'Stuck walks' (Probab. Theory Relat. Fields 154 (2012) 149–163) a one-parameter family that adds an attraction through the next-to-neighbouring edges: with a fixed and
the walk started at jumps from to with probability , where ; a positive 'stream' pushes the walker to the right, a negative one to the left. The choices and recover the TSRW with edge and with site repulsion; the companion survey 'Some locally self-interacting walks on the integers' by the same authors describes the expected phase diagram across all .
For the self-attraction can win and the walk becomes 'stuck'. Let denote the (possibly infinite) set of sites visited infinitely often, and define and for , a decreasing sequence with and . Erschler–Tóth–Werner proved that if then consists of consecutive sites with positive probability (an interval with interior sites and edges), and that on this event the normalized edge-local-time profile converges to an explicit deterministic vector following a curve. The proof combines a combinatorial 'stream control' lemma with a comparison to an auxiliary walk confined by force to the interval with the same transition rule. The phenomenon is reminiscent of the vertex-reinforced random walk (VRRW) on — a walk whose jump probabilities increase with the number of previous visits to the target site, which is also known to localize on finitely many sites — but the mechanism is different: no term here is monotone in the local times, and confinement emerges from the competition between repulsion and attraction.
In their concluding remarks the authors list the questions their first-order methods cannot settle. Kious ('Stuck walks: A conjecture of Erschler, Tóth and Werner', Ann. Probab. 44 (2016) 883–923) took up the most prominent one, reformulating it as the conjecture that for the walk localizes almost surely on exactly sites, and proved it partially: writing for the set of sites visited infinitely often, he showed almost surely under the same assumptions (Theorem 1.4) — in particular the walk localizes almost surely and traps of or more sites are excluded — and almost surely for (Theorem 1.5). A key tool is a variant of Rubin's construction, a coupling of reinforced random walks with stacks of exponential clocks, adapted to non-monotone effective weight functions. He states the belief that 'does not occur, as it corresponds to an unstable limiting behaviour', but leaves it unproved, and explicitly leaves the critical values and everything concerning finer fluctuations untouched. Positive recurrence — the property that a Markov chain returns to a state in finite expected time, which guarantees an invariant (stationary) distribution — of the confined chain defined in the problem statement remains conjectural.
Problem Statement
The problem is to complete the rigorous description of the trapping regime of the stuck walk defined above, for every including the critical parameters. Four linked questions remain open; together they form the common objective of determining which localization sizes occur almost surely, what happens at criticality, and how the trapped walk fluctuates around its deterministic profile.
-
Localization size. Prove, or disprove, that for every and every (equivalently ), the walk localizes on exactly sites almost surely; that is, that the event has probability zero. (The case , where , is already proved by Kious.) This is the surviving core of the question of Erschler–Tóth–Werner whether, whenever has positive probability, the probability of being eventually trapped on any strictly larger interval is zero.
-
Critical parameters. Determine the behaviour of the walk at : prove or disprove the heuristic that the walk is then almost surely not stuck on sites (the boundary streams and of the limiting profile vanish, so a confined walk should eventually escape), and decide whether the walk can be stuck on sites — or any other finite number of sites — with positive probability at criticality.
-
Fluctuations and stationary measure. For the auxiliary walk confined by force to with the same dynamics (defined, as in the source paper, for ), in the regime where visits all sites of the interval infinitely often, prove or disprove that the Markov chain , where is the centered local-time profile, is positive recurrent and admits an invariant distribution. This would upgrade the law of large numbers for the trapped profile to a genuine fluctuation theory.
-
Wider interaction range. For the generalized dynamics in which is replaced by a linear combination involving local times at more than four edges, establish precise criteria on the coefficients (in terms of the roots of the associated polynomial, i.e. of the corresponding generalized Fibonacci recurrence) under which trapping on finitely many sites occurs with positive probability.
The objective is to determine, for every including the critical parameters, the localization phase diagram of the model and the fluctuation structure of the confined chain, without restricting the parameter range, the interaction, or the conventions of the model.
References
- Anna Erschler, Bálint Tóth, Wendelin Werner, 'Stuck walks', Probability Theory and Related Fields 154 (2012) 149–163. DOI: 10.1007/s00440-011-0365-4, https://doi.org/10.1007/s00440-011-0365-4 (also arXiv:1011.1103, https://arxiv.org/abs/1011.1103)
- Daniel Kious, 'Stuck walks: A conjecture of Erschler, Tóth and Werner', The Annals of Probability 44 (2016) 883–923. DOI: 10.1214/14-AOP991, https://doi.org/10.1214/14-AOP991 (also arXiv:1309.1586, https://arxiv.org/abs/1309.1586)
- Anna Erschler, Bálint Tóth, Wendelin Werner, 'Some locally self-interacting walks on the integers', in: Probability in Complex Physical Systems, Springer Proceedings in Mathematics 11, Springer (2012) 313–338. DOI: 10.1007/978-3-642-23811-6_13, https://doi.org/10.1007/978-3-642-23811-6_13 (also arXiv:1011.1102, https://arxiv.org/abs/1011.1102)
- Anne-Laure Basdevant, Bruno Schapira, Arvind Singh, 'Localization of a vertex reinforced random walk on Z with sub-linear weight', Probability Theory and Related Fields 159 (2014) 75–115. DOI: 10.1007/s00440-013-0502-3, https://doi.org/10.1007/s00440-013-0502-3
- Yuval Peres, Bruno Schapira, Perla Sousi, 'Martingale defocusing and transience of a self-interacting random walk', Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 52 (2016) 1009–1022. DOI: 10.1214/14-AIHP667, https://doi.org/10.1214/14-AIHP667 (also arXiv:1403.1571, https://arxiv.org/abs/1403.1571)
- Bruno Schapira, 'A 0–1 law for vertex-reinforced random walks on Z with weight of order k^α, α ∈ [0, 1/2)', Electronic Communications in Probability 17 (2012). DOI: 10.1214/ECP.v17-2084, https://doi.org/10.1214/ECP.v17-2084
- Rosemary J. Harris, 'Random walkers with extreme value memory: modelling the peak-end rule', New Journal of Physics 17 (2015) 053049. DOI: 10.1088/1367-2630/17/5/053049, https://doi.org/10.1088/1367-2630/17/5/053049
- Francesco Coghi, Juan P. Garrahan, 'Level 2.5 large deviations and uncertainty relations for self-interacting jump processes: tilting constructions and the emergence of time-scale separation' (2026), arXiv:2603.19411, https://arxiv.org/abs/2603.19411