research-article

FirmCore Decomposition of Multilayer Networks

Authors:

Farnoosh Hashemi,

Laks V.S. LakshmananAuthors Info & Claims

WWW '22: Proceedings of the ACM Web Conference 2022

Pages 1589 - 1600

https://doi.org/10.1145/3485447.3512205

Published: 25 April 2022 Publication History

Abstract

A key graph mining primitive is extracting dense structures from graphs, and this has led to interesting notions such as k-cores which subsequently have been employed as building blocks for capturing the structure of complex networks and for designing efficient approximation algorithms for challenging problems such as finding the densest subgraph. In applications such as biological, social, and transportation networks, interactions between objects span multiple aspects. Multilayer (ML) networks have been proposed for accurately modeling such applications. In this paper, we present FirmCore, a new family of dense subgraphs in ML networks, and show that it satisfies many of the nice properties of k-cores in single-layer graphs. Unlike the state of the art core decomposition of ML graphs, FirmCores have a polynomial time algorithm, making them a powerful tool for understanding the structure of massive ML networks. We also extend FirmCore for directed ML graphs. We show that FirmCores and directed FirmCores can be used to obtain efficient approximation algorithms for finding the densest subgraphs of ML graphs and their directed counterparts. Our extensive experiments over several real ML graphs show that our FirmCore decomposition algorithm is significantly more efficient than known algorithms for core decompositions of ML graphs. Furthermore, it returns solutions of matching or better quality for the densest subgraph problem over (possibly directed) ML graphs.

References

[1]

Reid Andersen. 2007. Finding large and small dense subgraphs. Arxiv (03 2007).

