research-article

Fully Dynamic Approximate k-Core Decomposition in Hypergraphs

Authors:

T.-H. Hubert Chan,

Mauro SozioAuthors Info & Claims

ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 14, Issue 4

Article No.: 39, Pages 1 - 21

https://doi.org/10.1145/3385416

Published: 30 May 2020 Publication History

Abstract

In this article, we design algorithms to maintain approximate core values in dynamic hypergraphs. This notion has been well studied for normal graphs in both static and dynamic setting. We generalize the problem to hypergraphs when edges can be inserted or deleted by an adversary.

We consider two dynamic scenarios. In the first case, there are only insertions; and in the second case, there can be both insertions and deletions. In either case, the update time is poly-logarithmic in the number of nodes, with the insertion-only case boasting a better approximation ratio. We also perform extensive experiments on large real-world datasets, which demonstrate the accuracy and efficiency of our algorithms.

References

[1]

2017. Facebook friendships network dataset – KONECT. Retrieved from http://konect.uni-koblenz.de/networks/facebook-wosn-links.

[2]

2018. CiteULike tag-publication bipartite network dataset. Retrieved from http://konect.uni-koblenz.de/networks/citeulike-ti.

[3]

2018. DBLP dataset. Retrieved from http://dblp.uni-trier.de/xml/.

[4]

2018. YouTube social network dataset. Retrieved from http://konect.uni-koblenz.de/networks/youtube-u-growth.

[5]

J. Ignacio Alvarez-Hamelin, Luca Dall’Asta, Alain Barrat, and Alessandro Vespignani. 2005. Large scale networks fingerprinting and visualization using the k-core decomposition. In Proceedings of the Advances in Neural Information Processing Systems. 41--50.

[6]

Sabeur Aridhi, Martin Brugnara, Alberto Montresor, and Yannis Velegrakis. 2016. Distributed k-core decomposition and maintenance in large dynamic graphs. In Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems (DEBS’16). Irvine, CA, June 20–24, 2016. 161--168.

Digital Library

[7]

Bahman Bahmani, Ravi Kumar, and Sergei Vassilvitskii. 2012. Densest subgraph in streaming and mapreduce. Proceedings of the VLDB Endowment 5, 5 (2012), 454--465.

Digital Library

[8]

Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049 (2003).

[9]

Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Charalampos Tsourakakis. 2015. Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing. ACM, 173--182.

Digital Library

[10]

T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, and Chenzi Zhang. 2018. Spectral properties of hypergraph laplacian and approximation algorithms. Journal of the ACM 65, 3 (2018), 15:1–15:48.

[11]

Moses Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization. Springer, 84--95.

[12]

James Cheng, Yiping Ke, Shumo Chu, and M. Tamer Özsu. 2011. Efficient core decomposition in massive networks. In Proceedings of the IEEE 27th International Conference on Data Engineering (ICDE’11). IEEE, 51--62.

Digital Library

[13]

Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National Security Agency Technical Report 16.3--1.

[14]

Maximilien Danisch, T.-H. Hubert Chan, and Mauro Sozio. 2017. Large scale density-friendly graph decomposition via convex programming. In Proceedings of the 26th International Conference on World Wide Web. Perth, Australia, April 3–7, 2017. 233--242.

Digital Library

[15]

Arnold I. Emerson, Simeon Andrews, Ikhlak Ahmed, Thasni Azis, and Joel A. Malek. 2015. K-core decomposition of a protein domain co-occurrence network reveals lower cancer mutation rates for interior cores. Journal of Clinical Bioinformatics 5, 1 (2015), 1.

[16]

Alessandro Epasto, Silvio Lattanzi, and Mauro Sozio. 2015. Efficient densest subgraph computation in evolving graphs. In Proceedings of the 24th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, 300--310.

Digital Library

[17]

Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. 2011. D-cores: Measuring collaboration of directed graphs based on degeneracy. In Proceedings of the IEEE 11th International Conference on Data Mining (ICDM’11). IEEE, 201--210.

Digital Library

[18]

Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. 2011. Evaluating cooperation in communities with the k-core structure. In Proceedings of the International Conference on Advances in Social Networks Analysis and Mining (ASONAM’11). IEEE, 87--93.

Digital Library

[19]

Patric Hagmann, Leila Cammoun, Xavier Gigandet, Reto Meuli, Christopher J. Honey, Van J. Wedeen, and Olaf Sporns. 2008. Mapping the structural core of human cerebral cortex. PLOS Biology 6, 7 (2008), 1--15.

[20]

Shuguang Hu, Xiaowei Wu, and T.-H. Hubert Chan. 2017. Maintaining densest subsets efficiently in evolving hypergraphs. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management (CIKM’17). Singapore, November 06–10, 2017. 929--938.

