功能网络生长过程中一定的复杂性阈值

IF 2.6 3区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
A. Gecow
{"title":"功能网络生长过程中一定的复杂性阈值","authors":"A. Gecow","doi":"10.1109/CANS.2008.16","DOIUrl":null,"url":null,"abstract":"Certain threshold on network size axis was observed in statistical mechanisms of adaptive evolution. Now it is investigated. This threshold is connected with maturation of chaos and lies far above the critical point of percolation. It can be treated as complexity threshold defining the term 'complex network' for Kauffman chaotic networks. Distributions of damage size are obtained using simulation for a representative set of network parameters and network types (including scale-free, RBN and networks with more than two signal variants) for network sizes up to 4000 nodes. Based on them a criterion of the threshold is sought. We do not find any critical point in the investigated area, however a certain practical criterion is proposed. It is zero occurrence in-between two peaks of damage size frequency - left of real fadeout of damage which is ordered behaviour and right of equilibrium level after damage avalanche which is chaotic behaviour.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"47 1","pages":"69-76"},"PeriodicalIF":2.6000,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Certain Complexity Threshold during Growth of Functioning Networks\",\"authors\":\"A. Gecow\",\"doi\":\"10.1109/CANS.2008.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Certain threshold on network size axis was observed in statistical mechanisms of adaptive evolution. Now it is investigated. This threshold is connected with maturation of chaos and lies far above the critical point of percolation. It can be treated as complexity threshold defining the term 'complex network' for Kauffman chaotic networks. Distributions of damage size are obtained using simulation for a representative set of network parameters and network types (including scale-free, RBN and networks with more than two signal variants) for network sizes up to 4000 nodes. Based on them a criterion of the threshold is sought. We do not find any critical point in the investigated area, however a certain practical criterion is proposed. It is zero occurrence in-between two peaks of damage size frequency - left of real fadeout of damage which is ordered behaviour and right of equilibrium level after damage avalanche which is chaotic behaviour.\",\"PeriodicalId\":50026,\"journal\":{\"name\":\"Journal of Systems Science & Complexity\",\"volume\":\"47 1\",\"pages\":\"69-76\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2008-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Systems Science & Complexity\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1109/CANS.2008.16\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Systems Science & Complexity","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1109/CANS.2008.16","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 2

摘要

在适应进化的统计机制中,网络大小轴存在一定的阈值。现在正在进行调查。这一阈值与混沌的成熟有关,远高于渗流临界点。它可以作为复杂性阈值来定义考夫曼混沌网络中的“复杂网络”。通过对网络规模达4000个节点的网络参数和网络类型(包括无标度、RBN和具有两个以上信号变体的网络)的一组代表性网络参数和网络类型的模拟,获得了损伤大小的分布。在此基础上寻求阈值的标准。我们在研究区域没有发现任何临界点,但提出了一定的实用标准。损伤大小频率的两个峰值之间为零——损伤真实消退的左边为有序行为,损伤雪崩后平衡水平的右边为混沌行为。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Certain Complexity Threshold during Growth of Functioning Networks
Certain threshold on network size axis was observed in statistical mechanisms of adaptive evolution. Now it is investigated. This threshold is connected with maturation of chaos and lies far above the critical point of percolation. It can be treated as complexity threshold defining the term 'complex network' for Kauffman chaotic networks. Distributions of damage size are obtained using simulation for a representative set of network parameters and network types (including scale-free, RBN and networks with more than two signal variants) for network sizes up to 4000 nodes. Based on them a criterion of the threshold is sought. We do not find any critical point in the investigated area, however a certain practical criterion is proposed. It is zero occurrence in-between two peaks of damage size frequency - left of real fadeout of damage which is ordered behaviour and right of equilibrium level after damage avalanche which is chaotic behaviour.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Systems Science & Complexity
Journal of Systems Science & Complexity 数学-数学跨学科应用
CiteScore
3.80
自引率
9.50%
发文量
90
审稿时长
6-12 weeks
期刊介绍: The Journal of Systems Science and Complexity is dedicated to publishing high quality papers on mathematical theories, methodologies, and applications of systems science and complexity science. It encourages fundamental research into complex systems and complexity and fosters cross-disciplinary approaches to elucidate the common mathematical methods that arise in natural, artificial, and social systems. Topics covered are: complex systems, systems control, operations research for complex systems, economic and financial systems analysis, statistics and data science, computer mathematics, systems security, coding theory and crypto-systems, other topics related to systems science.
×
引用
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学术官方微信