scholarly journals Topology Identification of Complex Network via Chaotic Ant Swarm Algorithm

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Haipeng Peng ◽  
Lixiang Li ◽  
Jürgen Kurths ◽  
Shudong Li ◽  
Yixian Yang
Keyword(s):  
Complex Networks ◽  
Numerical Simulations ◽  
Complex Network ◽  
Parameter Optimization ◽  
Ant Algorithm ◽  
Structure Parameters ◽  
Topology Identification ◽  
Unknown Structure ◽  
Swarm Algorithm ◽  
Scientific Fields

Nowadays, the topology of complex networks is essential in various fields as engineering, biology, physics, and other scientific fields. We know in some general cases that there may be some unknown structure parameters in a complex network. In order to identify those unknown structure parameters, a topology identification method is proposed based on a chaotic ant swarm algorithm in this paper. The problem of topology identification is converted into that of parameter optimization which can be solved by a chaotic ant algorithm. The proposed method enables us to identify the topology of the synchronization network effectively. Numerical simulations are also provided to show the effectiveness and feasibility of the proposed method.

scholarly journals Mean Square Synchronization of Stochastic Nonlinear Delayed Coupled Complex Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Chengrong Xie ◽  
Yuhua Xu ◽  
Dongbing Tong
Keyword(s):  
Complex Networks ◽  
Numerical Simulations ◽  
Invariance Principle ◽  
Sufficient Conditions ◽  
Stochastic Perturbation ◽  
Mean Square ◽  
Topology Identification ◽  
And Topology ◽  
Adaptive Laws ◽  
Weiner Process

We investigate the problem of adaptive mean square synchronization for nonlinear delayed coupled complex networks with stochastic perturbation. Based on the LaSalle invariance principle and the properties of the Weiner process, the controller and adaptive laws are designed to ensure achieving stochastic synchronization and topology identification of complex networks. Sufficient conditions are given to ensure the complex networks to be mean square synchronization. Furthermore, numerical simulations are also given to demonstrate the effectiveness of the proposed scheme.

Reorganizations of complex networks: Compounding and reducing

2014 ◽  
Vol 25 (05) ◽  
pp. 1440001 ◽  
Author(s):  
Fengjing Shao ◽  
Yi Sui
Keyword(s):  
Complex Networks ◽  
Numerical Simulations ◽  
Empirical Evidence ◽  
Complex Network ◽  
Traffic Dynamics ◽  
Generalized Framework ◽  
One To One

Real networks interact with each other by different kinds of topological connections, which are usually demonstrated by linking nodes of different networks. Simple connection, such as one-to-one corresponding, random connection and similar connection are adopted for studying the interacted networks. Practical interrelations established between the two networks are ignored. In this study, a generalized framework of multi-subnet composited complex network that allowed us to investigate interrelations among several subnets is developed. Based on that, reorganizations of networks: compounding (compound subnets into a "bigger" one) and reducing (obtain a "smaller" network from a "bigger" one) are proposed. As an empirical evidence, influence of compounding on traffic dynamics is discussed. And the properties of nodes linking two networks are also considered. Onset of compounding between two networks is revealed. Numerical simulations on artificial networks as well as real bus and tube networks of Qingdao in China agree well with our analysis, which show validity of our model.

Information on evolutionary age in redundancy of complex network

2019 ◽  
Vol 33 (27) ◽  
pp. 1950331
Author(s):  
Shiguo Deng ◽  
Henggang Ren ◽  
Tongfeng Weng ◽  
Changgui Gu ◽  
Huijie Yang
Keyword(s):  
Principal Component Analysis ◽  
Complex Networks ◽  
Metabolic Network ◽  
Complex Network ◽  
Cellular Networks ◽  
Topological Structure ◽  
Quantitative Measure ◽  
Principal Component ◽  
Evolutionary Information ◽  
Local Patterns

Evolutionary processes of many complex networks in reality are dominated by duplication and divergence. This mechanism leads to redundant structures, i.e. some nodes share most of their neighbors and some local patterns are similar, called redundancy of network. An interesting reverse problem is to discover evolutionary information from the present topological structure. We propose a quantitative measure of redundancy of network from the perspective of principal component analysis. The redundancy of a community in the empirical human metabolic network is negatively and closely related with its evolutionary age, which is consistent with that for the communities in the modeling protein–protein network. This behavior can be used to find the evolutionary difference stored in cellular networks.

scholarly journals CNFE-SE: a novel approach combining complex network-based feature engineering and stacked ensemble to predict the success of intrauterine insemination and ranking the features

2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Sima Ranjbari ◽  
Toktam Khatibi ◽  
Ahmad Vosough Dizaji ◽  
Hesamoddin Sajadi ◽  
Mehdi Totonchi ◽  
...  
Keyword(s):  
Complex Networks ◽  
Complex Network ◽  
Semen Quality ◽  
Intrauterine Insemination ◽  
Machine Learning Algorithms ◽  
Semen Parameters ◽  
Feature Engineering ◽  
Operating Characteristics ◽  
Scoring Method ◽  
Novel Approach

