A combinatorial result with applications to self-interacting random walks
Probability
2012-05-11 v2
Abstract
We give a series of combinatorial results that can be obtained from any two collections (both indexed by ) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting random walk couplings, these allow us to reprove some known transience and recurrence results for some simple models. We also obtain new results for one-dimensional multi-excited random walks and for random walks in random environments in all dimensions.
Cite
@article{arxiv.1105.5157,
title = {A combinatorial result with applications to self-interacting random walks},
author = {Mark Holmes and Thomas S. Salisbury},
journal= {arXiv preprint arXiv:1105.5157},
year = {2012}
}