简单网络中的阻力距离

Ming-Zhang Zhu, Wanyue Xu, Zhongzhi Zhang, Haibin Kan, Guanrong Chen
{"title":"简单网络中的阻力距离","authors":"Ming-Zhang Zhu, Wanyue Xu, Zhongzhi Zhang, Haibin Kan, Guanrong Chen","doi":"10.48550/arXiv.2212.05759","DOIUrl":null,"url":null,"abstract":"It is well known that in many real networks, such as brain networks and scientific collaboration networks, there exist higher-order nonpairwise relations among nodes, i.e., interactions between among than two nodes at a time. This simplicial structure can be described by simplicial complexes and has an important effect on topological and dynamical properties of networks involving such group interactions. In this paper, we study analytically resistance distances in iteratively growing networks with higher-order interactions characterized by the simplicial structure that is controlled by a parameter q. We derive exact formulas for interesting quantities about resistance distances, including Kirchhoff index, additive degree-Kirchhoff index, multiplicative degree-Kirchhoff index, as well as average resistance distance, which have found applications in various areas elsewhere. We show that the average resistance distance tends to a q-dependent constant, indicating the impact of simplicial organization on the structural robustness measured by average resistance distance.","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"26 1","pages":"1922-1935"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Resistance Distances in Simplicial Networks\",\"authors\":\"Ming-Zhang Zhu, Wanyue Xu, Zhongzhi Zhang, Haibin Kan, Guanrong Chen\",\"doi\":\"10.48550/arXiv.2212.05759\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is well known that in many real networks, such as brain networks and scientific collaboration networks, there exist higher-order nonpairwise relations among nodes, i.e., interactions between among than two nodes at a time. This simplicial structure can be described by simplicial complexes and has an important effect on topological and dynamical properties of networks involving such group interactions. In this paper, we study analytically resistance distances in iteratively growing networks with higher-order interactions characterized by the simplicial structure that is controlled by a parameter q. We derive exact formulas for interesting quantities about resistance distances, including Kirchhoff index, additive degree-Kirchhoff index, multiplicative degree-Kirchhoff index, as well as average resistance distance, which have found applications in various areas elsewhere. We show that the average resistance distance tends to a q-dependent constant, indicating the impact of simplicial organization on the structural robustness measured by average resistance distance.\",\"PeriodicalId\":21872,\"journal\":{\"name\":\"South Afr. Comput. J.\",\"volume\":\"26 1\",\"pages\":\"1922-1935\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"South Afr. Comput. J.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2212.05759\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"South Afr. Comput. J.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2212.05759","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

众所周知,在许多现实网络中,如大脑网络和科学协作网络,节点之间存在高阶非成对关系,即同时存在两个以上节点之间的相互作用。这种简单结构可以用简单配合物来描述,并且对涉及这种群相互作用的网络的拓扑和动力学性质有重要影响。在本文中,我们解析地研究了具有由参数q控制的简单结构的高阶相互作用的迭代增长网络中的电阻距离。我们导出了关于电阻距离的有趣量的精确公式,包括Kirchhoff指数,加性度-Kirchhoff指数,乘性度-Kirchhoff指数以及平均电阻距离,这些公式在其他各个领域都有应用。我们发现平均阻力距离趋向于q依赖常数,表明简单组织对平均阻力距离测量的结构鲁棒性的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Resistance Distances in Simplicial Networks
It is well known that in many real networks, such as brain networks and scientific collaboration networks, there exist higher-order nonpairwise relations among nodes, i.e., interactions between among than two nodes at a time. This simplicial structure can be described by simplicial complexes and has an important effect on topological and dynamical properties of networks involving such group interactions. In this paper, we study analytically resistance distances in iteratively growing networks with higher-order interactions characterized by the simplicial structure that is controlled by a parameter q. We derive exact formulas for interesting quantities about resistance distances, including Kirchhoff index, additive degree-Kirchhoff index, multiplicative degree-Kirchhoff index, as well as average resistance distance, which have found applications in various areas elsewhere. We show that the average resistance distance tends to a q-dependent constant, indicating the impact of simplicial organization on the structural robustness measured by average resistance distance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Taylor Sun Flower Optimization-Based Compressive Sensing for Image Compression and Recovery Special Issue on Failed Approaches and Insightful Losses in Cryptology - Foreword Role of Machine Learning on Key Extraction for Data Privacy Preservation of Health Care Sectors in IoT Environment Incorrectly Generated RSA Keys: How I Learned To Stop Worrying And Recover Lost Plaintexts Smart Multimedia Compressor - Intelligent Algorithms for Text and Image Compression
×
引用
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