Random Lights Out processes on graphs

DOI10.1016/j.aam.2013.03.002zbMath1280.05085OpenAlexW2042185700MaRDI QIDQ394801

Jacob Hughes

Publication date: 27 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.aam.2013.03.002

zbMATH Keywords

random processLights OutSutner's \(\sigma^+\) game

Mathematics Subject Classification ID

Games involving graphs (91A43) Processes in random environments (60K37) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Solutions to all-colors problem on graph cellular automata ⋮ Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Lights-Out-puzzle: parity-state graphs
• Lights Out on finite graphs
• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
• Parity dimension for graphs
• Linear cellular automata and the garden-of-eden
• \(\sigma\)-Automata and Chebyshev-polynomials
• Lit-only sigma game on a line graph
• Hitting times for random walks on vertex-transitive graphs
• Characterizing switch-setting problems^∗
• Parity Dimension for Graphs - A Linear Algebraic Approach

This page was built for publication: Random Lights Out processes on graphs