English

Stuck walks: A conjecture of Erschler, T\'oth and Werner

Probability 2016-03-16 v3

Abstract

In this paper, we work on a class of self-interacting nearest neighbor random walks, introduced in [Probab. Theory Related Fields 154 (2012) 149-163], for which there is competition between repulsion of neighboring edges and attraction of next-to-neighboring edges. Erschler, T\'{o}th and Werner proved in [Probab. Theory Related Fields 154 (2012) 149-163] that, for any L1L\ge1, if the parameter α\alpha belongs to a certain interval (αL+1,αL)(\alpha_{L+1},\alpha_L), then such random walks localize on L+2L+2 sites with positive probability. They also conjectured that this is the almost sure behavior. We prove this conjecture partially, stating that the walk localizes on L+2L+2 or L+3L+3 sites almost surely, under the same assumptions. We also prove that, if α(1,+)=(α2,α1)\alpha\in(1,+\infty)=(\alpha_2,\alpha_1), then the walk localizes a.s. on 33 sites.

Keywords

Cite

@article{arxiv.1309.1586,
  title  = {Stuck walks: A conjecture of Erschler, T\'oth and Werner},
  author = {Daniel Kious},
  journal= {arXiv preprint arXiv:1309.1586},
  year   = {2016}
}

Comments

Published at http://dx.doi.org/10.1214/14-AOP991 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)