Shortest Trajectories and Reversibility in Boolean Automata Networks
Mathilde Noual
TL;DR
This paper investigates the conditions under which shortest paths in Boolean automata networks require multiple state changes in individual automata, focusing on trajectory length and reversibility.
Contribution
It introduces criteria for when shortest trajectories necessitate multiple state changes, advancing understanding of automata network dynamics.
Findings
Shortest trajectories may involve multiple state changes per automaton.
Reversibility properties influence the complexity of shortest paths.
Conditions for minimal trajectory length are characterized.
Abstract
The question this research report explores is the following: when does a shortest trajectory between two configurations, or between one configuration and an attractor need to change several times the state of one automaton?
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGene Regulatory Network Analysis · DNA and Biological Computing · Cellular Automata and Applications