Infinite excursions of router walks on regular trees

MaRDI QIDQ528998zbMATHFDO

Authors 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

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

zbMATH Keywords

recurrencetransiencemulti-type branching processregular treerouter walkself interacting walk

Mathematics Subject Classification ID

Random walks on graphs (05C81)

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.

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

Cites work

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

Cited in

(7)

• Infinite-step stationarity of rotor walk and the wired spanning forest
• Recurrent rotor-router configurations
• The rotor-router model on regular trees
• Spiral structures in the rotor-router walk
• Local-to-global principles for the hitting sequence of a rotor walk
• Rotor walks on general trees
• A rotor configuration with maximum escape rate

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)