Deterministic walks with choice

DOI10.1016/j.dam.2013.08.031zbMath1300.05289DBLPjournals/dam/BeelerBCHB14OpenAlexW2097235811WikidataQ57423498 ScholiaQ57423498MaRDI QIDQ741725

Meagan N. Hunter, Joshua N. Cooper, Peter S. Barr, Kenneth S. Berenhaut, Katy E. Beeler

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.031

zbMATH Keywords

communicationcoveringCayley graphsmovementchoice functionsmemorydeterministic walkstoroidal grids

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Random walks on graphs (05C81)

Related Items (2)

The power of two choices for random walks ⋮ Symmetry in domination for hypergraphs with choice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linearly bounded liars, adaptive covering codes, and deterministic random walks
• The cover time of deterministic random walks
• Derandomizing random walks in undirected graphs using locally fair exploration strategies
• Cutoff phenomena for random walks on random regular graphs
• Choice functions over a finite set: A summary
• Goldbug variations
• Ideal structures of path independent choice functions
• Non-backtracking random walk
• Deterministic random walks on the integers
• Analysis of Random Walks Using Tabu Lists
• Random walks which prefer unvisited edges.
• Deterministic random walks on regular trees
• Simulating a Random Walk with Constant Error
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Deterministic Random Walks on the Two-Dimensional Grid
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• Walkers on the Cycle and the Grid
• Random walk with memory
• Greedy Random Walk
• Spherical asymptotics for the rotor-router model in $\mathbb{Z}^d$

This page was built for publication: Deterministic walks with choice