基于时序图案的复杂时序网络可控性新方法

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Yan Jin, Peyman Arebi
{"title":"基于时序图案的复杂时序网络可控性新方法","authors":"Yan Jin,&nbsp;Peyman Arebi","doi":"10.1002/cpe.8278","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Complex temporal networks have become instrumental in modeling dynamic systems across various disciplines, presenting unique challenges and opportunities in understanding and influencing their behavior. Controllability, a fundamental aspect of network dynamics, plays a pivotal role in manipulating these systems towards desired states. Temporal motifs are important patterns in temporal complex networks that have many applications in solving problems related to this type of networks. In this paper, a novel method for controlling temporal complex networks using temporal motifs is proposed. First, the most important effective temporal motifs in the controllability processes of complex networks have been identified and it has been shown that the network can be fully controlled using these temporal motifs. Then, an algorithm for extracting temporal motifs is proposed. This algorithm has been proposed to identify effective temporal motifs in network controllability to optimally identify control nodes. To increase the efficiency of extracting temporal motifs, a method for predicting the temporal motif-based link has been proposed, which predicts temporal motifs. The results of the simulation of the proposed method based on temporal motifs and its implementation on real-world temporal complex networks demonstrates that its performance was better than the conventional controllability methods.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel controllability method on complex temporal networks based on temporal motifs\",\"authors\":\"Yan Jin,&nbsp;Peyman Arebi\",\"doi\":\"10.1002/cpe.8278\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Complex temporal networks have become instrumental in modeling dynamic systems across various disciplines, presenting unique challenges and opportunities in understanding and influencing their behavior. Controllability, a fundamental aspect of network dynamics, plays a pivotal role in manipulating these systems towards desired states. Temporal motifs are important patterns in temporal complex networks that have many applications in solving problems related to this type of networks. In this paper, a novel method for controlling temporal complex networks using temporal motifs is proposed. First, the most important effective temporal motifs in the controllability processes of complex networks have been identified and it has been shown that the network can be fully controlled using these temporal motifs. Then, an algorithm for extracting temporal motifs is proposed. This algorithm has been proposed to identify effective temporal motifs in network controllability to optimally identify control nodes. To increase the efficiency of extracting temporal motifs, a method for predicting the temporal motif-based link has been proposed, which predicts temporal motifs. The results of the simulation of the proposed method based on temporal motifs and its implementation on real-world temporal complex networks demonstrates that its performance was better than the conventional controllability methods.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"36 27\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2024-10-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8278\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8278","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

复杂时态网络已成为各学科动态系统建模的重要工具,为理解和影响这些系统的行为带来了独特的挑战和机遇。可控性是网络动力学的一个基本方面,在操纵这些系统实现理想状态方面发挥着关键作用。时态图案是时态复杂网络中的重要模式,在解决与这类网络相关的问题时有很多应用。本文提出了一种利用时态图案控制时态复杂网络的新方法。首先,确定了复杂网络可控性过程中最重要的有效时态图案,并证明利用这些时态图案可以完全控制网络。然后,提出了一种提取时空图案的算法。该算法旨在识别网络可控性中的有效时序图案,从而优化识别控制节点。为了提高提取时空主题的效率,提出了一种基于时空主题的链接预测方法,该方法可预测时空主题。对所提出的基于时态图案的方法进行了仿真,并在现实世界的时态复杂网络上进行了实施,结果表明其性能优于传统的可控性方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel controllability method on complex temporal networks based on temporal motifs

Complex temporal networks have become instrumental in modeling dynamic systems across various disciplines, presenting unique challenges and opportunities in understanding and influencing their behavior. Controllability, a fundamental aspect of network dynamics, plays a pivotal role in manipulating these systems towards desired states. Temporal motifs are important patterns in temporal complex networks that have many applications in solving problems related to this type of networks. In this paper, a novel method for controlling temporal complex networks using temporal motifs is proposed. First, the most important effective temporal motifs in the controllability processes of complex networks have been identified and it has been shown that the network can be fully controlled using these temporal motifs. Then, an algorithm for extracting temporal motifs is proposed. This algorithm has been proposed to identify effective temporal motifs in network controllability to optimally identify control nodes. To increase the efficiency of extracting temporal motifs, a method for predicting the temporal motif-based link has been proposed, which predicts temporal motifs. The results of the simulation of the proposed method based on temporal motifs and its implementation on real-world temporal complex networks demonstrates that its performance was better than the conventional controllability methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术官方微信