Abstract Background Intrauterine Insemination (IUI) outcome prediction is a challenging issue which the assisted reproductive technology (ART) practitioners are dealing with. Predicting the success or failure of IUI based on the couples' features can assist the physicians to make the appropriate decision for suggesting IUI to the couples or not and/or continuing the treatment or not for them. Many previous studies have been focused on predicting the in vitro fertilization (IVF) and intracytoplasmic sperm injection (ICSI) outcome using machine learning algorithms. But, to the best of our knowledge, a few studies have been focused on predicting the outcome of IUI. The main aim of this study is to propose an automatic classification and feature scoring method to predict intrauterine insemination (IUI) outcome and ranking the most significant features. Methods For this purpose, a novel approach combining complex network-based feature engineering and stacked ensemble (CNFE-SE) is proposed. Three complex networks are extracted considering the patients' data similarities. The feature engineering step is performed on the complex networks. The original feature set and/or the features engineered are fed to the proposed stacked ensemble to classify and predict IUI outcome for couples per IUI treatment cycle. Our study is a retrospective study of a 5-year couples' data undergoing IUI. Data is collected from Reproductive Biomedicine Research Center, Royan Institute describing 11,255 IUI treatment cycles for 8,360 couples. Our dataset includes the couples' demographic characteristics, historical data about the patients' diseases, the clinical diagnosis, the treatment plans and the prescribed drugs during the cycles, semen quality, laboratory tests and the clinical pregnancy outcome. Results Experimental results show that the proposed method outperforms the compared methods with Area under receiver operating characteristics curve (AUC) of 0.84 ± 0.01, sensitivity of 0.79 ± 0.01, specificity of 0.91 ± 0.01, and accuracy of 0.85 ± 0.01 for the prediction of IUI outcome. Conclusions The most important predictors for predicting IUI outcome are semen parameters (sperm motility and concentration) as well as female body mass index (BMI).

Differential Evolution Dynamic Analysis in the Form of Complex Networks

2016 ◽  
pp. 285-318 ◽  
Author(s):  
Lenka Skanderova ◽  
Ivan Zelinka
Keyword(s):  
Evolutionary Algorithms ◽  
Differential Evolution ◽  
Complex Networks ◽  
Dynamic Analysis ◽  
Evolutionary Algorithm ◽  
Complex Network ◽  
Novel Method

In this work, we investigate the dynamics of Differential Evolution (DE) using complex networks. In this pursuit, we would like to clarify the term complex network and analyze its properties briefly. This chapter presents a novel method for analysis of the dynamics of evolutionary algorithms in the form of complex networks. We discuss the analogy between individuals in populations in an arbitrary evolutionary algorithm and vertices of a complex network as well as between edges in a complex network and communication between individuals in a population. We also discuss the dynamics of the analysis.

Modern Diffusion of Products with Complex Network Models

2011 ◽  
pp. 119-133
Author(s):  
Atsushi Tanaka
Keyword(s):  
Complex Networks ◽  
Marketing Strategy ◽  
Complex Network ◽  
Network Models ◽  
Information Propagation ◽  
Multiagent Simulation ◽  
Product Marketing ◽  
Winner Takes All ◽  
Complex Network Models

In this chapter, some important matters of complex networks and their models are reviewed shortly, and then the modern diffusion of products under the information propagation using multiagent simulation is discussed. The remarkable phenomena like “Winner-Takes-All” and “Chasm” can be observed, and one product marketing strategy is also proposed.

scholarly journals Comparison of complex networks and tree-based methods of phylogenetic analysis and proposal of a bootstrap method

PeerJ ◽  
2018 ◽  
Vol 6 ◽  
pp. e4349 ◽  
Author(s):  
Aristóteles Góes-Neto ◽  
Marcelo V.C. Diniz ◽  
Daniel S. Carvalho ◽  
Gilberto C. Bomfim ◽  
Angelo A. Duarte ◽  
...  
Keyword(s):  
Biological Sciences ◽  
Phylogenetic Analysis ◽  
Complex Networks ◽  
Complex Network ◽  
Bootstrap Method ◽  
Molecular Data ◽  
Data Sets ◽  
Fungal Cell ◽  
Taxonomic Groups ◽  
Inference Methods

