×

A combinatorial result with applications to self-interacting random walks. (English) Zbl 1232.60055

Summary: We give a series of combinatorial results that can be obtained from any two collections (both indexed by \(\mathbb Z\times \mathbb N\)) 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.

MSC:

60K37 Processes in random environments
05A99 Enumerative combinatorics
05C82 Small world graphs, complex networks (graph-theoretic aspects)

References:

[1] Benjamini, I.; Wilson, D. B., Excited random walk, Electron. Comm. Probab., 8, 86-92 (2003) · Zbl 1060.60043
[2] Bérard, J.; Ramírez, A., Central limit theorem for excited random walk in dimension \(d \geqslant 2\), Electron. Comm. Probab., 12, 300-314 (2007) · Zbl 1128.60082
[3] van der Hofstad, R.; Holmes, M., Monotonicity for excited random walk in high dimensions, Probab. Theory Related Fields, 147, 333-348 (2010) · Zbl 1193.60123
[4] M. Holmes, T. Salisbury, Random walks in degenerate random environments, preprint, 2010.; M. Holmes, T. Salisbury, Random walks in degenerate random environments, preprint, 2010. · Zbl 1310.60144
[5] Kosygina, E.; Zerner, M., Positively and negatively excited random walks on integers, with branching processes, Electron. J. Probab., 13, 1952-1979 (2008) · Zbl 1191.60113
[6] Zerner, M., Multi-excited random walks on integers, Probab. Theory Related Fields, 133, 98-122 (2005) · Zbl 1076.60088
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.