Research Article  Open Access
Topology Identification of Complex Network via Chaotic Ant Swarm Algorithm
Abstract
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.
1. Introduction
So far, most researches on complex networks are based on their exact structure dynamics. However, there is often various unknown or uncertain information in complex networks of the real world. This information including the topology connection of networks, and dynamical parameters of nodes, is always partially known and also changes continuously in many real complex networks such as gene networks, proteinDNA structure network, power grid networks, and biological neural networks [1–4]. Knowledge about the identification of the topology of complex networks is the prerequisite to analyze, control, and predict their dynamical behaviors. Therefore, this topic has drawn great attention of many researchers, since it is of great theoretical and practical significance to use the dynamics of observed nodes for the identification of the network structure [5–7].
The problem of topology identification can be formulated as a gray box model. From this viewpoint, a basic mathematical model of the topology for the complex network can be constructed, although its exact structure peculiarities are not entirely known. In the model of a complex network, there are often some unknown structure parameters which can be completed via topology identification. Therefore, if the basic mathematical model of its topological structure is built, then we only need to identify the unknown structure parameters of this network. Recently, some research on topology identification of complex networks has emerged to identify some complex networks and some timedelay networks [8]. These researchers mainly used an adaptive feedback control algorithm to solve the problem of topological identification. But this algorithm may fail if the network is in a synchronous regime. In [9], an improved adaptive feedback control method was proposed to make it identifiable in synchronous complex networks. However, this improved method should change the coupling mode of its topology. In addition, to adapt this improved adaptive feedback control method, the dynamical parameter of each node must be observable, which is especially difficult to realize in most real networks such as metabolic networks and power grid networks.
In this paper, a method of topology identification for complex networks is proposed which is based on a chaotic ant swarm (CAS) algorithm. The problem of topology identification is converted into that of parameter optimization which could be solved by the CAS optimization algorithm [10]. The CAS algorithm was inspired by biological experiments of single ant’s chaotic behavior. This CAS method is different from those of ant colony optimization (ACO), since the CAS algorithm combines chaotic and selforganizing behaviors of ants with the advantages of swarmbased algorithms. The CAS algorithm is a global optimization algorithm, and it can deal with topology identification of complex networks effectively when they are in a nonsynchronous and even when they are in a synchronous regime.
The remainder of this paper is organized as follows. In Section 2, the problem formulation of topology identification for complex networks is presented. In Section 3, the chaotic ant swarm algorithm is introduced. In Section 4, results of numerical simulations are given. Finally, some conclusions about the proposed method are drawn in Section 5.
2. Problem Formulation
To demonstrate the topology identification of complex networks, in this paper, we consider a general complex dynamical network as in [1] with each node being an dimensional dynamical system, and it is described by a differential equation of the following form where denotes the number of nodes in the dynamical network and is the state vector associated with the th node. The function is the corresponding nonlinear vector field. is the innercoupling matrix. is the coupling topology of the network. If there exists a coupling connection between node and node , ; otherwise, . In this paper, does not need to be symmetric or irreducible.
The coupling matrix fully represents the topological information of the complex network. Consequently, the problem of topology identification for a complex network can be converted into that of identification of the unknown coupling matrix . To identify the coupling matrix , here, we assume that and can be experimentally measured in advance. Next, a driveresponse network should be built. Equation (1) is taken as the driving network. Then, the response network can be designed as where is the estimated parameter of . is obtained by simulating the network (1) with the estimated coupling matrix element .
To identify the topology of the complex network, the following objective function is introduced as where is the termination time of numerical simulation, indicates the number of nodes, denotes the dimensions of each node’s dynamical system, and is the discrete time. is the state vector of the driving network. is the state vector of the response network with initial value and the estimated coupling matrix element .
Hence, the problem of topology identification is converted into that of a parameter optimization by the search of the minimal value of . The topology matrix can be well identified through the method of objective function.
3. Chaotic Ant Swarm Algorithm
In recent years, a swarm intelligent optimization algorithm called chaotic ant swam (CAS) algorithm is proposed to solve the optimization problem based on chaos theory [10]. The mathematical model of CAS algorithm is described as follows: where is the organization variable of the CAS model and . It controls the chaotic behavior of an individual ant. In this paper, . is the organization parameter of individual ant which is a positive constant less than 1. is a very large positive constant; here, is set to be . is a positive constant, where . determines the searching range of the th ant in th dimension. controls the moving proportion of the th ant searching space. is the best position that the individual ant and its neighbors have ever found within time steps. Here the neighbors are set to be global neighbors; that is, all the ants are the neighbors of each other.
The ants usually exchange information via certain direct or indirect communication methods. As a result of effective communication, the impact of the organization becomes stronger as time evolves. Finally, all the ants walk through the best path to forage food. Equation (4) shows the foraging process of CAS model. As time increases, the effect of the organization variable on the behavior of each ant is becoming stronger via the organization parameter . Finally, by the effect of both and , the state of will converge to the best global position.
and are two important parameters. has an effect on the converging speed of the CAS algorithm. If is very large, then the converging speed of the CAS algorithm will be very fast so that the optimal solution might not be found. If is very small, then the converging speed of the CAS algorithm will be very slow and the runtime will be longer. If is set to be zero, then the behavior of one ant will be chaotic all the time and the CAS algorithm cannot converge to a fixed position. Furthermore, since small changes of organization effect are desired, is set to be . The concrete formula of depends on the specific problem as well as runtime. In order to enable each ant to have a different organization parameter, we set , where is a uniformly distributed random number in the interval . has an effect on the searching range of the CAS algorithm. If the value of is very large, then the searching range will be small. If is very small, then the searching range will be very large. The searching range is set to be , and then .
Based on the above discussions about the CAS algorithm, the detailed procedure for identifying the topology structure of a complex network is described as follows.
Step 1. To identify the topology parameter of a complex network, some important parameters of the CAS algorithm should be firstly initialized. In this paper, the positive constant is set to be 200; the organization factor of each node is set as , where is the th ant in the whole ants; is set properly to control the moving proportion. The organization variable of each node is set to be . is set properly to control the searching range of , where is the th dimension of the ant local position.
Step 2. Generate the initial position of the th ant randomly in the searching space. denotes the initial time point.
Step 3. By setting the initial time state vector , the fourthorder RungeKutta algorithm is used in the driving network (1) to obtain a series of .
Step 4. By setting the initial time state vector , , the wellknown fourthorder RungeKutta algorithm is used in the response network (2) to obtain a series of , . The coupling matrix can be estimated by the ant colony .
Step 5. Compute for each ant. Then, update the position of each ant via (4).
Step 6. Compute the value of objective function for each ant , and compare each value with previous of each ant. If the current value is smaller than the previous , then it is updated by the current value, and set the value of to be the current individual location. Finally, compare each with . If the value of is smaller than , then is updated by of this ant. Then, the is replaced by the current global best position.
Step 7. Go to Step 5 until the ending condition is satisfied. Then output the global best location of each ant, which means the coupling matrix can be identified by the CAS algorithm.
4. Numerical Simulation
In this section, we present several numerical simulation results to illustrate the effectiveness of the proposed method. Lorenz chaotic equation is taken as the node dynamical system of the th node, which is described as where , , and are the state variables; , , are positive constants. For the CAS algorithm model (4), we set , , and . To calculate the objective function , successive vectors are set in both driving and response networks. In order to show the effectiveness and feasibility of the proposed method, two examples are provided as follows to identify the topology structure of complex networks.
Note. There is an interesting phenomenon. Let be the golden ratio, which is approximately equal 1.618. Then, approximately equals , and approximately equals to . Why such an interesting phenomenon exist? We should give further study in our future work. The basic concept of the golden ratio is given in [11–13] and [14] for the spectra used in [11, 12].
Example 1. First of all, a nonsymmetric and nonsynchronous diffusive network is considered, which includes three nodes with the topology matrix . The elements of the topology matrix are , , , and . The other elements are and . is an identical matrix . Here, the initial state is set to be . The population size is . The maximum time step is set as . Obviously, there are independent variables, so the dimension of each ant position is set to be . We set , , , and . is in the interval . The estimated process is shown as follows.
Figure 1 shows that the coupling matrix can be well identified as the time increases. When the time step is approximately , the estimated coupling matrix converges to the true value where the population size is . To compare the CAS algorithm with the QPSO algorithm, we also use the definition of [15] to identify the topology of Example 1. Then, the evolution curve of the objective function against the time can be obtained, and their comparative result between these two algorithms is shown in Figure 2. We can see that the objective function converges rapidly to the global optima as time evolves. Besides, the converging speed and the precision of the CAS algorithm are much better than those of the QPSO algorithm.
Example 2. In this example, a symmetric synchronous network is introduced to show the effectiveness of the proposed method. The parameters of the topology structure are set as , , , , , and the other and . is an identical matrix . Here, the initial state is . The population size is . The maximal time step is set as . Obviously, there are independent variables, so the dimension of each ant position is set to be . is set to be . is set to be . is set to be . is set to be . is set to be , and is set to be . Figure 3 shows the identification results.
We can see that the topology matrix can be identified precisely as the time increases. To compare CAS algorithm with QPSO algorithm, we use the definition of [15] to identify the topology of Example 2. The comparative result is shown in Figure 4. From Figure 4 and Table 1, we can see that although the converging speed of QPSO algorithm is a little faster than that of CAS algorithm, the converging precision of QPSO is much less than that of CAS algorithm. Obviously, the CASbased topology identification method is more effective than the QPSObased topology identification method. Compared with the adaptive synchronization identification approach, the CAS algorithm does not need to change the coupling modes of the network topology, which has advantages in some real identification cases, for example, the biological neural network.

