超越聚类系数:复杂网络中节点邻域的拓扑分析

Q1 Mathematics
Alexander P. Kartun-Giles , Ginestra Bianconi
{"title":"超越聚类系数:复杂网络中节点邻域的拓扑分析","authors":"Alexander P. Kartun-Giles ,&nbsp;Ginestra Bianconi","doi":"10.1016/j.csfx.2019.100004","DOIUrl":null,"url":null,"abstract":"<div><p>In Network Science, node neighbourhoods, also called ego-centered networks, have attracted significant attention. In particular the clustering coefficient has been extensively used to measure their local cohesiveness. In this paper, we show how, given two nodes with the same clustering coefficient, the topology of their neighbourhoods can be significantly different, which demonstrates the need to go beyond this simple characterization. We perform a large scale statistical analysis of the topology of node neighbourhoods of real networks by first constructing their clique complexes, and then computing their Betti numbers. We are able to show significant differences between the topology of node neighbourhoods of real networks and the stochastic topology of null models of random simplicial complexes revealing local organisation principles of the node neighbourhoods. Moreover we observe that a large scale statistical analysis of the topological properties of node neighbourhoods is able to clearly discriminate between power-law networks, and planar road networks.</p></div>","PeriodicalId":37147,"journal":{"name":"Chaos, Solitons and Fractals: X","volume":"1 ","pages":"Article 100004"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.csfx.2019.100004","citationCount":"50","resultStr":"{\"title\":\"Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks\",\"authors\":\"Alexander P. Kartun-Giles ,&nbsp;Ginestra Bianconi\",\"doi\":\"10.1016/j.csfx.2019.100004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In Network Science, node neighbourhoods, also called ego-centered networks, have attracted significant attention. In particular the clustering coefficient has been extensively used to measure their local cohesiveness. In this paper, we show how, given two nodes with the same clustering coefficient, the topology of their neighbourhoods can be significantly different, which demonstrates the need to go beyond this simple characterization. We perform a large scale statistical analysis of the topology of node neighbourhoods of real networks by first constructing their clique complexes, and then computing their Betti numbers. We are able to show significant differences between the topology of node neighbourhoods of real networks and the stochastic topology of null models of random simplicial complexes revealing local organisation principles of the node neighbourhoods. Moreover we observe that a large scale statistical analysis of the topological properties of node neighbourhoods is able to clearly discriminate between power-law networks, and planar road networks.</p></div>\",\"PeriodicalId\":37147,\"journal\":{\"name\":\"Chaos, Solitons and Fractals: X\",\"volume\":\"1 \",\"pages\":\"Article 100004\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.csfx.2019.100004\",\"citationCount\":\"50\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chaos, Solitons and Fractals: X\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S259005441930003X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos, Solitons and Fractals: X","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S259005441930003X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 50

摘要

在网络科学中,节点社区,也被称为以自我为中心的网络,引起了极大的关注。特别是聚类系数被广泛用于测量它们的局部内聚性。在本文中,我们展示了,给定两个具有相同聚类系数的节点,它们的邻居的拓扑结构如何显著不同,这表明需要超越这种简单的表征。我们首先构造了真实网络的团复合体,然后计算了它们的贝蒂数,从而对其节点邻域的拓扑结构进行了大规模的统计分析。我们能够显示出真实网络的节点邻域拓扑与随机简单复体的零模型的随机拓扑之间的显著差异,揭示了节点邻域的局部组织原理。此外,我们观察到节点邻域拓扑特性的大规模统计分析能够清楚地区分幂律网络和平面道路网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks

In Network Science, node neighbourhoods, also called ego-centered networks, have attracted significant attention. In particular the clustering coefficient has been extensively used to measure their local cohesiveness. In this paper, we show how, given two nodes with the same clustering coefficient, the topology of their neighbourhoods can be significantly different, which demonstrates the need to go beyond this simple characterization. We perform a large scale statistical analysis of the topology of node neighbourhoods of real networks by first constructing their clique complexes, and then computing their Betti numbers. We are able to show significant differences between the topology of node neighbourhoods of real networks and the stochastic topology of null models of random simplicial complexes revealing local organisation principles of the node neighbourhoods. Moreover we observe that a large scale statistical analysis of the topological properties of node neighbourhoods is able to clearly discriminate between power-law networks, and planar road networks.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Chaos, Solitons and Fractals: X
Chaos, Solitons and Fractals: X Mathematics-Mathematics (all)
CiteScore
5.00
自引率
0.00%
发文量
15
审稿时长
20 weeks
×
引用
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学术官方微信