Abstract
Using the framework of sequential dynamical systems (SDSs), a class of asynchronous graph dynamical systems, we show how the notions of reachability and stability can be negatively correlated. Specifically, we show that certain threshold SDSs exhibit update sequence instability: Over certain graph classes, there exist initial configurations from where exponentially many fixed points are reachable under different update sequences, i.e., the ω-limit set has size Θ(2|V|). We establish this first for treewidth bounded graphs and then for random graphs in the G(n,p) model of Erdős-Rényi for a large range of p. We also show that this update sequence instability is not present in dense graphs, suggesting that sparsity and tree-like structure plays an important role in the stability of the system. These dynamical systems arise in applications such as functional gene annotation, where threshold SDSs are employed to predict gene functions through a fixed point computation, based on an initial state (prediction) and a nongeneric choice of update sequence. The results in this paper should be viewed as cautionary advice in the construction and application of such algorithms. This paper also provides a starting point for a study of update sequence stochastic SDSs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Newman, M.: The structure and function of complex networks. SIAM Review 4 (2003)
Ilachinski, A.: Cellular Automata: A Discrete Universe. World Scientific Publishing Company, Cambridge (2001)
Barrett, C.L., Hunt III, H.B., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: Reachability problems for sequential dynamical systems with threshold functions. Theor. Comput. Sci. 295, 41–64 (2003)
Barrett, C.L., Mortveit, H.S., Reidys, C.M.: Elements of a theory of simulation III, equivalence of sds. Applied Mathematics and Computation 122, 325–340 (2001)
Mortveit, H.S.: Sequential Dynamical Systems. PhD thesis, Norwegian University of Science and Technology (2000)
Mortveit, H.S., Reidys, C.M.: An Introduction to Sequential Dynamical Systems. Universitext. Springer, Heidelberg (2007)
Korniss, G., Novotny, M.A., Guclu, H., Toroczkai, Z., Rikvold, P.A.: Suppressing roughness of virtual times in parallel discrete-event simulations. Science 299, 677–679 (2003)
Besag, J.: On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society – Series B 48, 259–302 (1986)
Karaoz, U., Murali, T., Letovsky, S., Zheng, Y., Ding, C., Cantor, C.R., Kasif, S.: Whole-genome annotation by using evidence integration in functional-linkage networks. In: Proceedings of the National Academy of Sciences, vol. 101, pp. 2888–2893 (2004)
Gillespie, D.T.: Exact stochastic simulation of coupled chemical reacitions. Journal of Physical Chemistry 81, 2340–2361 (1977)
Alon, N., Spencer, J.: The Probabilistic Method. Wiley, Chichester (2000)
Yamaguchi, A., Aoki, K., Mamitsuka, H.: Graph complexity of chemical compounds in biological pathways. Genome Informatics 14, 376–377 (2003)
Atkins, K., Chen, J., Kumar, V.S.A., Marathe, A.: Structural properties of electrical networks. International Journal of Critical Infrastructure (2007)
Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–22 (1993)
Barrett, C.L., Hunt III, H.B., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: On some special classes of sequential dynamical systems. Annals of Combinatorics 7, 381–408 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, V.S.A., Macauley, M., Mortveit, H.S. (2009). Limit Set Reachability in Asynchronous Graph Dynamical Systems . In: Bournez, O., Potapov, I. (eds) Reachability Problems. RP 2009. Lecture Notes in Computer Science, vol 5797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04420-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-04420-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04419-9
Online ISBN: 978-3-642-04420-5
eBook Packages: Computer ScienceComputer Science (R0)