Stationary measures and phase transition for a class of probabilistic cellular automata.
Paolo Dai PraPierre-Yves LouisSylvie RoellyPublished in: CoRR (2016)
Keyphrases
- dynamical systems
- cellular automata
- phase transition
- discrete dynamical systems
- cellular automaton
- satisfiability problem
- cellular automata model
- randomly generated
- hard problems
- graph coloring
- traffic flow
- pattern formation
- np complete
- random instances
- cellular automaton model
- random graphs
- sat problem
- random constraint satisfaction problems
- galois field
- lattice gas
- chaotic dynamics
- path planner
- sat instances
- pattern matching