A Unified Core Structure in Multiplex Networks: From Finding the Densest Subgraph to Modeling User Engagement
Pages 1028 - 1039
Abstract
In many complex systems, the interactions between objects span multiple aspects. Multiplex networks are accurate paradigms to model such systems, where each edge is associated with a type. A key graph mining primitive is extracting dense subgraphs, and this has led to interesting notions such as k-cores, known as building blocks of complex networks. Despite recent attempts to extend the notion of core to multiplex networks, existing studies suffer from a subset of the following limitations: They (1) force all nodes to exhibit their high degree in the same set of relation types while in multiplex networks some connection types can be noisy for some nodes, (2) either require high computational cost or miss the complex information of multiplex networks, and (3) assume the same importance for all relation types. We introduce Score, a novel and unifying family of dense structures in multiplex networks that uses a function S(.) to summarize the degree vector of each node. We then discuss how one can choose a proper S(.) from the data. To demonstrate the usefulness of Scores, we focus on finding the densest subgraph as well as modeling user engagement in multiplex networks. We present a new density measure in multiplex networks and discuss its advantages over existing density measures. We show that the problem of finding the densest subgraph in multiplex networks is NP-hard and design an efficient approximation algorithm based on Scores. Finally, we present a new mathematical model of user engagement in the presence of different relation types. Our experiments shows the efficiency and effectiveness of our algorithms and supports the proposed mathematical model of user engagement.
References
[1]
W Brian Arthur. 1989. Competing technologies, increasing returns, and lock-in by historical events. The economic journal, Vol. 99, 394 (1989), 116--131.
[2]
N. Azimi-Tafreshi, J. Gomez-Garde, and S. N. Dorogovtsev. 2014. k-corepercolation on multiplex networks. Physical Review E, Vol. 90, 3 (Sep 2014).
[3]
Vladimir Batagelj and Matja? Zaver?nik. 2011. Fast algorithms for determining (generalized) core groups in social networks. Advances in Data Analysis and Classification, Vol. 5, 2 (2011), 129--145.
[4]
Ali Behrouz and Farnoosh Hashemi. 2022. CS-MLGCN: Multiplex Graph Convolutional Networks for Community Search in Multiplex Networks. In Proceedings of the 31st ACM International Conference on Information and Knowledge Management (Atlanta, GA, USA) (CIKM '22). Association for Computing Machinery, New York, NY, USA, 3828--3832. https://doi.org/10.1145/3511808.3557572
[5]
Ali Behrouz and Farnoosh Hashemi. 2023. Generalized Densest Subgraph in Multiplex Networks. arXiv preprint arXiv:2310.04893 (2023).
[6]
Ali Behrouz and Farnoosh Hashemi. 2024. Graph Mamba: Towards Learning on Graphs with State Space Models. arXiv preprint arXiv:2402.08678 (2024).
[7]
Ali Behrouz, Farnoosh Hashemi, and Laks V. S. Lakshmanan. 2022. FirmTruss Community Search in Multilayer Networks. Proc. VLDB Endow., Vol. 16, 3 (nov 2022), 505--518. https://doi.org/10.14778/3570690.3570700
[8]
Ali Behrouz, Michele Santacatterina, and Ramin Zabih. 2024. Chimera: Effectively Modeling Multivariate Time Series with 2-Dimensional State Space Models. arXiv preprint arXiv:2406.04320 (2024).
[9]
Ali Behrouz and Margo Seltzer. 2022. Anomaly Detection in Multiplex Dynamic Networks: from Blockchain Security to Brain Disease Prediction. In NeurIPS 2022 Temporal Graph Learning Workshop. https://openreview.net/forum?id=UDGZDfwmay
[10]
Ali Behrouz and Margo Seltzer. 2023. Anomaly Detection in Human Brain via Inductive Learning on Temporal Multiplex Networks. In Machine Learning for Healthcare Conference, Vol. 219. PMLR.
[11]
Kshipra Bhawalkar, Jon Kleinberg, Kevin Lewi, Tim Roughgarden, and Aneesh Sharma. 2015. Preventing unraveling in social networks: the anchored k-core problem. SIAM Journal on Discrete Mathematics, Vol. 29, 3 (2015), 1452--1475.
[12]
David Blei, Andrew Ng, and Michael Jordan. 2001. Latent Dirichlet Allocation. The Journal of Machine Learning Research, Vol. 3, 601--608.
[13]
Lawrence E Blume. 1993. The statistical mechanics of strategic interaction. Games and economic behavior, Vol. 5, 3 (1993), 387--424.
[14]
Alessio Cardillo, Jesús Gómez-Gardenes, Massimiliano Zanin, Miguel Romance, David Papo, Francisco del Pozo, and Stefano Boccaletti. 2013. Emergence of network features from multiplexity. Scientific reports, Vol. 3, 1 (2013), 1--6.
[15]
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 SBP-BRiMS (Lecture Notes in Computer Science). Springer Berlin Heidelberg.
[16]
Moses Charikar, Yonatan Naamad, and Jimmy Wu. 2018. On Finding Dense Common Subgraphs. arxiv: 1802.06361 [cs.DS]
[17]
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
[18]
Jonathan Cohen. 2008. Trusses: Cohesive Subgraphs for Social Network Analysis. In National security agency. Technical report.
[19]
The dblp team. [n.,d.]. dblp computer science bibliography. https://dblp.uni-trier.de/xml/.
[20]
M. De Domenico, A. Lima, P. Mougel, and M. Musolesi. 2013. The Anatomy of a Scientific Rumor. Scientific Reports, Vol. 3, 1 (2013).
[21]
M. De Domenico, M. A. Porter, and A. Arenas. 2014. MuxViz: a tool for multilayer analysis and visualization of networks. Journal of Complex Networks, Vol. 3, 2 (Oct 2014), 159--176. https://doi.org/10.1093/comnet/cnu038
[22]
M. De Domenico, V. Nicosia, A. Arenas, and V. Latora. 2015. Structural reducibility of multilayer networks. Nature communications, Vol. 6 (2015), 6864.
[23]
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.
[24]
Ehsan Elhamifar and M De Paolis Kaluza. 2017. Subset selection and summarization in sequential data. Advances in Neural Information Processing Systems, Vol. 30 (2017).
[25]
Glenn Ellison. 1993. Learning, local interaction, and coordination. Econometrica: Journal of the Econometric Society (1993), 1047--1071.
[26]
András Faragó. 2008. A general tractable density concept for graphs. Mathematics in Computer Science, Vol. 1, 4 (2008), 689--699.
[27]
Eugene Fratkin, Brian T Naughton, Douglas L Brutlag, and Serafim Batzoglou. 2006. MotifCut: regulatory motifs finding with maximum density subgraphs. Bioinformatics (Oxford, England), Vol. 22, 14 (July 2006).
[28]
Edoardo Galimberti, Francesco Bonchi, and Francesco Gullo. 2017. Core Decomposition and Densest Subgraph in Multilayer Networks. In Conference on Information and Knowledge Management (CIKM).
[29]
A. Goldberg. 1984. Finding a Maximum Density Subgraph. Technical Report.
[30]
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 Internet Measurement Conference. ACM, NY, USA, 131--144.
[31]
Farnoosh Hashemi and Ali Behrouz. 2024. A Unified Core Structure in Multiplex Networks: From Finding the Densest Subgraph to Modeling User Engagement. arXiv preprint arXiv:2406.13734 (2024).
[32]
Farnoosh Hashemi, Ali Behrouz, and Laks V.S. Lakshmanan. 2022. FirmCore Decomposition of Multilayer Networks. In Proceedings of the ACM Web Conference 2022 (Virtual Event, Lyon, France) (WWW '22). Association for Computing Machinery, New York, NY, USA, 1589--1600. https://doi.org/10.1145/3485447.3512205
[33]
Petter Holme and Jari Saramäki. 2012. Temporal networks. Physics Reports, Vol. 519, 3 (2012), 97--125. https://doi.org/10.1016/j.physrep.2012.03.001 Temporal Networks.
[34]
V. Jethava and N. Beerenwinkel. 2015. Finding Dense Subgraphs in Relational Graphs. In Machine Learning and Knowledge Discovery in Databases. Springer International Publishing, Cham, 641--654.
[35]
Junteng Jia and Austion R Benson. 2020. Residual correlation in graph neural network regression. In Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining. 588--598.
[36]
Michael L Katz and Carl Shapiro. 1985. Network externalities, competition, and compatibility. The American economic review, Vol. 75, 3 (1985), 424--440.
[37]
Yasushi Kawase, Atsushi Miyauchi, and Hanna Sumita. 2023. Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. In Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining (SingaporeSingapore) (WSDM '23). Association for Computing Machinery, New York, NY, USA, 886--894. https://doi.org/10.1145/3539597.3570444
[38]
Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In International Conference on Learning Representations. https://openreview.net/forum?id=SJU4ayYgl
[39]
Mikko Kivelä, Alex Arenas, Marc Barthelemy, James P. Gleeson, Yamir Moreno, and Mason A. Porter. 2014. Multilayer networks. Journal of Complex Networks, Vol. 2 (2014), 203--271. https://doi.org/10.1093/comnet/cnu016
[40]
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, and Francesco Bonchi. 2023. A Survey on the Densest Subgraph Problem and its Variants. arxiv: 2303.14467 [cs.DS]
[41]
Jure Leskovec, Lada A. Adamic, and Bernardo A. Huberman. 2007. The Dynamics of Viral Marketing. ACM Trans. Web, Vol. 1, 1 (May 2007), 5--es.
[42]
Don R. Lick and Arthur T. White. 1970. k-Degenerate Graphs. Canadian Journal of Mathematics, Vol. 22, 5 (1970), 1082--1096. https://doi.org/10.4153/CJM-1970--125--1
[43]
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.
[44]
Dandan Liu and Zhaonian Zou. 2023. gCore: Exploring Cross-Layer Cohesiveness in Multi-Layer Graphs. Proc. VLDB Endow., Vol. 16, 11 (jul 2023), 3201--3213. https://doi.org/10.14778/3611479.3611519
[45]
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, Vol. 11 (2020).
[46]
Lutz Oettershagen, Honglian Wang, and Aristides Gionis. 2024. Finding Densest Subgraphs with Edge-Color Constraints. In Proceedings of the ACM on Web Conference 2024 (, Singapore, Singapore,) (WWW '24). Association for Computing Machinery, New York, NY, USA, 936--947. https://doi.org/10.1145/3589334.3645647
[47]
Umit Y Ogras and Hakan Ferhatosmanoglu. 2006. Online summarization of dynamic time series data. The VLDB Journal, Vol. 15 (2006), 84--98.
[48]
Elisa Omodei, Manlio De Domenico, and Alex Arenas. 2015. Characterizing interactions in online social networks during exceptional events. Frontiers in Physics, Vol. 3 (2015), 59. https://doi.org/10.3389/fphy.2015.00059
[49]
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]
[50]
Pekka Sääskilahti. 2005. Monopoly pricing of social goods. (2005).
[51]
Nate Veldt, Austin R. Benson, and Jon Kleinberg. 2021. The Generalized Mean Densest Subgraph Problem. In Proceedings of the 27th ACM SIGKDD (Virtual Event, Singapore) (KDD '21). ACM, New York, NY, USA, 1604--1614. https://doi.org/10.1145/3447548.3467398
[52]
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.
[53]
Chun-Xue Zhu, Long-Long Lin, Ping-Peng Yuan, and Hai Jin. 2022. Discovering cohesive temporal subgraphs with temporal density aware exploration. Journal of Computer Science and Technology, Vol. 37, 5 (2022), 1068--1085.
Index Terms
- A Unified Core Structure in Multiplex Networks: From Finding the Densest Subgraph to Modeling User Engagement
Index terms have been assigned to the content through auto-classification.
Recommendations
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ï +...
Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs
The densest k-subgraph problem asks for a k-vertex subgraph with the maximum number of edges. This problem is NP-hard on bipartite graphs, chordal graphs, and planar graphs. A 3-approximation algorithm is known for chordal graphs. We present 32-...
Identifying the social-balanced densest subgraph from signed social networks
Identifying the dense subgraphs from large graphs is important and useful to various social media mining applications. Most of existing works focus on the densest subgraph problem in the unweighted and undirected represented social network which can ...
Comments
Information & Contributors
Information
Published In
August 2024
6901 pages
Copyright © 2024 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 the author(s) 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
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 August 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
August 25 - 29, 2024
Barcelona, Spain
Acceptance Rates
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 127Total Downloads
- Downloads (Last 12 months)127
- Downloads (Last 6 weeks)25
Reflects downloads up to 09 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in