Cohesive Subgraph Discovery in Hypergraphs: A Locality-Driven Indexing Framework
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911341793509376 |
|---|---|
| author | Kim, Song Kim, Dahee Han, Taejoon Kim, Junghoon Jeong, Hyun Ji Kim, Jungeun |
| author_facet | Kim, Song Kim, Dahee Han, Taejoon Kim, Junghoon Jeong, Hyun Ji Kim, Jungeun |
| contents | Hypergraphs, increasingly utilised for modelling complex and diverse relationships in modern networks, gain much attention representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery is one of the fundamental problems and offers deep insights into these structures, yet the task of selecting appropriate parameters is an open question. To handle that question, we aim to design an efficient indexing structure to retrieve cohesive subgraphs in an online manner. The main idea is to enable the discovery of corresponding structures within a reasonable time without the need for exhaustive graph traversals. This work can facilitate efficient and informed decision-making in diverse applications based on a comprehensive understanding of the entire network landscape. Through extensive experiments on real-world networks, we demonstrate the superiority of our proposed indexing technique. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_12523 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Cohesive Subgraph Discovery in Hypergraphs: A Locality-Driven Indexing Framework Kim, Song Kim, Dahee Han, Taejoon Kim, Junghoon Jeong, Hyun Ji Kim, Jungeun Social and Information Networks Hypergraphs, increasingly utilised for modelling complex and diverse relationships in modern networks, gain much attention representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery is one of the fundamental problems and offers deep insights into these structures, yet the task of selecting appropriate parameters is an open question. To handle that question, we aim to design an efficient indexing structure to retrieve cohesive subgraphs in an online manner. The main idea is to enable the discovery of corresponding structures within a reasonable time without the need for exhaustive graph traversals. This work can facilitate efficient and informed decision-making in diverse applications based on a comprehensive understanding of the entire network landscape. Through extensive experiments on real-world networks, we demonstrate the superiority of our proposed indexing technique. |
| title | Cohesive Subgraph Discovery in Hypergraphs: A Locality-Driven Indexing Framework |
| topic | Social and Information Networks |
| url | https://arxiv.org/abs/2502.12523 |