超图上的信息传递:可探测性、相变和高阶信息

IF 2.2 3区 物理与天体物理 Q2 MECHANICS
Nicolò Ruggeri, Alessandro Lonardi and Caterina De Bacco
{"title":"超图上的信息传递:可探测性、相变和高阶信息","authors":"Nicolò Ruggeri, Alessandro Lonardi and Caterina De Bacco","doi":"10.1088/1742-5468/ad343b","DOIUrl":null,"url":null,"abstract":"Hypergraphs are widely adopted tools to examine systems with higher-order interactions. Despite recent advancements in methods for community detection in these systems, we still lack a theoretical analysis of their detectability limits. Here, we derive closed-form bounds for community detection in hypergraphs. Using a message-passing formulation, we demonstrate that detectability depends on the hypergraphs’ structural properties, such as the distribution of hyperedge sizes or their assortativity. Our formulation enables a characterization of the entropy of a hypergraph in relation to that of its clique expansion, showing that community detection is enhanced when hyperedges highly overlap on pairs of nodes. We develop an efficient message-passing algorithm to learn communities and model parameters on large systems. Additionally, we devise an exact sampling routine to generate synthetic data from our probabilistic model. Using these methods, we numerically investigate the boundaries of community detection in synthetic datasets, and extract communities from real systems. Our results extend our understanding of the limits of community detection in hypergraphs and introduce flexible mathematical tools to study systems with higher-order interactions.","PeriodicalId":17207,"journal":{"name":"Journal of Statistical Mechanics: Theory and Experiment","volume":"28 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Message-passing on hypergraphs: detectability, phase transitions and higher-order information\",\"authors\":\"Nicolò Ruggeri, Alessandro Lonardi and Caterina De Bacco\",\"doi\":\"10.1088/1742-5468/ad343b\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hypergraphs are widely adopted tools to examine systems with higher-order interactions. Despite recent advancements in methods for community detection in these systems, we still lack a theoretical analysis of their detectability limits. Here, we derive closed-form bounds for community detection in hypergraphs. Using a message-passing formulation, we demonstrate that detectability depends on the hypergraphs’ structural properties, such as the distribution of hyperedge sizes or their assortativity. Our formulation enables a characterization of the entropy of a hypergraph in relation to that of its clique expansion, showing that community detection is enhanced when hyperedges highly overlap on pairs of nodes. We develop an efficient message-passing algorithm to learn communities and model parameters on large systems. Additionally, we devise an exact sampling routine to generate synthetic data from our probabilistic model. Using these methods, we numerically investigate the boundaries of community detection in synthetic datasets, and extract communities from real systems. Our results extend our understanding of the limits of community detection in hypergraphs and introduce flexible mathematical tools to study systems with higher-order interactions.\",\"PeriodicalId\":17207,\"journal\":{\"name\":\"Journal of Statistical Mechanics: Theory and Experiment\",\"volume\":\"28 1\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Statistical Mechanics: Theory and Experiment\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.1088/1742-5468/ad343b\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MECHANICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Statistical Mechanics: Theory and Experiment","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1088/1742-5468/ad343b","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MECHANICS","Score":null,"Total":0}
引用次数: 0

摘要

超图是研究具有高阶交互作用的系统时广泛采用的工具。尽管最近这些系统中的群落检测方法取得了进步,但我们仍然缺乏对其可检测性极限的理论分析。在这里,我们推导出了超图中群落检测的闭式边界。通过使用消息传递公式,我们证明了可探测性取决于超图的结构属性,如超边大小的分布或它们的同类性。我们的表述能够描述超图的熵与其簇展开的熵的关系,表明当超图在节点对上高度重叠时,群落检测能力会增强。我们开发了一种高效的信息传递算法,用于学习大型系统中的群落和模型参数。此外,我们还设计了一种精确采样程序,以便从概率模型中生成合成数据。利用这些方法,我们对合成数据集中的群落检测边界进行了数值研究,并从真实系统中提取了群落。我们的研究结果拓展了我们对超图中群落检测极限的理解,并为研究具有高阶交互作用的系统引入了灵活的数学工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Message-passing on hypergraphs: detectability, phase transitions and higher-order information
Hypergraphs are widely adopted tools to examine systems with higher-order interactions. Despite recent advancements in methods for community detection in these systems, we still lack a theoretical analysis of their detectability limits. Here, we derive closed-form bounds for community detection in hypergraphs. Using a message-passing formulation, we demonstrate that detectability depends on the hypergraphs’ structural properties, such as the distribution of hyperedge sizes or their assortativity. Our formulation enables a characterization of the entropy of a hypergraph in relation to that of its clique expansion, showing that community detection is enhanced when hyperedges highly overlap on pairs of nodes. We develop an efficient message-passing algorithm to learn communities and model parameters on large systems. Additionally, we devise an exact sampling routine to generate synthetic data from our probabilistic model. Using these methods, we numerically investigate the boundaries of community detection in synthetic datasets, and extract communities from real systems. Our results extend our understanding of the limits of community detection in hypergraphs and introduce flexible mathematical tools to study systems with higher-order interactions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.50
自引率
12.50%
发文量
210
审稿时长
1.0 months
期刊介绍: JSTAT is targeted to a broad community interested in different aspects of statistical physics, which are roughly defined by the fields represented in the conferences called ''Statistical Physics''. Submissions from experimentalists working on all the topics which have some ''connection to statistical physics are also strongly encouraged. The journal covers different topics which correspond to the following keyword sections. 1. Quantum statistical physics, condensed matter, integrable systems Scientific Directors: Eduardo Fradkin and Giuseppe Mussardo 2. Classical statistical mechanics, equilibrium and non-equilibrium Scientific Directors: David Mukamel, Matteo Marsili and Giuseppe Mussardo 3. Disordered systems, classical and quantum Scientific Directors: Eduardo Fradkin and Riccardo Zecchina 4. Interdisciplinary statistical mechanics Scientific Directors: Matteo Marsili and Riccardo Zecchina 5. Biological modelling and information Scientific Directors: Matteo Marsili, William Bialek and Riccardo Zecchina
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信