Digital Library

[21]

Wissam Khaouid, Marina Barsky, Venkatesh Srinivasan, and Alex Thomo. 2015. K-core decomposition of large networks on a single PC. Proceedings of the VLDB Endowment 9, 1 (2015), 13--23.

Digital Library

[22]

Ming Leng, Lingyu Sun, Ji nian Bian, and Yuchun Ma. 2013. An O(m) algorithm for cores decomposition of undirected hypergraph. Journal of Chinese Computer Systems 34, 11 (2013), 2568--2573.

[23]

Rong-Hua Li, Jeffrey Xu Yu, and Rui Mao. 2014. Efficient core maintenance in large dynamic graphs. IEEE Transactions on Knowledge and Data Engineering 26, 10 (2014), 2453--2465.

[24]

Fragkiskos Malliaros, Christos Giatsidis, Apostolos Papadopoulos, and Michalis Vazirgiannis. 2019. The core decomposition of networks: Theory, algorithms and applications. The VLDB Journal 29, 1 (2019), 61--92.

[25]

Sarah Meiklejohn, Marjori Pomarole, Grant Jordan, Kirill Levchenko, Damon McCoy, Geoffrey M. Voelker, and Stefan Savage. 2013. A fistful of bitcoins: Characterizing payments among men with no names. In Proceedings of the 2013 Conference on Internet Measurement Conference. ACM, 127--140.

Digital Library

[26]

Polykarpos Meladianos, Giannis Nikolentzos, François Rousseau, Yannis Stavrakas, and Michalis Vazirgiannis. 2015. Degeneracy-based real-time sub-event detection in Twitter stream. In Proceedings of the 9th International Conference on Web and Social Media (ICWSM’15). University of Oxford, Oxford, UK, May 26– 29, 2015. 248--257.

[27]

Alberto Montresor, Francesco De Pellegrini, and Daniele Miorandi. 2013. Distributed k-core decomposition. IEEE Transactions on Parallel and Distributed Systems 24, 2 (2013), 288--300.

Digital Library

[28]

Ahmet Erdem Saríyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, and Ümit V. Çatalyürek. 2013. Streaming algorithms for k-core decomposition. Proceedings of the VLDB Endowment 6, 6 (2013), 433--444.

Digital Library

[29]

Stephen B. Seidman. 1983. Network structure and minimum degree. Social Networks 5, 3 (1983), 269--287.

[30]

Nikolaj Tatti and Aristides Gionis. 2015. Density-friendly graph decomposition. ACM Transactions on Knowledge Discovery from Data 1, 1 (2015)1089--1099.

[31]

Shinichiro Wachi, Ken Yoneda, and Reen Wu. 2005. Interactome-transcriptome analysis reveals the high centrality of genes differentially expressed in lung cancer tissues. Bioinformatics 21, 23 (2005), 4205--4208.

Digital Library

[32]

Jia Wang and James Cheng. 2012. Truss decomposition in massive networks. Proceedings of the VLDB Endowment 5, 9 (2012), 812--823.

Digital Library

[33]

Dong Wen, Lu Qin, Ying Zhang, Xuemin Lin, and Jeffrey Xu Yu. 2016. I/O efficient core graph decomposition at web scale. In Proceedings of the 32nd IEEE International Conference on Data Engineering (ICDE’16). Helsinki, Finland, May 16–20, 2016. 133--144.

[34]

Stefan Wuchty and Eivind Almaas. 2005. Peeling the yeast protein network. Proteomics 5, 2 (2005), 444--449.

[35]

Yang Zhang and Srinivasan Parthasarathy. 2012. Extracting analyzing and visualizing triangle k-core motifs within networks. In Proceedings of the IEEE 28th International Conference on Data Engineering. IEEE, 1049--1060.

Digital Library

[36]

Yikai Zhang, Jeffrey Xu Yu, Ying Zhang, and Lu Qin. 2017. A fast order-based approach for core maintenance. In Proceedings of the IEEE 33rd International Conference on Data Engineering (ICDE’17). IEEE, 337--348.

Cited By

Tian AZhou AWang YJian XChen L(2024)Efficient Index for Temporal Core Queries over Bipartite GraphsProceedings of the VLDB Endowment10.14778/3681954.368196517:11(2813-2825)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3681965
Luo QZhang WYang ZWen DWang XYu DLin XSerra ESpezzano F(2024)Hierarchical Structure Construction on HypergraphsProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679765(1597-1606)Online publication date: 21-Oct-2024
https://dl.acm.org/doi/10.1145/3627673.3679765
Liu QShun JZablotchi ILee IChabbi MSteuwer M(2024)Parallel k-Core Decomposition with Batched Updates and Asynchronous ReadsProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638508(286-300)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638508
Show More Cited By

