Skip to main content

Future Directions: Dynamic Graphs

  • Chapter
  • First Online:
Control of Complex Systems

Abstract

Graph theory provides a natural framework for studying relationships between the components of a physical system. In most cases, these relationships are described by assigning directions and constant numerical values (or weights) to each edge in the graph (e.g., Harary, 1969; Ford and Fulkerson, 1962). There are, however, a number of important applications where such a model fails to capture all the relevant characteristics of the system. This potential deficiency was recognized as early as the 1940s, in the context of social interactions within groups and organizations (Radcliffe-Brown, 1940). Since that time, there have been several systematic attempts to analyze graphs whose edges are subject to change. In the late 1950s, for example, Erdös and Rènyi (1959) introduced the notion of random graphs, whose edges and vertices are assigned weights that reflect their existence probabilities. A generic problem in this context has been to determine the probability that a graph will remain connected when some of its vertices and edges are randomly eliminated.

More recently, graphs with time-varying and state-dependent edges have been considered in the context of complex systems and connective stability (Šiljak, 1978). Such graphs were used to model uncertain connections between subsystems, and to determine conditions under which the overall system remains stable when certain subsystems are temporarily disconnected. Dynamically changing graphs were also examined in (Ladde and Šiljak, 1983), where stochastic models were used to analyze multi-controller schemes for reliability enhancement (in this case, graphs were used to represent states of a Markov process).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aldana, M., S. Coppersmith and L. Kadanoff (2003). Boolean dynamics with random couplings. In: E. Kaplan, J. Marsden and K. Sreenivasan (Eds.), Perspectives and Problems in Nonlinear Science, Springer, New York.

    Google Scholar 

  • Aziz-Alaoui, M. A. (2007). Emergent Properties in Natural and Artificial Dynamic Systems. Springer, Berlin.

    Google Scholar 

  • Chaves, M., E. D. Sontag and R. Albert (2006a). Methods of robustness analysis for Boolean models of gene control networks. IEE Proceedings: Systems Biology, 153, 154–167.

    Article  Google Scholar 

  • Chaves, M., E. Sontag and R. Albert (2006b). Structure and timescale analysis in genetic regulatory networks. Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, CA, 2358–2363.

    Google Scholar 

  • Chen, L. and K. Aihara (2002). Stability of genetic regulatory networks with time delay. IEEE Transactions on Circuits and Systems I, 49, 602–608.

    Google Scholar 

  • Chowdhury, D. and D. Stauffer (1999). A generalized spin model of financial markets. European Journal of Physics B – Condensed Matter and Complex Systems, 8, 477–482.

    Google Scholar 

  • Csermely, P. (2006). Weak Links: Stabilizers of Complex Systems from Proteins to Social Networks. Springer, Berlin.

    Google Scholar 

  • Davidson, E. (2006). The Regulatory Genome: Gene Regulatory Networks in Development and Evolution. Academic, New York.

    Google Scholar 

  • Dee, D. and M. Ghil (1984). Boolean difference equations I: Formulation and dynamic behavior. SIAM Journal of Applied Mathematics, 44, 111–126.

    Article  MATH  MathSciNet  Google Scholar 

  • Edwards, R., H. Siegelmann, K. Aziza and L. Glass (2001). Symbolic dynamics and computation of in model gene networks. Journal of Chaos, 11, 160–169.

    Article  Google Scholar 

  • Erdös, P. and A. Renyi (1959). On random graphs. Publicationes Mathematicae, 6, 290–297.

    MATH  Google Scholar 

  • Flake, G. (2000). The Computational Beauty of Nature. MIT Press, Boston, MA.

    Google Scholar 

  • Ford, I. and D. Fulkerson (1962). Flows in Networks. Princeton University Press, Princeton, NJ.

    MATH  Google Scholar 

  • Garson, J. (1998). Chaotic emergence and the language of thought. Philosophical Psychology, 11, 303–315.

    Article  Google Scholar 

  • Ghil, M. and A. Mullhaupt (1985). Boolean delay equations II: Periodic and aperiodic solutions. Journal of Statistical Physics, 41, 125–173.

    Article  MATH  MathSciNet  Google Scholar 

  • Ghil, M., I. Zaliapin and B. Coluzzi (2008). Boolean delay equations: A simple way of looking at complex systems. Physica D, 237, 2967–2986.

    Article  MATH  MathSciNet  Google Scholar 

  • Glass, L. (1975). Classification of biological networks by their qualitative dynamics. Journal of Theoretical Biology, 54, 85–107.

    Article  Google Scholar 

  • Glass, L. and S. Kauffman (1973). The logical analysis of continuous nonlinear biochemical control networks. Journal of Theoretical Biology, 39, 103–129.

    Article  Google Scholar 

  • Graham, A. (1981). Kronecker Products and Matrix Calculus with Applications. Ellis Horwood, Chichester, UK.

    MATH  Google Scholar 

  • Guillemot, V., L. Le Brusquet, A. Tenenhaus and V. Frouin (2008). Graph-constrained discriminant analysis of functional genomics data. Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, Philadelphia, PA, 207–210.

    Google Scholar 

  • Harrary, F. (1969). Graph Theory. Addison-Wesley, Reading, MA.

    Google Scholar 

  • Hilborn, R. (1994). Chaos and Nonlinear Dynamics. Oxford University Press, Oxford, UK.

    MATH  Google Scholar 

  • Hirose, O., N. Nariai, H. Bannai, S. Imoto and S. Miyano (2005). Estimating gene networks from expression data and binding location data via Boolean networks. Proceedings of the International Conference on Computational Science and Its Applications, Singapore, 349–356.

    Google Scholar 

  • Isham, C. (1995). Lectures on Quantum Theory: Mathematical and Structural Foundations. Imperial College Press, London, UK.

    MATH  Google Scholar 

  • Jaimoukha, I. and E. Kasenally (1994). Krylov subspace methods for solving large Lyapunov equations. SIAM Journal on Numerical Analysis, 31, 227–251.

    Article  MATH  MathSciNet  Google Scholar 

  • Jensen, H. (1998). Self-Organized Criticality. Cambridge University Press, Cambridge, UK.

    MATH  Google Scholar 

  • Kalman, R. E., P. L. Falb and M. A. Arbib (1969). Topics in Mathematical System Theory. McGraw-Hill, New York.

    MATH  Google Scholar 

  • Kauffman, S. (1969). Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of Theoretical Biology, 22, 437–467.

    Article  MathSciNet  Google Scholar 

  • Kauffman, S. (1993). The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, Oxford, UK.

    Google Scholar 

  • Kauffman, S. (1995). At Home in the Universe: The Search for Laws of Self-organization and Complexity. Oxford University Press, Oxford, UK.

    Google Scholar 

  • Kazmi, S. A., Kim, Y. -A., B. Pei, N. Ravi, D. Rowe, H. -W. Wang, A. Wong and D. -G. Shin (2008). Meta analysis of microarray data using gene regulation pathways. Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, Philadelphia, PA, 37–42.

    Google Scholar 

  • Khalil, E. (1995). Nonlinear thermodynamics and social science modeling – fad cycles, cultural development, and identification slips. American Journal of Economics and Sociology, 54, 423–438.

    Article  Google Scholar 

  • Khalil, H. (2001). Nonlinear Systems. Prentice-Hall, Upper Saddle River, NJ.

    Google Scholar 

  • Kobayashi, T., L. Chen and K. Akihara (2003). Modeling genetic switches with positive feedback loops. Journal of Theoretical Biology, 221, 379–399.

    Article  MathSciNet  Google Scholar 

  • Kupper, Z. and H. Hoffmann (1996). Logical attractors: A Boolean approach to the dynamics of psychosis. In: W. Sullis and A. Combs (Eds.), Nonlinear Dynamics in Human Behavior, World Scientific, New York.

    Google Scholar 

  • Ladde, G. and D. D. Šiljak (1983). Multiplex control systems: Stochastic stability and dynamic reliability. International Journal of Control, 38, 514–524.

    Article  Google Scholar 

  • Mathai, P., N. Martins and B. Shapiro (2007). On the detection of gene network interconnections using directed mutual information. Proceedings of the Information Theory and Applications Workshop, San Diego, CA, 274–283.

    Google Scholar 

  • Mehta, D. P. and S. Sahni (2005). Handbook of Data Structures and Applications. Chapman Hill/CRC, Boca Raton, FL.

    MATH  Google Scholar 

  • Ming-Yang, K. (2008). Encyclopedia of Algorithms. Springer, Berlin.

    MATH  Google Scholar 

  • Norrell, J. and J. Socolar (2009). Boolean modeling of collective effects in complex networks. Physical Review E – Statistical, Nonlinear, and Soft Matter Physics, 79, Article number 061908.

    Google Scholar 

  • Norrell, J., B. Samuelsson and J. Socolar (2007). Attractors in continuous and Boolean networks. Physical Review E – Statistical, Nonlinear, and Soft Matter Physics, 76, Article number 046122.

    Google Scholar 

  • Öktem, H. (2008). Dynamic information handling in continuous time Boolean Network model of gene interactions. Nonlinear Analysis: Hybrid Systems, 2, 900–912.

    Article  MathSciNet  Google Scholar 

  • Öktem, H., R. Pearson and K. Egiazarian (2003). An adjustable aperiodic model class of genomic interactions using continuous time Boolean networks. Chaos, 13, 1167–1175.

    Article  MATH  MathSciNet  Google Scholar 

  • Radcliffe-Brown, A. (1940). On social structure. Journal of the Royal Anthropological Institute of Great Britain and Ireland, 70, 1–12.

    Article  Google Scholar 

  • Re, A., I. Molineris and M. Caselle (2008). Graph theory analysis of genomics problems: Community analysis of fragile sites correlations and of pseudogenes alignments. Computers and Mathematics with Applications, 55, 1034–1043.

    Article  MATH  MathSciNet  Google Scholar 

  • Serra, R., M. Villani and A. Salvemini (2001). Continuous genetic networks. Parallel Computing, 27, 663–683.

    Article  MATH  MathSciNet  Google Scholar 

  • Serra, R., M. Villani, C. Damiani, A. Graudenzi and A. Colacci (2008). The diffusion of perturbations in a model of coupled random Boolean networks. Proceedings of the 8th International Conference on Cellular Automata for Research and Industry (ACRI), Yokohama, Japan, 315–322.

    Google Scholar 

  • Šiljak, D. D. (1978). Large-Scale Dynamic Systems: Stability and Structure. North Holland, New York.

    MATH  Google Scholar 

  • Šiljak, D. D. (1989). Parameter space methods for robust control: A guided tour. IEEE Transactions on Automatic Control, 34, 674–688.

    Article  MATH  Google Scholar 

  • Šiljak, D. D. and D. M. Stipanović (2000). Robust stabilization of nonlinear systems: The LMI approach. Mathematical Problems in Engineering, 6, 461–493.

    Article  MATH  Google Scholar 

  • Šiljak, D. D. (2008). Dynamic graphs. Nonlinear Analysis: Hybrid Systems, 2, 544–567.

    MATH  MathSciNet  Google Scholar 

  • Sontag, E. D. (1990). Mathematical Control Theory: Deterministic Finite Dimensional Systems. Springer, New York.

    MATH  Google Scholar 

  • Weigel, D. and C. Murray (2000). The paradox of stability and change in relationships: What does chaos theory offer for the study of romantic relationships? Journal of Social and Personal Relationships, 17, 425–449.

    Article  Google Scholar 

  • Wu, J., Y. Hong and G. Shi (2008). Multi-agent coordination of networked mobile agents with hierarchical dynamic graph. Proceedings of the 7th World Congress on Intelligent Control and Automation, Chongqing, China, 8239–8244.

    Google Scholar 

  • Zečević, A. I. and D. D. Šiljak (2010a). Control of dynamic graphs. SICE Journal of Control, Measurement and System Integration (to appear).

    Google Scholar 

  • Zečević, A. I. and D. D. Šiljak (2010b). Dynamic graphs and continuous Boolean networks I: A hybrid model for gene regulation. Nonlinear Analysis: Hybrid Systems (to appear).

    Google Scholar 

  • Zečević, A. I. and D. D. Šiljak (2010c). Dynamic graphs and continuous Boolean networks II: Large-scale organic structures. Nonlinear Analysis: Hybrid Systems (to appear).

    Google Scholar 

  • Google Scholar 

  • Google Scholar 

  • Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aleksandar I. Zečević .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Zečević, A.I., Šiljak, D.D. (2010). Future Directions: Dynamic Graphs. In: Control of Complex Systems. Communications and Control Engineering. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1216-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-1216-9_6

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-1215-2

  • Online ISBN: 978-1-4419-1216-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics