返回
Community detection in large hypergraphs
DOI:10.1126/sciadv.adg9159.png)
摘要
En 中文
Hypergraphs, describing networks where interactions take place among any number of units, are a natural tool to model many real-world social and biological systems. Here, we propose a principled framework to model the organization of higher-order data. Our approach recovers community structure with accuracy exceeding that of currently available state-of-the-art algorithms, as tested in synthetic benchmarks with both hard and overlapping ground-truth partitions. Our model is flexible and allows capturing both assortative and disassortative community structures. Moreover, our method scales orders of magnitude faster than competing algorithms, making it suitable for the analysis of very large hypergraphs, containing millions of nodes and interactions among thousands of nodes. Our work constitutes a practical and general tool for hypergraph analysis, broadening our understanding of the organization of real-world higher-order systems.
Keyword:
HIGHER-ORDER INTERACTIONS
COMPLEX
RECOVERY
NETWORKS
DYNAMICS
MODELS
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.5
论文数:
2.1W
被引数:
18.1W
机构
引用论文
Generative hypergraph clustering: From blockmodels to modularity生成式超图聚类: 从块模型到模块化
SCIENCE ADVANCES
IF12.5
Exact and sampling methods for mining higher-order motifs in large hypergraphs在大型超图中挖掘高阶图案的精确和采样方法
COMPUTING
IF2.8

