图裂变的模性下界

J. Roth
{"title":"图裂变的模性下界","authors":"J. Roth","doi":"10.1109/IEEECONF44664.2019.9048934","DOIUrl":null,"url":null,"abstract":"Among the tools available for analysis of manifold data in modern signal processing is the popular modularity method. Hugely successful, modularity is not without its degeneracies, specifically with regard to its ability to observe smaller community structure in larger contexts. A body of work has been built around this so-called resolution limit of modularity. However, the current analytical bounds do not describe the resolution limit in the context of single-cut graph fission. In this paper, we present a new resolution limit to this end and show its effect on both synthetic and real-world networks.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"23 1","pages":"353-357"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Lower Bound of Modularity for Graph Fission\",\"authors\":\"J. Roth\",\"doi\":\"10.1109/IEEECONF44664.2019.9048934\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Among the tools available for analysis of manifold data in modern signal processing is the popular modularity method. Hugely successful, modularity is not without its degeneracies, specifically with regard to its ability to observe smaller community structure in larger contexts. A body of work has been built around this so-called resolution limit of modularity. However, the current analytical bounds do not describe the resolution limit in the context of single-cut graph fission. In this paper, we present a new resolution limit to this end and show its effect on both synthetic and real-world networks.\",\"PeriodicalId\":6684,\"journal\":{\"name\":\"2019 53rd Asilomar Conference on Signals, Systems, and Computers\",\"volume\":\"23 1\",\"pages\":\"353-357\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 53rd Asilomar Conference on Signals, Systems, and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEECONF44664.2019.9048934\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEECONF44664.2019.9048934","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在现代信号处理中,可用于分析流形数据的工具之一是流行的模块化方法。模块化取得了巨大的成功,但它并非没有退化,特别是它在更大的环境中观察较小社区结构的能力。围绕这个所谓的模块化的分辨率限制已经建立了大量的工作。然而,目前的解析界并没有描述单切图裂变情况下的分辨率极限。在本文中,我们为此提出了一个新的分辨率限制,并展示了它对合成和现实网络的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the Lower Bound of Modularity for Graph Fission
Among the tools available for analysis of manifold data in modern signal processing is the popular modularity method. Hugely successful, modularity is not without its degeneracies, specifically with regard to its ability to observe smaller community structure in larger contexts. A body of work has been built around this so-called resolution limit of modularity. However, the current analytical bounds do not describe the resolution limit in the context of single-cut graph fission. In this paper, we present a new resolution limit to this end and show its effect on both synthetic and real-world networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信