5. Conclusion
In this paper, a topology identification method is proposed based on the CAS algorithm. The problem of topology identification is converted into that of parameter optimization. Compared with the constraints of identifying synchronous complex networks via adaptive feedback control method and the relatively poorer converging precision via QPSObased topology identification method, the proposed method based on CAS algorithm can identify the topology structure of complex network effectively.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
The authors would like to thank the editor and all the anonymous reviewers for their helpful advice. This work is supported by the Foundation for the Author of National Excellent Doctoral Dissertation of PR China (Grant no. 200951), the National Natural Science Foundation of China (Grant nos. 61170269, 61202362, and 61070209), the China Postdoctoral Science Foundation Funded Project (Grant no. 2013M540070), the Beijing Higher Education Young Elite Teacher Project, and the Asia Foresight Program under NSFC Grant (Grant no. 61161140320).
References
 A. E. Motter, C. Zhou, and J. Kurths, “Network synchronization, diffusion, and the paradox of heterogeneity,” Physical Review E, vol. 71, no. 1, Article ID 016116, 2005. View at: Publisher Site  Google Scholar
 Z. Aydin and Y. Altunbasak, “A signal processing application in genomic research: protein secondary structure prediction,” IEEE Signal Processing Magazine, vol. 23, no. 4, pp. 128–131, 2006. View at: Publisher Site  Google Scholar
 X. Zhu, W. Zhang, B. Yu, and W. Gong, “Identification of vulnerable lines in power grid based on complex network theory,” in Proceedings of the International Conference on Mechatronic Science, Electric Engineering and Computer (MEC '11), pp. 118–121, August 2011. View at: Publisher Site  Google Scholar
 J. Zhou, W. Yu, X. Li, M. Small, and J.A. Lu, “Identifying the topology of a coupled FitzHughNagumo neurobiological network via a pinning mechanism,” IEEE Transactions on Neural Networks, vol. 20, no. 10, pp. 1679–1684, 2009. View at: Publisher Site  Google Scholar
 X. Wu, “Synchronizationbased topology identification of weighted general complex dynamical networks with timevarying coupling delay,” Physica A, vol. 387, no. 4, pp. 997–1008, 2008. View at: Publisher Site  Google Scholar
 D. Yu, M. Righero, and L. Kocarev, “Estimating topology of networks,” Physical Review Letters, vol. 97, no. 18, Article ID 188701, 2006. View at: Publisher Site  Google Scholar
 W. K. S. Tang, M. Yu, and L. Kocarev, “Identification and monitoring of biological neural network,” in Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS '07), pp. 2646–2649, May 2007. View at: Google Scholar
 H. Liu, J.A. Lu, J. Lü, and D. J. Hill, “Structure identification of uncertain general complex dynamical networks with time delay,” Automatica, vol. 45, no. 8, pp. 1799–1807, 2009. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 L. Chen, J. Lu, and C. K. Tse, “Synchronization: an obstructer in identifying network topology based on adaptive feedback control algorithm,” IEEE Transactions on Circuits and Systems II, vol. 56, p. 310, 2009. View at: Google Scholar
 H. Peng, L. Li, Y. Yang, and F. Liu, “Parameter estimation of dynamical systems via a chaotic ant swarm,” Physical Review E, vol. 81, no. 1, Article ID 016207, 2010. View at: Publisher Site  Google Scholar
 M. Li and W. Zhao, “Golden ratio phenomenon of random data obeying von Karman spectrum,” Mathematical Problems in Engineering, vol. 2013, Article ID 130258, 6 pages, 2013. View at: Publisher Site  Google Scholar
 M. Li and W. Zhao, “Essay on Kolmogorov law of minus 5 over 3, viewed with golden ratio,” Advances in High Energy Physics, vol. 2013, Article ID 680678, 3 pages, 2013. View at: Publisher Site  Google Scholar
 M. Livio, The Golden Ratio, Random House Inc., New York, NY, USA, 2003.
 M. Li and W. Zhao, “On 1/f noise,” Mathematical Problems in Engineering, vol. 2012, Article ID 673648, 23 pages, 2012. View at: Publisher Site  Google Scholar
 S.X. Tang, L. Chen, and Y.G. He, “Optimizationbased topology identification of complex networks,” Chinese Physics B, vol. 20, no. 11, Article ID 110502, 2011. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2013 Haipeng Peng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.