Fixed points and 2-cycles of synchronous dynamic coloring processes on trees
From MaRDI portal
Publication:2097353
DOI10.1007/978-3-031-09993-9_15OpenAlexW4285284282MaRDI QIDQ2097353
Publication date: 11 November 2022
Full work available at URL: https://arxiv.org/abs/2202.01580
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Stochastic minority on graphs
- Maximum number of fixed points in regulatory Boolean networks
- The number of fixed points of the majority rule
- Periodic behaviour of generalized threshold functions
- Local majorities, coalitions and monopolies in graphs: A review
- Transient length in sequential iteration of threshold functions
- On periodical behaviour in societies with symmetric influences
- Improving the efficiency of attractor cycle identification in Boolean networks
- On the computation of fixed points in Boolean networks
- Convergence in (Social) Influence Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fixed points and 2-cycles of synchronous dynamic coloring processes on trees