Traffic Noise and Maximum-Flow Spanning Trees on Growing and Static Networks

  • Bosiljka Tadić
  • Stefan Thurner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3993)


Properties of traffic noise and flow are often measured on complex networks and are used to diagnose the network’s functional state and underlying structure, even though the precise structure–function interdependences are often unknown. Here we attempt to unravel some basic interdependences between structure and traffic on networks in numerically controlled traffic models. We simulate constant-density traffic on two different network topologies, which emerge from the same preferential rewiring rules but one within growth and the other under static conditions. We determine universal noise properties and the maximal-flow spanning trees on these classes of network topologies. We study both low-density traffic (structure dependences) and high-density traffic, where queuing influences transport properties.


Span Tree Network Topology Queue Length Preferential Attachment Traffic Noise 
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.


  1. 1.
    Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 46, 167–225 (2003)CrossRefGoogle Scholar
  2. 2.
    Boccaleti, S., Latora, V., et al.: Complex Networks: Structure and Dynamics. Physics Reports 424, 175–306 (2006)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Guimera, R., Diaz-Guilera, A., Vega-Redondo, F., Cabrales, A., Arenas, A.: Optimal network topologies for local search with congestion. Phys. Rev. Lett. 86, 3196–3199 (2001)CrossRefGoogle Scholar
  4. 4.
    Kaneko, K.: On recursive production and evolvability of cells: Catalytic reaction network approach. In: Toda, M., et al. (eds.) Geometric Structures of Phase Space in Multidimensional Chaos: A Special Volume of Advances in Chemical Physics, Part B, ch. 27, 103, pp. 543–598 (2005)Google Scholar
  5. 5.
    Tadić, B., Thurner, S.: Information Super-Diffusion on Structured Networks. Physica A 332, 566–584 (2004) cond-mat/0307670CrossRefMathSciNetGoogle Scholar
  6. 6.
    Tadić, B., Rodgers, G.J.: Packet transport on scale-free networks. Advances in Complex Systems 5, 445–456 (2002)CrossRefGoogle Scholar
  7. 7.
    Tadić, B., Thurner, T., Rodgers, G.J.: Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations. Phys. Rev. E 69, 036102 (2004)CrossRefGoogle Scholar
  8. 8.
    Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks: From Biology to the Internet and the WWW, ch. 27, p. 543. Oxford University Press, Oxford (2003)Google Scholar
  9. 9.
    Tadić, B.: Dynamics of directed graphs: the world-wide Web. Physica A 293, 273–284 (2001)MATHCrossRefGoogle Scholar
  10. 10.
    Tadić, B.: Modeling Traffic of Information Packets on Graphs with Complex Topology. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2657, pp. 136–146. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Bollobás, B.: Modern Graph Theory. Springer, New York (1998)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bosiljka Tadić
    • 1
  • Stefan Thurner
    • 2
  1. 1.Department for Theoretical PhysicsJožef Stefan InstituteLjubljanaSlovenia
  2. 2.Complex Systems Research Group, HNOMedical University of ViennaViennaAustria

Personalised recommendations