Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-25T19:47:19.822Z Has data issue: false hasContentIssue false
  • English
  • Français

A local perspective on community structure in multilayer networks

Published online by Cambridge University Press:  12 January 2017

LUCAS G. S. JEUB ,
MICHAEL W. MAHONEY ,
PETER J. MUCHA  and
MASON A. PORTER
LUCAS G. S. JEUB
Affiliation:
Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, OX2 6GG, UK Center for Complex Networks and Systems Research, School of Informatics and Computing, Indiana University, Bloomington, IN 47408, USA (e-mail: lucasjeub@gmail.com)
MICHAEL W. MAHONEY
Affiliation:
International Computer Science Institute, Berkeley, CA 94704, USA Department of Statistics, University of California at Berkeley, Berkeley, CA 94720, USA (e-mail: mahoneymw@gmail.com)
PETER J. MUCHA
Affiliation:
Carolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, NC 27599-3250, USA (e-mail: mucha@unc.edu)
MASON A. PORTER
Affiliation:
Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, OX2 6GG, UK CABDyN Complexity Centre, University of Oxford, Oxford, OX1 1HP, UK Department of Mathematics, University of California, Los Angeles, Los Angeles, California 90095, USA (e-mail: mason@math.ucla.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

The analysis of multilayer networks is among the most active areas of network science, and there are several methods to detect dense “communities” of nodes in multilayer networks. One way to define a community is as a set of nodes that trap a diffusion-like dynamical process (usually a random walk) for a long time. In this view, communities are sets of nodes that create bottlenecks to the spreading of a dynamical process on a network. We analyze the local behavior of different random walks on multiplex networks (which are multilayer networks in which different layers correspond to different types of edges) and show that they have very different bottlenecks, which correspond to rather different notions of what it means for a set of nodes to be a good community. This has direct implications for the behavior of community-detection methods that are based on these random walks.

Keywords

community structureclusteringmultilayer networksrandom walksnetwork community profilesspectral graph theorypersonalized PageRank
Type
Research Article
Information
Network Science , Volume 5 , Special Issue 2: Modeling, Analysis, and Mining of Multilayer Networks , June 2017 , pp. 144 - 163
Copyright
Copyright © Cambridge University Press 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Andersen, R., Chung, F. R. K., & Lang, K. J. (2006). Local graph partitioning using PageRank vectors. In Proceedings of the 47th Annual Symposium on Foundations of Computer Science. New York, NY, USA: IEEE, pp. 475–486.Google Scholar
Arenas, A., Díaz-Guilera, A., & Pérez-Vicente, C. J. (2006). Synchronization reveals topological scales in complex networks. Physical Review Letters, 96 (11), 114102.Google Scholar
Arenas, A., Fernández, A. & Gómez, S. (2008). Analysis of the structure of complex networks at different resolution levels. New Journal of Physics, 10 (5), 053039.CrossRefGoogle Scholar
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardenes, J., Romance, M., . . . Zanin, M. (2014). The structure and dynamics of multilayer networks. Physics Reports, 544 (1), 1–122.Google Scholar
Cardillo, A., Gómez-Gardeñes, J., Zanin, M., Romance, M., Papo, D., del Pozo, F., & Boccaletti, S. (2013). Emergence of network features from multiplexity. Scientific Reports, 3, 1344.Google Scholar
Coscia, M., Giannotti, F., & Pedreschi, D. (2011). A classification for community discovery methods in complex networks. Statistical Analysis and Data Mining, 4 (5), 512–546.CrossRefGoogle Scholar
Cranmer, S. J., Menninga, E. J., & Mucha, P. J. (2015). Kantian fractionalization predicts the conflict propensity of the international system. Proceedings of the National Academy of Sciences of the United States of America, 112 (38), 11812–11816.Google Scholar
Csermely, P., London, A., Wu, L.-Y., & Uzzi, B. (2013). Structure and dynamics of core–periphery networks. Journal of Complex Networks, 1 (2), 93–123.CrossRefGoogle Scholar
De Domenico, M., Solè-Ribalta, A., Gómez, S., & Arenas, A. (2014). Navigability of interconnected networks under random failures. Proceedings of the National Academy of Sciences of the United States of America, 111 (23), 8351–8356.Google Scholar
De Domenico, M., Lancichinetti, A., Arenas, A., & Rosvall, M. (2015). Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems. Physical Review X, 5 (1), 011027.Google Scholar
De Domenico, M., Granell, C., Porter, M. A. & Arenas, A. (2016). The physics of spreading processes in multilayer networks. Nature Physics, 12 (10), 901–906.CrossRefGoogle Scholar
Delvenne, J.-C., Yaliraki, S. N., & Barahona, M. (2010). Stability of graph communities across time scales. Proceedings of the National Academy of Sciences of the United States of America, 107 (29), 12755–12760.CrossRefGoogle ScholarPubMed
Fortunato, S. (2010). Community detection in graphs. Physics Reports, 486 (3–5), 75–174.CrossRefGoogle Scholar
Fortunato, S., & Hric, D. (2016). Community detection in networks: A user guide. Physics Reports, 659, 1–44.Google Scholar
Ghosh, R., Lerman, K., Teng, S.-H., & Yan, X. (2014). The interplay between dynamics and networks: Centrality, communities, and Cheeger inequality. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD '14. New York, NY, USA: ACM, pp. 1406–1415.CrossRefGoogle Scholar
Gleich, D. F. (2015). PageRank beyond the Web. SIAM Review, 57 (3), 321–363.CrossRefGoogle Scholar
Gleich, D. F., & Kloster, K. (2016). Seeded PageRank solution paths. European Journal of Applied Mathematics, 27 (6), 812–845.Google Scholar
Hmimida, M., & Kanawati, R. (2015). Community detection in multiplex networks: A seed-centric approach. Networks and Heterogeneous Media, 10 (1), 71–85.Google Scholar
Holme, P. (2015). Modern temporal network theory: A colloquium. The European Physical Journal B, 88 (9), 234.Google Scholar
Holme, P., & Saramäki, J. (2012). Temporal networks. Physics Reports, 519 (3), 97–125.CrossRefGoogle Scholar
Jaccard, P. (1912). The distribution of the flora in the alpine zone. New Phytologist, 11 (2), 37–50.CrossRefGoogle Scholar
Jerrum, M., & Sinclair, A. (1988). Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, pp. 235–244.Google Scholar
Jeub, L. G. S., Balachandran, P., Porter, M. A., Mucha, P. J., & Mahoney, M. W. (2015). Think locally, act locally: Detection of small, medium-sized, and large communities in large networks. Physical Review E, 91 (1), 012821.Google Scholar
Kanawati, R. (2014). Seed-centric approaches for community detection in complex networks. In Meiselwitz, G. (Ed.), Proceedings of the 6th International Conference on Social Computing and Social Media, SCSM 2014. Lecture Notes in Computer Science, vol. 8531. Cham, Switzerland: Springer International Publishing, pp. 197–208.Google Scholar
Kivelá, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014). Multilayer networks. Journal of Complex Networks, 2 (3), 203–271.Google Scholar
Kloumann, I., Ugander, J., & Kleinberg, J. (2016). Block models and personalized PageRank. arXiv:1607.03483.Google Scholar
Kuncheva, Z., & Montana, G. (2015). Community detection in multiplex networks using locally adaptive random walks. In Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015. ASONAM '15. New York, NY, USA: ACM, pp. 1308–1315.Google Scholar
Lambiotte, R., & Rosvall, M. (2012). Ranking and clustering of nodes in networks with smart teleportation. Physical Review E, 85 (5), 056107.Google Scholar
Lambiotte, R., Delvenne, J.-C., & Barahona, M. (2009). Laplacian dynamics and multiscale modular structure in networks. arXiv:0812.1770v3.Google Scholar
Lambiotte, R., Sinatra, R., Delvenne, J.-C., Evans, T. S., Barahona, M., & Latora, V. (2011). Flow graphs: Interweaving dynamics and structure. Physical Review E, 84 (1), 017102.Google Scholar
Lambiotte, R., Delvenne, J.-C., & Barahona, M. (2015). Random walks, Markov processes and the multiscale modular organization of complex networks. Transactions on Network Science and Engineering, 1 (2), 76–90.Google Scholar
Lazega, E. (2001). The Collegial Phenomenon: The Social Mechanisms of Cooperation Among Peers in a Corporate Law Partnership. Oxford, UK: Oxford University Press.CrossRefGoogle Scholar
Lazega, E., & Pattison, P. E. (1999). Multiplexity, generalized exchange and cooperation in organizations: A case study. Social Networks, 21 (1), 67–90.CrossRefGoogle Scholar
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009). Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6 (1), 29–123.Google Scholar
Leskovec, J., Lang, K. J., & Mahoney, M. W. (2010). Empirical comparison of algorithms for network community detection. In Proceedings of the 19th International Conference on World Wide Web. New York, NY, USA: ACM, pp. 1308–1315.Google Scholar
Mihail, M. (1989). Conductance and convergence of Markov chains — A combinatorial treatment of expanders. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. New York, NY, USA: IEEE, pp. 526–531.Google Scholar
Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010). Community structure in time-dependent, multiscale, and multiplex networks. Science, 328(5980), 876–878.Google Scholar
Newman, M. E. J. (2010). Networks: An Introduction. Oxford, UK: Oxford University Press.Google Scholar
Peixoto, T. P. (2015). Inferring the mesoscale structure of layered, edge-valued, and time-varying networks. Physical Review E, 92 (4), 042807.Google Scholar
Porter, M. A., Onnela, J.-P., & Mucha, P. J. (2009). Communities in networks. Notices of the American Mathematical Society, 56 (9), 1082–1097, 1164–1166.Google Scholar
Rosvall, M., & Bergstrom, C. T. (2008). Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences of the United States of America, 105 (4), 1118–1123.Google Scholar
Rosvall, M., Esquivel, A. V., Lancichinetti, A., West, J. D., & Lambiotte, R. (2014). Memory in network flows and its effects on spreading dynamics and community detection. Nature Communications, 5, 4630.Google Scholar
Salehi, M., Sharma, R., Marzolla, M., Magnani, M., Siyari, P., & Montesi, D. (2015). Spreading processes in multilayer networks. IEEE Transactions on Network Science and Engineering, 2 (2), 65–83.Google Scholar
Snijders, T. A. B., Pattison, P. E., Robins, G. L., & Handcock, M. S. (2006). New specifications for exponential random graph models. Sociological Methodology, 36 (1), 99–153.Google Scholar
Wasserman, S., & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge, UK: Cambridge University Press.Google Scholar
Whang, J. J., Gleich, D. F., & Dhillon, I. S. (2016). Overlapping community detection using neighborhood-inflated seed expansion. IEEE Transactions on Knowledge and Data Engineering, 28 (5), 1272–1284.CrossRefGoogle Scholar
Yan, X., Teng, S.-H., Lerman, K., & Ghosh, R. (2016). Capturing the interplay of dynamics and networks through parameterizations of Laplacian operators. PeerJ Computer Science, 2, e57.Google Scholar
Yang, J., & Leskovec, J. (2015). Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems, 42 (1), 181–213.CrossRefGoogle Scholar