Abstract
Within the numerical model proposed in [1] we study the flow of information on a graph with power-law organization of links and an emergent superstructure formed by two highly interconnected hubs. The local search algorithms which navigate transport at each node can use information in the range of zero, one, and two-nearest neighbourhood of the node. We show how the flow carried by a particular link is distributed over graph when range of guided search and posting rate of packets are varied. The probability density function of the flow is given by a universal log-normal law, which is determined by the overall packet density in the stationary traffic. However, the distribution becomes unstable when the traffic experiences temporary or permanent jamming.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Tadić, B., Thurner, S.: Information Super-Diffusion on Structured Networks. Physica A 332, 566–584 (2004)
Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 46, 167–225 (2003)
Zhou, H.: Network landscape from a Brownian particle’s perspective. Phys. Rev. E 67, 41908 (2003)
Arenas, A., Danon, L., Dıaz-Guilera, A., Gleiser, P.M., Guimerà, R.: Community analysis in social networks. Europ. Phys. J. B (in press)
Tadić, B., Rodgers, G.J.: Packet transport on scale-free networks. Advances in Complex Systems 5, 445–456 (2002)
Tadić, B.: Adaptive random walks on the class of Web graphs. European Physical Journal B 23, 221–228 (2001)
Tadić, B.: Dynamics of directed graphs: the world-wideWeb. Physica A 293, 273–284 (2001)
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)
Tadić, B.: Temporal fractal structures: origin of power laws in the world-wide Web. Physica A 314, 278–283 (2002)
Tadić, B.: Modeling Traffic of Information Packets on Graphs with Complex Topology. In: Sloot, P., et al. (eds.) Proceedings ICCS 2003. Lecture Notes in Computer Science, Part I, vol. 2567, pp. 136–142. Springer, Berlin (2003)
Tadić, B.: Exploring Complex Graphs by Random Walks. In: Garrido, P.L., Marro, J. (eds.) Proceedings of The Granada Seminar on Computational Physics “Modeling Complex Systems” AIP Conference Proceedings, vol. 661, pp. 24–27 (2002)
Albert, R., Barabasi, A.-L.: Statistical Mechanics of Complex Networks. Reviews Mod. Phys. 74, 47–101 (2002)
Tadić, B., Thurner, T., Rodgers, G.J.: Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations. Phys. Rev. E (in press)
Bollobás, B.: Modern Graph Theory. Springer, New York (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tadić, B. (2004). Guided Search and Distribution of Information Flow on Complex Graphs. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24688-6_140
Download citation
DOI: https://doi.org/10.1007/978-3-540-24688-6_140
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22116-6
Online ISBN: 978-3-540-24688-6
eBook Packages: Springer Book Archive