Generalized ARRIVAL problem for rotor walks in path multigraphs

DOI10.1007/978-3-031-45286-4_14MaRDI QIDQ6623027zbMATH OpenFDO

Authors David Auger, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse

Publication date 23 October 2024

zbMATH Keywords

cellular automatadiscrete harmonic functionrotor walks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A distributed ant algorithm for efficiently patrolling a network
• ARRIVAL: a zero-player graph game in \(\text{NP}\cap \text{coNP}\)
• ARRIVAL: next stop in CLS
• Chip-Firing and Rotor-Routing on Directed Graphs
• Chip-firing games on directed graphs
• Chip-firing games on graphs
• CoEulerian graphs
• Rational base number systems for \(p\)-adic numbers
• Rotor walks and Markov chains
• The probabilistic abacus

This page was built for publication: Generalized ARRIVAL problem for rotor walks in path multigraphs

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