Index Terms

Fully Dynamic Approximate k-Core Decomposition in Hypergraphs
1. Networks
  1. Network algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Online algorithms
    2. Streaming, sublinear and near linear time algorithms

Recommendations

Strong Transversals in Hypergraphs and Double Total Domination in Graphs

Let $H$ be a 3-uniform hypergraph of order $n$ and size $m$, and let $T$ be a subset of vertices of $H$. The set $T$ is a strong transversal in $H$ if $T$ contains at least two vertices from every edge of $H$. The strong transversal number $\tau_s(H)$ ...
Erdős-Hajnal-type theorems in hypergraphs

The Erdos-Hajnal conjecture states that if a graph on n vertices is H-free, that is, it does not contain an induced copy of a given graph H, then it must contain either a clique or an independent set of size n^@d^(^H^), where @d(H)>0 depends only on the ...
On 2-Colorings of Hypergraphs

In this article, we continue the study of 2-colorings in hypergraphs. A hypergraph is 2-colorable if there is a 2-coloring of the vertices with no monochromatic hyperedge. Let Hk denote the class of all k-uniform k-regular hypergraphs. It is known see ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Knowledge Discovery from Data

ACM Transactions on Knowledge Discovery from Data Volume 14, Issue 4

August 2020

316 pages

ISSN:1556-4681

EISSN:1556-472X

DOI:10.1145/3403605

Editors:
Charu Aggarwal
IBM T. J. Watson Research, USA
,
Xindong Wu
Minginglamp Academy of Sciences, China

Issue’s Table of Contents

Copyright © 2020 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].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 May 2020

Online AM: 07 May 2020

Accepted: 01 February 2020

Revised: 01 November 2019

Received: 01 March 2019

Published in TKDD Volume 14, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Hong Kong RGC

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
710
Total Downloads

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

Reflects downloads up to 11 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Tian AZhou AWang YJian XChen L(2024)Efficient Index for Temporal Core Queries over Bipartite GraphsProceedings of the VLDB Endowment10.14778/3681954.368196517:11(2813-2825)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3681965
Luo QZhang WYang ZWen DWang XYu DLin XSerra ESpezzano F(2024)Hierarchical Structure Construction on HypergraphsProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679765(1597-1606)Online publication date: 21-Oct-2024
https://dl.acm.org/doi/10.1145/3627673.3679765
Liu QShun JZablotchi ILee IChabbi MSteuwer M(2024)Parallel k-Core Decomposition with Batched Updates and Asynchronous ReadsProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638508(286-300)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638508
Wang PWu DChen CLiu KFu YHuang JZhou YZhan JHua X(2024)Deep Adaptive Graph Clustering via von Mises-Fisher DistributionsACM Transactions on the Web10.1145/358052118:2(1-21)Online publication date: 8-Jan-2024
https://dl.acm.org/doi/10.1145/3580521
Zhang YYu JZhang YQin L(2024)Maintaining Top-$t$ Cores in Dynamic GraphsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.333263836:9(4766-4780)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1109/TKDE.2023.3332638
Hua QWang HJin HShi X(2024)Core Maintenance on Dynamic Graphs: A Distributed Approach Built on H-IndexIEEE Transactions on Big Data10.1109/TBDATA.2024.335297310:5(595-608)Online publication date: Oct-2024
https://doi.org/10.1109/TBDATA.2024.3352973
Guo BSekerinski E(2024)Simplified algorithms for order-based core maintenanceThe Journal of Supercomputing10.1007/s11227-024-06190-x80:13(19592-19623)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1007/s11227-024-06190-x
Preti GDe Francisci Morales GBonchi F(2024)Hyper-distance oracles in hypergraphsThe VLDB Journal10.1007/s00778-024-00851-233:5(1333-1356)Online publication date: 19-Apr-2024
https://doi.org/10.1007/s00778-024-00851-2
Arafat NKhan ARai AGhosh B(2023)Neighborhood-Based Hypergraph Core DecompositionProceedings of the VLDB Endowment10.14778/3598581.359858216:9(2061-2074)Online publication date: 1-May-2023
https://dl.acm.org/doi/10.14778/3598581.3598582
Hua QZhang XJin HHuang H(2023)Revisiting Core Maintenance for Dynamic HypergraphsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.323666934:3(981-994)Online publication date: 1-Mar-2023
https://doi.org/10.1109/TPDS.2023.3236669
Show More Cited By

View Options

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 Article

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 Issue’s Table of Contents