[2]

Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, and Takeshi Tokuyama. 1996. Greedily finding a dense subgraph. In Algorithm Theory — SWAT’96, Rolf Karlsson and Andrzej Lingas (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 136–148.

Digital Library

[3]

N. Azimi-Tafreshi, J. Gomez-Garde, and S. N. Dorogovtsev. 2014. k-corepercolation on multiplex networks. Physical Review E 90, 3 (Sep 2014).

[4]

Vladimir Batagelj and Matjaž Zaveršnik. 2011. Fast algorithms for determining (generalized) core groups in social networks. Advances in Data Analysis and Classification 5, 2(2011), 129–145.

Digital Library

[5]

F. Bonchi, F. Gullo, Andreas Kaltenbrunner, and Yana Volkovich. 2014. Core decomposition of uncertain graphs. In KDD ’14.

[6]

Francesco Bonchi, Lorenzo Severini, and Mauro Sozio. 2020. Better Fewer but Better: Community Search with Outliers. arxiv:2012.00356 [cs.DS]

[7]

Fabio Celli, F Marta L Di Lascio, Matteo Magnani, Barbara Pacelli, and Luca Rossi. 2010. Social Network Data and Practices: the case of Friendfeed. In International Conference on Social Computing, Behavioral Modeling and Prediction(Lecture Notes in Computer Science). Springer Berlin Heidelberg.

Digital Library

[8]

Moses Charikar. 2000. Greedy Approximation Algorithms for Finding Dense Components in a Graph. In Approximation Algorithms for Combinatorial Optimization, Klaus Jansen and Samir Khuller (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 84–95.

Digital Library

[9]

Shuntong Chen, Huaien Qian, Yanping Wu, Chen Chen, and Xiaoyang Wang. 2019. Efficient Adoption Maximization in Multi-layer Social Networks. In 2019 International Conference on Data Mining Workshops (ICDMW). 56–60. https://doi.org/10.1109/ICDMW.2019.00017

[10]

The dblp team. [n. d.]. dblp computer science bibliography. https://dblp.uni-trier.de/xml/.

[11]

M. De Domenico, A. Lima, P. Mougel, and M. Musolesi. 2013. The Anatomy of a Scientific Rumor. Scientific Reports 3, 1 (2013).

[12]

M. De Domenico, M. A. Porter, and A. Arenas. 2014. MuxViz: a tool for multilayer analysis and visualization of networks. Journal of Complex Networks 3, 2 (Oct 2014), 159–176. https://doi.org/10.1093/comnet/cnu038

[13]

Mark E. Dickison, Matteo Magnani, and Luca Rossi. 2016. Multilayer Social Networks. Cambridge University Press. https://doi.org/10.1017/CBO9781139941907

[14]

M. De Domenico, V. Nicosia, A. Arenas, and V. Latora. 2015. Structural reducibility of multilayer networks.Nature communications 6(2015), 6864.

[15]

Xiaoxi Du, Ruoming Jin, Liang Ding, Victor E. Lee, and John H. Thornton Jr.2009. Migration motif: a spatial - temporal pattern mining approach for financial markets. In KDD. 1135–1144.

[16]

David Eppstein, Maarten Löffler, and Darren Strash. 2010. Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time. arxiv:1006.5440 [cs.DS]

[17]

Yixiang Fang, Yixing Yang, Wenjie Zhang, Xuemin Lin, and Xin Cao. 2020. Effective and Efficient Community Search over Large Heterogeneous Information Networks. Proc. VLDB Endow. 13, 6 (Feb. 2020), 854–867. https://doi.org/10.14778/3380750.3380756

Digital Library

[18]

Eugene Fratkin, Brian T Naughton, Douglas L Brutlag, and Serafim Batzoglou. 2006. MotifCut: regulatory motifs finding with maximum density subgraphs. Bioinformatics (Oxford, England) 22, 14 (July 2006), e150—7. https://doi.org/10.1093/bioinformatics/btl243

[19]

Edoardo Galimberti, Francesco Bonchi, and Francesco Gullo. 2017. Core Decomposition and Densest Subgraph in Multilayer Networks. In Conference on Information and Knowledge Management (CIKM).

[20]

Edoardo Galimberti, Francesco Bonchi, Francesco Gullo, and Tommaso Lanciano. 2020. Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications. ACM Trans. Knowl. Discov. Data 14, 1, Article 11(2020), 40 pages. https://doi.org/10.1145/3369872

Digital Library

[21]

Edoardo Galimberti, Martino Ciaperoni, Alain Barrat, Francesco Bonchi, Ciro Cattuto, and Francesco Gullo. 2020. Span-Core Decomposition for Temporal Networks: Algorithms and Applications. ACM Trans. Knowl. Discov. Data 15, 1 (2020). https://doi.org/10.1145/3418226

Digital Library

[22]

Christos Giatsidis, Dimitrios Thilikos, and Michalis Vazirgiannis. 2011. D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy. In Knowledge and Information Systems, Vol. 35. 201–210. https://doi.org/10.1109/ICDM.2011.46

Digital Library

[23]

David Gibson, Jon Kleinberg, and Prabhakar Raghavan. 1998. Inferring Web Communities from Link Topology. In Proceedings of the Ninth ACM Conference on Hypertext and Hypermedia: Links, Objects, Time and Space—Structure in Hypermedia Systems: Links, Objects, Time and Space—Structure in Hypermedia Systems (Pittsburgh, Pennsylvania, USA) (HYPERTEXT ’98). Association for Computing Machinery, New York, NY, USA, 225–234. https://doi.org/10.1145/276627.276652

Digital Library

[24]

David Gibson, Ravi Kumar, and Andrew Tomkins. 2005. Discovering Large Dense Subgraphs in Massive Graphs. In VLDB (Trondheim, Norway). 721–732.

[25]

A. V. Goldberg. 1984. Finding a Maximum Density Subgraph. Technical Report.

[26]

Neil Zhenqiang Gong, Wenchang Xu, Ling Huang, Prateek Mittal, Emil Stefanov, Vyas Sekar, and Dawn Song. 2012. Evolution of Social-Attribute Networks: Measurements, Modeling, and Implications Using Google+. In Proceedings of the 2012 Internet Measurement Conference (Boston, Massachusetts, USA) (IMC ’12). Association for Computing Machinery, New York, NY, USA, 131–144.

Digital Library

[27]

V. Jethava and N. Beerenwinkel. 2015. Finding Dense Subgraphs in Relational Graphs. In Machine Learning and Knowledge Discovery in Databases, Annalisa Appice, Pedro Pereira Rodrigues, Vítor Santos Costa, João Gama, Alípio Jorge, and Carlos Soares (Eds.). Springer International Publishing, Cham, 641–654.

[28]

Daxin Jiang and Jian Pei. 2009. Mining Frequent Cross-Graph Quasi-Cliques. ACM Trans. Knowl. Discov. Data 2, 4, Article 16 (Jan. 2009), 42 pages.

Digital Library

[29]

Ravi Kannan and V Vinay. 1999. Analyzing the structure of large graphs. University of Bonn (1999).

[30]

Samir Khuller and Barna Saha. 2009. On Finding Dense Subgraphs. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming(ICALP ’09). Springer-Verlag, 597–608.

Digital Library

[31]

Mikko Kivelä, Alex Arenas, Marc Barthelemy, James P. Gleeson, Yamir Moreno, and Mason A. Porter. 2014. Multilayer networks. Journal of Complex Networks 2, 3 (07 2014), 203–271. https://doi.org/10.1093/comnet/cnu016

[32]

Jérôme Kunegis. 2013. KONECT: The Koblenz Network Collection. In Proceedings of the 22nd International Conference on World Wide Web (Rio de Janeiro, Brazil) (WWW ’13 Companion). Association for Computing Machinery, New York, NY, USA, 1343–1350. https://doi.org/10.1145/2487788.2488173

Digital Library

[33]

Jure Leskovec, Lada A. Adamic, and Bernardo A. Huberman. 2007. The Dynamics of Viral Marketing. ACM Trans. Web 1, 1 (May 2007), 5–es.

Digital Library

[34]

Don R. Lick and Arthur T. White. 1970. k-Degenerate Graphs. Canadian Journal of Mathematics 22, 5 (1970), 1082–1096. https://doi.org/10.4153/CJM-1970-125-1

[35]

Boge Liu, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang, and Jingren Zhou. 2019. Efficient (α, β)-Core Computation: An Index-Based Approach. In The World Wide Web Conference(WWW’19). Association for Computing Machinery, New York, NY, USA, 1130–1141. https://doi.org/10.1145/3308558.3313522

Digital Library

[36]

Boge Liu, Fan Zhang, Chen Zhang, Wenjie Zhang, and Xuemin Lin. 2019. CoreCube: Core Decomposition in Multilayer Graphs. In Web Information Systems Engineering – WISE 2019, Reynold Cheng, Nikos Mamoulis, Yizhou Sun, and Xin Huang (Eds.). Springer International Publishing, Cham, 694–710.

Digital Library

[37]

Xueming Liu, Enrico Maiorino, Arda Halu, Kimberly Glass, Rashmi B. Prasad, and Joseph Loscalzo. 2020. Robustness and lethality in multilayer biological molecular networks. Nature Communications 11(2020).

[38]

Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks V.S. Lakshmanan, Wenjie Zhang, and Xuemin Lin. 2021. Efficient Directed Densest Subgraph Discovery. SIGMOD Rec. 50, 1 (2021), 33–40. https://doi.org/10.1145/3471485.3471494

Digital Library

[39]

Elisa Omodei, Manlio De Domenico, and Alex Arenas. 2015. Characterizing interactions in online social networks during exceptional events. Frontiers in Physics 3(2015), 59. https://doi.org/10.3389/fphy.2015.00059

[40]

Sen Pei, Lev Muchnik, Jose Jr, Zhiming Zheng, and Hernan Makse. 2014. Searching for superspreaders of information in real-world social media. Scientific Reports 4 (05 2014), 5547. https://doi.org/10.1038/srep05547

[41]

Kaiyan Peng, Zheng Lu, Vanessa Lin, Michael R. Lindstrom, Christian Parkinson, Chuntian Wang, Andrea L. Bertozzi, and Mason A. Porter. 2021. A Multilayer Network Model of the Coevolution of the Spread of a Disease and Competing Opinions. arxiv:2107.01713 [cs.SI]

[42]

Stephen B. Seidman. 1983. Network structure and minimum degree. Social Networks 5, 3 (1983), 269–287. https://doi.org/10.1016/0378-8733(83)90028-X

[43]

Konstantinos Semertzidis, Evaggelia Pitoura, Evimaria Terzi, and Panayiotis Tsaparas. 2018. Finding lasting dense subgraphs. Data Mining and Knowledge Discovery 33, 5 (2018), 1417–1445. https://doi.org/10.1007/s10618-018-0602-x

Digital Library

[44]

Kijung Shin, Tina Eliassi-Rad, and Christos Faloutsos. 2018. Patterns and Anomalies in K-Cores of Real-World Graphs with Applications. Knowl. Inf. Syst. 54, 3 (2018), 677–710. https://doi.org/10.1007/s10115-017-1077-6

Digital Library

[45]

Mauro Sozio and Aristides Gionis. 2010. The Community-Search Problem and How to Plan a Successful Cocktail Party. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Washington, DC, USA) (KDD ’10). Association for Computing Machinery, New York, NY, USA, 939–948.

Digital Library

[46]

Charalampos Tsourakakis. 2015. The K-Clique Densest Subgraph Problem. In Proceedings of the 24th International Conference on World Wide Web(WWW ’15). International World Wide Web Conferences Steering Committee, 1122–1132. https://doi.org/10.1145/2736277.2741098

Digital Library

[47]

Nate Veldt, Austin R. Benson, and Jon Kleinberg. 2021. The Generalized Mean Densest Subgraph Problem. arxiv:2106.00909 [cs.DS]

[48]

Huanhuan Wu, James Cheng, Yi Lu, Yiping Ke, Yuzhen Huang, Da Yan, and Hejun Wu. 2015. Core decomposition in large temporal graphs. In 2015 IEEE International Conference on Big Data (Big Data). 649–658.

Digital Library

[49]

F. Yanghe and W.J. Teng. 2013. Peeling the drug target proteins network by a core decomposition method. Research Journal of Biotechnology 8 (10 2013), 66–70.

[50]

Alexander Zhou, Yue Wang, and Lei Chen. 2020. Finding Large Diverse Communities on Networks: The Edge Maximum k*-Partite Clique. Proc. VLDB Endow. 13, 12 (July 2020), 2576–2589. https://doi.org/10.14778/3407790.3407846

Digital Library

[51]

Rong Zhu, Zhaonian Zou, and Jianzhong Li. 2018. Diversified Coherent Core Search on Multi-Layer Graphs. In 2018 IEEE 34th International Conference on Data Engineering (ICDE). 701–712. https://doi.org/10.1109/ICDE.2018.00069

Cited By

Wu YSun RWang XWen DZhang YQin LLin X(2024)Efficient Maximal Frequent Group Enumeration in Temporal Bipartite GraphsProceedings of the VLDB Endowment10.14778/3681954.368199717:11(3243-3255)Online publication date: 30-Aug-2024
https://doi.org/10.14778/3681954.3681997
Lanciano TMiyauchi AFazzone ABonchi F(2024)A Survey on the Densest Subgraph Problem and its VariantsACM Computing Surveys10.1145/365329856:8(1-40)Online publication date: 30-Apr-2024
https://dl.acm.org/doi/10.1145/3653298
Behrouz AHashemi FBaeza-Yates RBonchi F(2024)Graph Mamba: Towards Learning on Graphs with State Space ModelsProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3672044(119-130)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3672044
Show More Cited By

Index Terms

FirmCore Decomposition of Multilayer Networks

Index terms have been assigned to the content through auto-classification.

Recommendations

Incremental k-core decomposition: algorithms and evaluation

A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, protein function prediction, ...
Sandwiching a densest subgraph by consecutive cores

In this paper, we show that in the random graph Gn,c/n, with high probability, there exists an integer kï such that a subgraph of Gn,c/n, whose vertex set differs from a densest subgraph of Gn,c/n by Olog2n vertices, is sandwiched by the kï and the kï +...
MiMAG: mining coherent subgraphs in multi-layer graphs with edge labels

Detecting dense subgraphs such as cliques or quasi-cliques is an important graph mining problem. While this task is established for simple graphs, today's applications demand the analysis of more complex graphs: In this work, we consider a frequently ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WWW '22: Proceedings of the ACM Web Conference 2022

April 2022

3764 pages

ISBN:9781450390965

DOI:10.1145/3485447

Editors:
Frédérique Laforest
INSA Lyon, France
,
Raphaël Troncy
EURECOM, France
,
Elena Simperl
King’s College London, UK
,
Deepak Agarwal
Pinterest, USA
,
Aristides Gionis
KTH Royal Institute of Technology, Sweden
,
Ivan Herman
W3C / retired
,
Lionel Médini
Université Lyon 1, France

Copyright © 2022 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 April 2022

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

WWW '22

Sponsor:

SIGWEB

WWW '22: The ACM Web Conference 2022

April 25 - 29, 2022

Virtual Event, Lyon, France

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
417
Total Downloads

Downloads (Last 12 months)79
Downloads (Last 6 weeks)4

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wu YSun RWang XWen DZhang YQin LLin X(2024)Efficient Maximal Frequent Group Enumeration in Temporal Bipartite GraphsProceedings of the VLDB Endowment10.14778/3681954.368199717:11(3243-3255)Online publication date: 30-Aug-2024
https://doi.org/10.14778/3681954.3681997
Lanciano TMiyauchi AFazzone ABonchi F(2024)A Survey on the Densest Subgraph Problem and its VariantsACM Computing Surveys10.1145/365329856:8(1-40)Online publication date: 30-Apr-2024
https://dl.acm.org/doi/10.1145/3653298
Behrouz AHashemi FBaeza-Yates RBonchi F(2024)Graph Mamba: Towards Learning on Graphs with State Space ModelsProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3672044(119-130)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3672044
Hashemi FBehrouz ABaeza-Yates RBonchi F(2024)A Unified Core Structure in Multiplex Networks: From Finding the Densest Subgraph to Modeling User EngagementProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3672011(1028-1039)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3672011
Oettershagen LWang HGionis AChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Finding Densest Subgraphs with Edge-Color ConstraintsProceedings of the ACM Web Conference 202410.1145/3589334.3645647(936-947)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645647
Wu YSun RWang XZhang YQin LZhang WLin X(2024)Efficient Maximal Temporal Plex Enumeration2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00240(3098-3110)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00240
Liu DWang RZou ZHuang X(2024)Fast Multilayer Core Decomposition and Indexing2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00211(2695-2708)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00211
Behrouz AHashemi F(2024)Generalized Densest Subgraph in Multiplex NetworksComplex Networks & Their Applications XII10.1007/978-3-031-53472-0_5(49-61)Online publication date: 21-Feb-2024
https://doi.org/10.1007/978-3-031-53472-0_5
Behrouz AHashemi FSadeghian SSeltzer MOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)CAT-WALKProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3667538(32636-32671)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3667538
Liu DZou Z(2023)gCore: Exploring Cross-Layer Cohesiveness in Multi-Layer GraphsProceedings of the VLDB Endowment10.14778/3611479.361151916:11(3201-3213)Online publication date: 1-Jul-2023
https://dl.acm.org/doi/10.14778/3611479.3611519
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View Table of Contents