Traffic Noise and Maximum-Flow Spanning Trees on Growing and Static Networks
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.
KeywordsSpan Tree Network Topology Queue Length Preferential Attachment Traffic Noise
- 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
- 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