Complex networks have been successfully applied to the characterization and modeling of complex systems in several distinct areas of Biological Sciences. Nevertheless, their utilization in phylogenetic analysis still needs to be widely tested, using different molecular data sets and taxonomic groups, and, also, by comparing complex networks approach to current methods in phylogenetic analysis. In this work, we compare all the four main methods of phylogenetic analysis (distance, maximum parsimony, maximum likelihood, and Bayesian) with a complex networks method that has been used to provide a phylogenetic classification based on a large number of protein sequences as those related to the chitin metabolic pathway and ATP-synthase subunits. In order to perform a close comparison to these methods, we selected Basidiomycota fungi as the taxonomic group and used a high-quality, manually curated and characterized database of chitin synthase sequences. This enzymatic protein plays a key role in the synthesis of one of the exclusive features of the fungal cell wall: the presence of chitin. The communities (modules) detected by the complex network method corresponded exactly to the groups retrieved by the phylogenetic inference methods. Additionally, we propose a bootstrap method for the complex network approach. The statistical results we have obtained with this method were also close to those obtained using traditional bootstrap methods.

scholarly journals Power-law distribution of degree–degree distance: A better representation of the scale-free property of complex networks

2020 ◽  
Vol 117 (26) ◽  
pp. 14812-14818 ◽  
Author(s):  
Bin Zhou ◽  
Xiangyi Meng ◽  
H. Eugene Stanley
Keyword(s):  
Complex Networks ◽  
Complex Network ◽  
Power Law ◽  
Real World ◽  
Preferential Attachment ◽  
Statistical Tests ◽  
Finite Size ◽  
Distance Distribution ◽  
Scale Free ◽  
Degree Distance

Whether real-world complex networks are scale free or not has long been controversial. Recently, in Broido and Clauset [A. D. Broido, A. Clauset,Nat. Commun.10, 1017 (2019)], it was claimed that the degree distributions of real-world networks are rarely power law under statistical tests. Here, we attempt to address this issue by defining a fundamental property possessed by each link, the degree–degree distance, the distribution of which also shows signs of being power law by our empirical study. Surprisingly, although full-range statistical tests show that degree distributions are not often power law in real-world networks, we find that in more than half of the cases the degree–degree distance distributions can still be described by power laws. To explain these findings, we introduce a bidirectional preferential selection model where the link configuration is a randomly weighted, two-way selection process. The model does not always produce solid power-law distributions but predicts that the degree–degree distance distribution exhibits stronger power-law behavior than the degree distribution of a finite-size network, especially when the network is dense. We test the strength of our model and its predictive power by examining how real-world networks evolve into an overly dense stage and how the corresponding distributions change. We propose that being scale free is a property of a complex network that should be determined by its underlying mechanism (e.g., preferential attachment) rather than by apparent distribution statistics of finite size. We thus conclude that the degree–degree distance distribution better represents the scale-free property of a complex network.

Node Importance Evaluation of Anti-Missile Networks

2013 ◽  
Vol 765-767 ◽  
pp. 1098-1102
Author(s):  
Yu Xia ◽  
Fei Peng
Keyword(s):  
Complex Networks ◽  
Complex Network ◽  
Evaluation Method ◽  
Simulation Experiments ◽  
Node Importance ◽  
Correlation Degree ◽  
Evaluation Algorithm

in order to improve the efficiency and validity of node importance evaluation, a new evaluation method for node importance in complex networks was proposed based on node approach degree and node correlation degree. The basic idea of the method is that the larger the approach degree of a node is, the closer to center of a complex network the node is and the more important it is; the bigger the correlation degree of a node is, the more important the node is. An evaluation algorithm corresponding to the method was designed for the warship fleet cooperation anti-missile network. Finally, the validity of the proposed method was verified by simulation experiments.

scholarly journals Combined Heuristic Attack Strategy on Complex Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Marek Šimon ◽  
Iveta Dirgová Luptáková ◽  
Ladislav Huraj ◽  
Marián Hosťovecký ◽  
Jiří Pospíchal
Keyword(s):  
Complex Networks ◽  
Complex Network ◽  
Biological Networks ◽  
Case Scenario ◽  
Worst Case ◽  
Scale Free ◽  
Power Law Exponent ◽  
Spreading Disease ◽  
Heuristic Criterion ◽  
Attack Strategy

Usually, the existence of a complex network is considered an advantage feature and efforts are made to increase its robustness against an attack. However, there exist also harmful and/or malicious networks, from social ones like spreading hoax, corruption, phishing, extremist ideology, and terrorist support up to computer networks spreading computer viruses or DDoS attack software or even biological networks of carriers or transport centers spreading disease among the population. New attack strategy can be therefore used against malicious networks, as well as in a worst-case scenario test for robustness of a useful network. A common measure of robustness of networks is their disintegration level after removal of a fraction of nodes. This robustness can be calculated as a ratio of the number of nodes of the greatest remaining network component against the number of nodes in the original network. Our paper presents a combination of heuristics optimized for an attack on a complex network to achieve its greatest disintegration. Nodes are deleted sequentially based on a heuristic criterion. Efficiency of classical attack approaches is compared to the proposed approach on Barabási-Albert, scale-free with tunable power-law exponent, and Erdős-Rényi models of complex networks and on real-world networks. Our attack strategy results in a faster disintegration, which is counterbalanced by its slightly increased computational demands.

Sign in / Sign up

Export Citation Format

Share Document