Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs

DOI10.1016/j.tcs.2015.02.035zbMath1311.05139arXiv1102.1440OpenAlexW2964249223MaRDI QIDQ2344774

Gabriel I. Istrate

Publication date: 18 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

reachabilitydiscrete complex systemsLights-Out games

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Games on graphs (graph-theoretic aspects) (05C57) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random Lights Out processes on graphs
• Graphs whose neighborhoods have no special cycles
• Social balance on networks: the dynamics of friendship and enmity
• Computational mechanics of cellular automata: an example
• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
• A randomised 3-colouring algorithm
• Flux and fixation in cyclic particle systems
• Additive and cancellative interacting particle systems
• On a modular domination game.
• Linear cellular automata and the garden-of-eden
• Asymptotic density in a threshold coalescing and annihilating random walk
• Stochastic dynamics on hypergraphs and the spatial majority rule model
• Hypergraph Coloring Games and Voter Models
• Finite particle systems and infection models
• On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)
• Structure and importance of logspace-MOD class
• A Random Recolouring Method for Graphs and Hypergraphs
• Reliable cellular automata with self-organization

This page was built for publication: Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs