Generating random complex networks with network motifs using evolutionary algorithm-based null model

被引:0
作者
Mursa, Bogdan-Eduard-Madalin [1 ]
Andreica, Anca [1 ]
机构
[1] Babes Bolyai Univ, Fac Math & Comp Sci, Cluj Napoca, Romania
关键词
Complex networks; Dynamic networks; Network generator; Network motifs; Topology; DISCOVERY; INTERNET;
D O I
10.1016/j.swevo.2024.101526
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Network motifs in complex networks signify critical patterns of connections essential for deciphering system dynamics. Identifying and understanding these rare and elusive motifs is crucial for analyzing complex network behaviors. Our previous research has established a significant positive correlation between the occurrence of motifs and two network properties at the micro level, namely Assortativity Degree (rho) and Local Clustering Coefficient (CCl) (Mursa, 2019b; Mursa, 2019c; Mursa, 2019a; Mursa, 2021). Making use of these findings, in this paper, we present a novel null model, MuAn , which leverages Evolutionary Algorithms to produce synthetic networks with topologies that are characterized by high values of rho and CCl , facilitating the emergence of network motifs. A comprehensive experiment validates our proposed null model quality in generating networks with motifs through fine-tuning the EA configuration for precise and optimal outcomes and a comparative analysis with other well-known null models. The proposed model offers a promising avenue to advance motif analysis by enabling the generation of synthetic networks with motifs, expediting investigations on gene regulatory networks, transcriptional networks, drug-target networks, artificial neuronal networks, and other domains wherein motif-driven analysis is pivotal to unraveling their intrinsic complexities.
引用
收藏
页数:12
相关论文
共 47 条
  • [1] Topology of evolving networks:: Local events and universality
    Albert, R
    Barabási, AL
    [J]. PHYSICAL REVIEW LETTERS, 2000, 85 (24) : 5234 - 5237
  • [2] Internet -: Diameter of the World-Wide Web
    Albert, R
    Jeong, H
    Barabási, AL
    [J]. NATURE, 1999, 401 (6749) : 130 - 131
  • [3] A Multi-objective Optimization Approach for Generating Complex Networks
    Arora, Viplove
    Ventresca, Mario
    [J]. PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'16 COMPANION), 2016, : 15 - 16
  • [4] Impact of basic network motifs on the collective response to perturbations
    Bao, Xiaoge
    Hu, Qitong
    Ji, Peng
    Lin, Wei
    Kurths, Jurgen
    Nagler, Jan
    [J]. NATURE COMMUNICATIONS, 2022, 13 (01)
  • [5] Network biology:: Understanding the cell's functional organization
    Barabási, AL
    Oltvai, ZN
    [J]. NATURE REVIEWS GENETICS, 2004, 5 (02) : 101 - U15
  • [6] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [7] A genetic algorithm-based, hybrid machine learning approach to model selection
    Bies, RR
    Muldoon, MF
    Pollock, BG
    Manuck, S
    Smith, G
    Sale, ME
    [J]. JOURNAL OF PHARMACOKINETICS AND PHARMACODYNAMICS, 2006, 33 (02) : 195 - 221
  • [8] Bojchevski A, 2018, Arxiv, DOI arXiv:1803.00816
  • [9] Topology of large-scale engineering problem-solving networks
    Braha, D
    Bar-Yam, Y
    [J]. PHYSICAL REVIEW E, 2004, 69 (01) : 7
  • [10] Scale-free networks are rare
    Broido, Anna D.
    Clauset, Aaron
    [J]. NATURE COMMUNICATIONS, 2019, 10 (1)