New Discovery of the Emergence Mechanism of High Clustering Coefficients

IF 1.7 4区 工程技术 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Complexity Pub Date : 2024-12-19 DOI:10.1155/cplx/1039752
Jun Ying, Chuankui Yan, Shouyan Wu
{"title":"New Discovery of the Emergence Mechanism of High Clustering Coefficients","authors":"Jun Ying,&nbsp;Chuankui Yan,&nbsp;Shouyan Wu","doi":"10.1155/cplx/1039752","DOIUrl":null,"url":null,"abstract":"<div>\n <p>In our statistical analysis, we have discovered that the distance distribution (referring to Euclidean distance) of many real networks follows certain patterns, especially the distances between connected nodes obey a scale-free distribution. However, the classic BA model does not exhibit this characteristic. Furthermore, existing network models are mostly evolved based on degree-preference mechanisms, without considering the potential influence of factors such as edge weights like spatial geographical factors on node-edge connections in real networks. Taking distance-weighted preferences as an example, this study proposes a network evolution model based on distance preference connections as the fundamental mechanism. By applying probability theory and mean-field theory, the model’s degree distribution is calculated to be exponential, with a clustering coefficient greater than that of the BA model and consistent with data from some real networks. Our model reveals that this distance preference mechanism may be the fundamental mechanism underlying the emergence of high clustering in real networks. Additionally, by incorporating degree-preference connection mechanisms, the model is further analyzed and improved to better match actual network evolution behaviors. The research results provide a possible explanation for resolving the controversy surrounding the scale-free nature of networks.</p>\n </div>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2024 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/cplx/1039752","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/cplx/1039752","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In our statistical analysis, we have discovered that the distance distribution (referring to Euclidean distance) of many real networks follows certain patterns, especially the distances between connected nodes obey a scale-free distribution. However, the classic BA model does not exhibit this characteristic. Furthermore, existing network models are mostly evolved based on degree-preference mechanisms, without considering the potential influence of factors such as edge weights like spatial geographical factors on node-edge connections in real networks. Taking distance-weighted preferences as an example, this study proposes a network evolution model based on distance preference connections as the fundamental mechanism. By applying probability theory and mean-field theory, the model’s degree distribution is calculated to be exponential, with a clustering coefficient greater than that of the BA model and consistent with data from some real networks. Our model reveals that this distance preference mechanism may be the fundamental mechanism underlying the emergence of high clustering in real networks. Additionally, by incorporating degree-preference connection mechanisms, the model is further analyzed and improved to better match actual network evolution behaviors. The research results provide a possible explanation for resolving the controversy surrounding the scale-free nature of networks.

Abstract Image

高聚类系数出现机制的新发现
在统计分析中,我们发现许多真实网络的距离分布(指欧氏距离)都遵循一定的规律,尤其是连接节点之间的距离服从无标度分布。然而,经典的 BA 模型却没有表现出这一特征。此外,现有的网络模型大多是基于度偏好机制演化而来的,没有考虑到边缘权重等因素对真实网络中节点-边缘连接的潜在影响,如空间地理因素。本研究以距离加权偏好为例,提出了以距离偏好连接为基本机制的网络演化模型。通过应用概率论和均场论,计算出该模型的度分布为指数分布,聚类系数大于 BA 模型,并与一些真实网络的数据相一致。我们的模型揭示了这种距离偏好机制可能是真实网络中出现高聚类的基本机制。此外,通过结合程度偏好连接机制,我们进一步分析和改进了模型,使其更符合实际的网络演化行为。研究成果为解决围绕网络无标度性质的争议提供了可能的解释。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Complexity
Complexity 综合性期刊-数学跨学科应用
CiteScore
5.80
自引率
4.30%
发文量
595
审稿时长
>12 weeks
期刊介绍: Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.
×
引用
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学术官方微信