The theory of dynamical networks is concerned with systems of dynamical units coupled according to an underlying graph structure. It therefore investigates the interplay between dynamics and structure, between the temporal processes going on at the individual units and the static spatial structure linking them. In order to analyse that spatial structure, formalized as a graph, we discuss an essentially complete system of graph invariants, the spectrum of the graph Laplacian, and how it relates to various qualitative properties of the graph. We also describe various stochastic construction schemes for graphs with certain qualitative features. We then turn to dynamical aspects and discuss systems of oscillators with diffusive coupling according to the graph Laplacian and analyse their synchronizability. The analytical tool here are local expansions in terms of eigenmodes of the graph Laplacian. This is viewed as a first step towards a general understanding of pattern formation in systems of coupled oscillators.


Dynamical Network Random Graph Regular Graph Dynamical Rule Complete Subgraph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Atay F, Biyikoglu T, Jost J (2006) On the synchronization of networks with prescribed degree distributions. IEEE Transactions on Circuits and Systems I-Regular Papers Vol 53 (1):92–98.CrossRefGoogle Scholar
  2. 2.
    Atay F, Jost J (2004) On the emergence of complex systems on the basis of the coordination of complex behaviors of their elements:synchronization and complexity. Complexity 10:17–22.CrossRefGoogle Scholar
  3. 3.
    Atay F, Jost J, Wende A (2004) Delays, connection topology, and synchronization of coupled chaotic maps. Phys Rev Lett 92:144101–144104.CrossRefGoogle Scholar
  4. 4.
    Barabasi A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512.CrossRefGoogle Scholar
  5. 5.
    Bender E, Canfield E (1978) The asymptotic number of labeled graphs with given degree sequences. J Comb Th A 24:296–307.zbMATHCrossRefGoogle Scholar
  6. 6.
    Blanchard P, Krüger T (2004) The “Cameo” principle and the origin of scalefree graphs in social networks. J Stat Phys 114:1399–1416.zbMATHCrossRefGoogle Scholar
  7. 7.
    Chen YH, Rangarajan G, Ding MZ (2003) General stability analysis of synchronized dynamics in coupled systems. Phys Rev E 67:26209–26212.CrossRefGoogle Scholar
  8. 8.
    Chung F (1997) Spectral graph theory. Regional Conference Series in Mathematics 92, Amer Math Soc, Providence.Google Scholar
  9. 9.
    Leader I (1991) Discrete isoperimetric inequalities. In:Bollobás B (ed) Probabilistic Combinatorics and Its Applications. AMS.Google Scholar
  10. 10.
    Chung F, Lu L, Vu V (2003) Spectra of random graphs with given expected degrees. PNAS 100 (11):6313–6318.zbMATHCrossRefGoogle Scholar
  11. 11.
    Davidsen J, Ebel H, Bornholdt S (2002) Emergence of a small world from local interaction:modeling acquaintance networks. Phys Rev Lett 88:128701.CrossRefGoogle Scholar
  12. 12.
    Derényi I, Palla G, Vicsek T (2005) Clique percolation in random networks. Phys Rev Lett 94:160202.CrossRefGoogle Scholar
  13. 13.
    Erdös P, Rényi A (1959) On random graphs I. Publ Math Debrecen 6:290–291.Google Scholar
  14. 14.
    Girvan M, Newman M (2002) Community structure in social and biological networks. Proc Nat Acad Sci 99:7021–7026.CrossRefGoogle Scholar
  15. 15.
    Gladwell G, Davies EB, Leydold J, Stadler PF (2001) Discrete nodal domain theorems. Lin Alg Appl 336:51–60.zbMATHCrossRefGoogle Scholar
  16. 16.
    Jost J (2005) Dynamical Systems. Springer.Google Scholar
  17. 17.
    Jost J, Joy MP (2001) Spectral properties and synchronization in coupled map lattices. Phys Rev E 65:16201–16209.CrossRefGoogle Scholar
  18. 18.
    Jost J, Joy MP (2002) Evolving networks with distance preferences. Phys Rev E 66:36126–36132.CrossRefGoogle Scholar
  19. 19.
    Kleinberg J (1999) The web as a graph:measurements, methods, and models. In:Lecture Notes in Computer Science. Springer, New York.Google Scholar
  20. 20.
    Klemm K, Eguíluz VM (2002) Growing scale-free networks with small-world behavior. Phys Rev E 65:057102.CrossRefGoogle Scholar
  21. 21.
    Klemm K, Eguíluz VM (2002) Highly clustered scale-free networks. Phys Rev E 65:036123.CrossRefGoogle Scholar
  22. 22.
    Lu WL (2005) Chaos synchronization in coupled map networks via time varying topology. Preprint MPIMIS.Google Scholar
  23. 23.
    Lu WL, Chen TP (2004) Synchronization analysis of linearly coupled map networks with discrete time systems. Physica D 198:148–168.zbMATHCrossRefGoogle Scholar
  24. 24.
    Newman M (2002) Random graphs as models of networks. In:Bornholdt S, Schuster HG (eds) Handbook of Graphs and Networks. Wiley-VCH, Berlin.Google Scholar
  25. 25.
    Newman M (2003) The structure and function of complex networks. SIAM Rev 45 (2):167–256.zbMATHCrossRefGoogle Scholar
  26. 26.
    Pastor-Satorras R, Vazquez A, Vespignani A (2001) Dynamical and correlation properties of the internet. Phys Rev Lett 87:258701–4.CrossRefGoogle Scholar
  27. 27.
    Pikovsky A, Rosenblum M, Kurths J (2003) Synchronization:A Universal Concept in Nonlinear Sciences. Cambridge University Press, Cambridge.Google Scholar
  28. 28.
    Rangarajan G, Ding MZ (2002) Stability of synchronized chaos in coupled dynamical systems. Phys Lett A 296:204–212.zbMATHCrossRefGoogle Scholar
  29. 29.
    Simon H (1955) On a class of skew distribution functions. Biometrika 42:425–440.zbMATHGoogle Scholar
  30. 30.
    Vázquez A (2002) Growing networks with local rules:preferential attachment, clustering hierarchy and degree correlations. Phys Rev E 67:056104.CrossRefGoogle Scholar
  31. 31.
    Watts D, Strogatz S (1998) Collective dynamics of ‘small-world’ networks. Nature 393:440–442.CrossRefGoogle Scholar
  32. 32.
    Wu CW (2005) Synchronization in networks of nonlinear dynamical systems coupled via a directed graph. Nonlinearity 18:1057–1064.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer 2007

Authors and Affiliations

  • Jürgen Jost

There are no affiliations available

Personalised recommendations