Traffic noise and maximum-flow spanning trees on growing and static networks

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Tadić, B., & Thurner, S. (2006). Traffic noise and maximum-flow spanning trees on growing and static networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3993 LNCS-III, pp. 1016–1023). Springer Verlag. https://doi.org/10.1007/11758532_139

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free