Infinite excursions of router walks on regular trees
From MaRDI portal
Publication:528998
zbMath1361.05121arXiv1511.05896MaRDI QIDQ528998
Tal Orenshtein, Sebastian Müller
Publication date: 18 May 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05896
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transience and recurrence of rotor-router walks on directed covers of graphs
- Excited mob
- On the speed of a cookie random walk
- The rotor-router model on regular trees
- Positively and negatively excited random walks on integers, with branching processes
- Recurrence and transience of a multi-excited random walk on a regular tree
- Excited random walk
- Goldbug variations
- Recurrent rotor-router configurations
- Euler walk on a Cayley tree
- Non-negative matrices and Markov chains.
- Rotor-routing on Galton-Watson trees
- A problem of arrangements
- Rotor Walks and Markov Chains
- Fast Simulation of Large-Scale Growth Models
- Rotor Walks on General Trees
- Simulating a Random Walk with Constant Error
- Chip-Firing and Rotor-Routing on Directed Graphs
- Escape Rates for Rotor Walks in $\mathbb{Z}^d$
- Excited random walks: results, methods, open problems
- First Passage and Recurrence Distributions
- Zero-one law for directional transience of one dimensional excited random walks
This page was built for publication: Infinite excursions of router walks on regular trees
