基于超距离的超网络比较方法。

IF 2.7 2区 数学 Q1 MATHEMATICS, APPLIED Chaos Pub Date : 2024-08-01 DOI:10.1063/5.0221267
Ruonan Feng, Tao Xu, Xiaowen Xie, Zi-Ke Zhang, Chuang Liu, Xiu-Xiu Zhan
{"title":"基于超距离的超网络比较方法。","authors":"Ruonan Feng, Tao Xu, Xiaowen Xie, Zi-Ke Zhang, Chuang Liu, Xiu-Xiu Zhan","doi":"10.1063/5.0221267","DOIUrl":null,"url":null,"abstract":"<p><p>Hypernetwork is a useful way to depict multiple connections between nodes, making it an ideal tool for representing complex relationships in network science. In recent years, there has been a marked increase in studies on hypernetworks; however, the comparison of the difference between two hypernetworks has received less attention. This paper proposes a hyper-distance (HD)-based method for comparing hypernetworks. The method is based on higher-order information, i.e, the higher-order distance between nodes and Jensen-Shannon divergence. Experiments carried out on synthetic hypernetworks have shown that HD is capable of distinguishing between hypernetworks generated with different parameters, and it is successful in the classification of hypernetworks. Furthermore, HD outperforms current state-of-the-art baselines to distinguish empirical hypernetworks when hyperedges are randomly perturbed.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":null,"pages":null},"PeriodicalIF":2.7000,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A hyper-distance-based method for hypernetwork comparison.\",\"authors\":\"Ruonan Feng, Tao Xu, Xiaowen Xie, Zi-Ke Zhang, Chuang Liu, Xiu-Xiu Zhan\",\"doi\":\"10.1063/5.0221267\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Hypernetwork is a useful way to depict multiple connections between nodes, making it an ideal tool for representing complex relationships in network science. In recent years, there has been a marked increase in studies on hypernetworks; however, the comparison of the difference between two hypernetworks has received less attention. This paper proposes a hyper-distance (HD)-based method for comparing hypernetworks. The method is based on higher-order information, i.e, the higher-order distance between nodes and Jensen-Shannon divergence. Experiments carried out on synthetic hypernetworks have shown that HD is capable of distinguishing between hypernetworks generated with different parameters, and it is successful in the classification of hypernetworks. Furthermore, HD outperforms current state-of-the-art baselines to distinguish empirical hypernetworks when hyperedges are randomly perturbed.</p>\",\"PeriodicalId\":9974,\"journal\":{\"name\":\"Chaos\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.7000,\"publicationDate\":\"2024-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chaos\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1063/5.0221267\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1063/5.0221267","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

超网络(Hypernetwork)是描述节点间多重连接的有效方法,是网络科学中表示复杂关系的理想工具。近年来,有关超网络的研究明显增多,但比较两个超网络之间的差异却较少受到关注。本文提出了一种基于超距离(HD)的超网络比较方法。该方法基于高阶信息,即节点间的高阶距离和詹森-香农分歧。在合成超网络上进行的实验表明,HD 能够区分由不同参数生成的超网络,并能成功地对超网络进行分类。此外,当超边缘受到随机扰动时,HD 在区分经验超网络方面的表现优于目前最先进的基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A hyper-distance-based method for hypernetwork comparison.

Hypernetwork is a useful way to depict multiple connections between nodes, making it an ideal tool for representing complex relationships in network science. In recent years, there has been a marked increase in studies on hypernetworks; however, the comparison of the difference between two hypernetworks has received less attention. This paper proposes a hyper-distance (HD)-based method for comparing hypernetworks. The method is based on higher-order information, i.e, the higher-order distance between nodes and Jensen-Shannon divergence. Experiments carried out on synthetic hypernetworks have shown that HD is capable of distinguishing between hypernetworks generated with different parameters, and it is successful in the classification of hypernetworks. Furthermore, HD outperforms current state-of-the-art baselines to distinguish empirical hypernetworks when hyperedges are randomly perturbed.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Chaos
Chaos 物理-物理:数学物理
CiteScore
5.20
自引率
13.80%
发文量
448
审稿时长
2.3 months
期刊介绍: Chaos: An Interdisciplinary Journal of Nonlinear Science is a peer-reviewed journal devoted to increasing the understanding of nonlinear phenomena and describing the manifestations in a manner comprehensible to researchers from a broad spectrum of disciplines.
期刊最新文献
Bifurcation analysis of a two-neuron central pattern generator model for both oscillatory and convergent neuronal activities. Dynamics and control of two-dimensional discrete-time biological model incorporating weak Allee's effect. Evolution of trust in N-player trust games with loss assessment. Experimental studies of spiral wave teleportation in a light sensitive Belousov-Zhabotinsky system. Resilience of weighted networks with dynamical behavior against multi-node removal.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1