Profiling core-periphery network structure by random walkers

Scientific Reports

Volumn 3, Issue , 2013, Pages

  Rossa, Fabio Della ^a   Dercole, Fabio ^a   Piccardi, Carlo ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84875869265     PISSN: None     EISSN: 20452322     Source Type: Journal    
DOI: 10.1038/srep01467     Document Type: Article

References (40)

1. Snyder, D. & Kick, E. L. Structural position in the world system and economic growth, 1955-1970: A multiple-network analysis of transnational interactions. Am. J. Sociol. 84, 1096-1126 (1979).
2. Chasedunn, C. & Grimes, P. World systems-analysis. Annu. Rev. Sociol. 21, 387-417 (1995).
3. Krugman, P. & Venables, A. Globalization and the inequality of nations. Q. J. Econ. 110, 857-880 (1995). (Pubitemid 26466422)
4. Zhou, S. & Mondragon, R. The rich-club phenomenon in the Internet topology. IEEE Commun. Lett. 8, 180-182 (2004).
5. Gastner, M. & Newman, M. Shape and efficiency in spatial distribution networks. J. Stat. Mech.-Theory Exp. P01015 (2006).
6. Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y. & Shir, E. A model of Internet topology using k-shell decomposition. Proc. Natl. Acad. Sci. U.S.A. 104, 11150-11154 (2007). (Pubitemid 47175109)
7. Jeong, H., Mason, S., Barabasi, A. & Oltvai, Z. Lethality and centrality in protein networks. Nature 411, 41-42 (2001). (Pubitemid 32428180)
8. Da Silva, M. R.,Ma, H.&Zeng, A.-P. Centrality, network capacity, andmodularity as parameters to analyze the core-periphery structure inmetabolic networks. Proc. IEEE 96, 1411-1420 (2008).
9. Bassett, D. S. et al. Core-periphery organisation of human brain dynamics (published October 12, 2012; accessed December 16, 2012). URL http://arxiv.org/abs/1210.3555.
10. Newman, M. E. J. Networks: An Introduction (Oxford University Press, 2010).
11. Borgatti, S. & Everett, M. Models of core/periphery structures. Soc. Networks 21, 375-395 (1999).
12. Holme, P. Core-periphery organization of complex networks. Phys. Rev. E 72, (2005).
13. Boyd, J., Fitzgerald, W. & Beck, R. Computing core/periphery structures and permutation tests for social relations data. Soc. Networks 28, 165-178 (2006). (Pubitemid 43231306)
14. Barrat, A., Barthlemy, M. & Vespignani, A. Dynamical Processes on Complex Networks (Cambridge University Press, 2008).
15. Piccardi, C. Finding and testing network communities by lumpedMarkov chains. PLoS One 6, e27028 (2011).
16. Sima, J. & Schaeffer, S. On the NP-completeness of some graph cluster measures. In Wiedermann, J., Tel, G., Pokorny, J., Bielikova, M. and Stuller, J. (ed.) SOFSEM 2006: Theory and Practice of Computer Science, Proceedings vol. 3831 of Lecture Notes in Computer Science, 530-537 (2006). (Pubitemid 43966892)
17. Chung, F. & Lu, L. The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. U.S.A. 99, 15879-15882 (2002). (Pubitemid 35462716)
18. Zachary, W. An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452-473 (1977).
19. Newman, M. E. J. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006).
20. Opsahl, T. Why Anchorage is not (that) important: binary ties and sample selection (published August 12, 2011; accessed December 16, 2012). URL http://toreopsahl.com/2011/08/12/.
21. Openflights.org. Airport, airline and route data (accessed August 12, 2011). URL http://openflights.org/data.html.
22. Newman, M. E. J. Network data (accessed June 6, 2012). URL http://wwwpersonal. umich.edu/,mejn/netdata/.
23. Watts, D. J. & Strogatz, S. H. Collective dynamics of 'small-world' networks. Nature 393, 440-442 (1998). (Pubitemid 28292183)
24. Milo, R., Kashtan, N., Itzkovitz, S., Newman, M. E. J. & Alon, U. On the uniform generation of random graphs with prescribed degree sequences (published May 30, 2004; accessed December 16, 2012). URL http://arxiv.org/abs/ cond-mat/0312028.
25. Zlatic, V. et al. On the rich-club effect in dense and weighted networks. Eur. Phys. J. B 67, 271-275 (2009).
26. Serrano, M. A. & Boguña M. Topology of the world trade web. Phys. Rev. E 68, 015101 (2003).
27. Piccardi, C. & Tajoli, L. Existence and significance of communities in the world trade web. Phys. Rev. E 85, 066119 (2012).
28. Dorogovtsev, S., Goltsev, A. & Mendes, J. k-core organization of complex networks. Phys. Rev. Lett. 96, 040601 (2006).
29. Alvarez-Hamelin, J. I., Dall'Asta, L., Barrat, A. & Vespignani, A. K-core decomposition of Internet graphs: Hierarchies, selfsimilarity and measurement biases. Netw. Heterog. Media 3, 371-393 (2008).
30. Garas, A., Schweitzer, F. & Havlin, S. A k-shell decomposition method for weighted networks. New J. Phys. 14, 083030 (2012).
31. Colizza, V., Flammini, A., Serrano, M. & Vespignani, A. Detecting rich-club ordering in complex networks. Nat. Phys. 2, 110-115 (2006). (Pubitemid 43731381)
32. Fortunato, S., Flammini, A., Menczer, F. & Vespignani, A. Topical interests and the mitigation of search engine bias. Proc. Natl. Acad. Sci. U.S.A. 103, 12684-12689 (2006). (Pubitemid 44298621)
33. Meyer, C. Matrix Analysis and Applied Linear Algebra (SIAM, 2000).
34. Langville, A. N. & Meyer, C. D. Google's PageRank and Beyond: The Science of Search Engine Rankings (Princeton University Press, Princeton, NJ, 2006).
35. Parreira, J. X., Donato, D., Michel, S. & Weikum, G. Efficient and decentralized pagerank approximation in a peer-to-peer web search network. In Proceedings of the 32nd international conference on Very large data bases VLDB' 06, 415-426 (2006).
36. Ishii, H. & Tempo, R. Distributed Randomized Algorithms for the PageRank Computation. IEEE Trans. Autom. Control 55, 1987-2002 (2010).
37. Kemeny, J. G. & Snell, J. L. Finite Markov Chains (Springer-Verlag, 1976).
38. Buchholz, P. Exact and ordinary lumpability in finite Markov-chains. J. Appl. Probab. 31, 59-75 (1994).
39. Hoffmann, K. H. & Salamon, P. Bounding the lumping error in Markov chain dynamics. Appl. Math. Lett. 22, 1471-1475 (2009).
40. Kim, Y., Son, S.-W. & Jeong, H. Finding communities in directed networks. Phys. Rev. E 81, 016103 (2010).