Abstract
We present an approach for analysing weighted networks based on maximum flows between nodes and generalize to weighted networks ‘global’ measures that are well-established for binary networks, such as pathlengths, component size or betweenness centrality. This leads to a generalization of the algorithm of Girvan and Newman for community identification. The application of the weighted network measures to two real-world example networks, the international trade network and the passenger flow network between EU member countries, demonstrates that further insights about the systems’ architectures can be gained this way.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Albert, R., Barabási, A.-L.: Rev. Mod. Phys. 74, 47 (2002)
Newman, M.E.J.: SIAM Rev. 45(2), 167 (2003)
Bocaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.-U.: Phys. Rep. 424, 175 (2006)
Barrat, A., Barthélemy, M., Pastor-Sarras, R., Vespignani, A.: Proc. Natl. Sci. U.S.A. 101, 3747 (2004)
Ahnert, S.E., Garlaschelli, D., Fink, T.M.A., Caldarelli, G.: Phys. Rev. E 76, 016101 (2007)
Onella, J.-P., Chakraborti, A., Kaski, K., Kertész, J., Kanto, A.: Phys. Rev. E 68, 056110 (2003)
Soromäki, K., Blech, M.L., Arnold, J., Glass, R.J., Beyeler, W.E.: Physica A 379, 317 (2007)
The data for the international trade network can be downloaded from, http://weber.ucsd.edu/~kgledits/exptradegdp.html We follow the procedure in [16] and reduce inconsistencies in the dataset by defining the link strength between countries as an average of reported imports/exports from the perspective of both countries
Newman, M.E.J.: Phys. Rev. E 64, 016131 (2001)
Almaas, A., et al.: Nature 427, 839x (2004)
Zhang, B., Horvath, S.: Stat. Appl. Gen. Mol. Bio. 4, Article 17 (2005)
Salwinski, L., et al.: Nucleic Acids Res. 32, D449 (2004)
Csermely, P.: Trends in Biochemical Sciences 29(7), 331 (2004)
Granovetter, M.: Am. J. Sociol. 73, 1360 (1973)
Onella, J.-P., Saramäki, J., Kertész, J., Kaski, K.: Phys. Rev. E 71, 065103R (2005)
Saramäki, J., Kivelä, M., Onella, J.-P., Kaski, K., Kertész, J.: e-print arXiv:cond-mat/0608670 (2006)
Newman, M.E.J.: Phys. Rev. E 70, 056131 (2004)
Dall’ Asta, L., Barrat, A., Barthélmy, M., Vespignani, A.: J. Stat. Mech., P04006 (2006)
Holme, P., Park, S.M., Kim, B.J., Edling, C.R.: Physica A 373, 821 (2007)
Newman, M.E.J.: Phys. Rev. E 70, 056131 (2004)
Watts, D.J., Strogatz, S.H.: Nature 393, 440 (1998)
Girvan, M., Newman, M.E.J.: Proc. Natl. Sci. U.S.A. 99, 7821 (2002)
The data can be downloaded from, http://epp.eurostat.cec.eu.int
Newman, M.E.J.: Phys. Rev. Lett. 89, 208701 (2002)
Serrano, M.A., et al.: e-print ArXiv:cond-mat:0511035 (2005)
May, R.M., Levin, S.A., Sugihara, G.: Nature 451, 893 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Brede, M., Boschetti, F. (2009). Analysing Weighted Networks: An Approach via Maximum Flows. In: Zhou, J. (eds) Complex Sciences. Complex 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02466-5_109
Download citation
DOI: https://doi.org/10.1007/978-3-642-02466-5_109
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02465-8
Online ISBN: 978-3-642-02466-5
eBook Packages: Computer ScienceComputer Science (R0)