Infinite excursions of router walks on regular trees

zbMATH Open1361.05121arXiv1511.05896MaRDI QIDQ528998FDOQ528998

Authors: Tal Orenshtein, Sebastian Müller 

Publication date: 18 May 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a deterministic process: at each step it chooses the next unused rotor in its current location, and uses it to jump to the neighboring vertex to which it points. Rotor walks capture many aspects of the expected behavior of simple random walks. However, this similarity breaks down for the property of having an infinite excursion. In this paper we study that question for natural random configuration models on regular trees. Our results suggest that in this context the rotor model behaves like the simple random walk unless it is not "close to" the standard rotor-router model.

Full work available at URL: https://arxiv.org/abs/1511.05896

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Rotor walks on general trees
• The rotor-router model on regular trees
• Rotor-routing on Galton-Watson trees
• Recurrent rotor-router configurations
• Deterministic Random Walks on Regular Trees

zbMATH Keywords

recurrencetransiencemulti-type branching processregular treerouter walkself interacting walk

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Cites Work

• Title not available (Why is that?)
• A problem of arrangements
• Non-negative matrices and Markov chains.
• Simulating a Random Walk with Constant Error
• Rotor walks and Markov chains
• Chip-Firing and Rotor-Routing on Directed Graphs
• The rotor-router model on regular trees
• Fast simulation of large-scale growth models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Excited random walk
• On the speed of a cookie random walk
• First Passage and Recurrence Distributions
• Positively and negatively excited random walks on integers, with branching processes
• Goldbug variations
• Title not available (Why is that?)
• Transience and recurrence of rotor-router walks on directed covers of graphs
• Excited random walks: results, methods, open problems
• Recurrence and transience of a multi-excited random walk on a regular tree
• Recurrent rotor-router configurations
• Euler walk on a Cayley tree
• Rotor-routing on Galton-Watson trees
• Rotor walks on general trees
• Escape rates for rotor walks in \(\mathbb{Z}^d\)
• Zero-one law for directional transience of one dimensional excited random walks
• Excited mob

Cited In (4)

• Local-to-global principles for the hitting sequence of a rotor walk
• Rotor walks on general trees
• Recurrent rotor-router configurations
• The rotor-router model on regular trees

This page was built for publication: Infinite excursions of router walks on regular trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528998)