Recent Advances on Swarm Intelligence for Solving Complex Engineering Problems
View this Special IssueResearch Article  Open Access
Jingti Han, Changmei Mao, "Roles of Clustering Coefficient for the Network Reconstruction", Mathematical Problems in Engineering, vol. 2018, Article ID 4949673, 11 pages, 2018. https://doi.org/10.1155/2018/4949673
Roles of Clustering Coefficient for the Network Reconstruction
Abstract
It is important to establish relations between the network reconstruction and the topological dynamical structure of networks. In this article, we quantify the effect for two types of network topologies on the performance of network reconstruction. First, we generate two network modes with variable clustering coefficient based on HolmeKim model and NewmanWatts smallworld model, then we reconstruct the artificial networks by using a novel framework called norm minimization algorithm based on a theory called compressive sensing (CS), a framework for recovering sparse signals. The results of the simulation experiment show that the accuracy rate for the network reconstruction is a monotonically increasing function of the clustering coefficient in HolmeKim model, whereas the opposite occurs in NewmanWatts smallworld network. And this yet demonstrates that the larger the network size, the higher the accuracy rate. Morever, we compare the results of CS with orthogonal matching pursuit (OMP), a greedy algorithm. The results show that the accuracy rate of norm minimization method is 10% higher than that of OMP, and OMP yields 1.2 times the computation speed of norm minimization. Our work demonstrates that the topological structure of network has influence on the accurate reconstruction and it is helpful for offering proper method for the network reconstruction.
1. Introduction
Network reconstruction has attracted much attention for various collective dynamical behaviors [1–3]. The concept of complex network reconstruction is proposed for the first time by Guimerà [4]. It is an inverted problem that can rebuild the existing network to yield estimates of the true network properties and plays significant role in various aspects, such as locating the source of disease [5, 6], idenfying hidden information, preventing virus transmission [7, 8], and predicting risk spreading in financial networks.
When dealing with the network reconstruction problem, we should think about the reliability of network data since the accessible data may be fragmentary and limited in consideration of network size. Efficient approaches to solve the reconstruction problem with low data requirements are mainly obtained from methods as Link prediction [9], Bayesian reasoning [10], ODE [11], and so on. Recently, a theory called compressive sensing (CS), used for recovering sparse signal [12, 13], such as image reconstruction, largescale sensornetwork data processing, and coupledoscillator networks reconstruction [14], either with time series (continuoustime) data, which has been outstanding in nonlinear dynamics with interactions among nodes [15], or discrete time series, which remains deeper researching [16], can reconstruct a propagation network using small data set information extracted from experiments or observations [17–19]. norm minimization (Basis Pursuit), which can solve sparse problem, is often used as one kind of algorithm for CS. Under stochastic dynamical process, Shen et al. reconstruct networks from limited time series. Wang et al. [20] uncover interaction networks from small amount of data based on CS. Indeed, such studies proposed a wide range of issues related to accurate network reconstruction for diverse fields. Most of them studied sparse networks in applications from generegulatory networks [21], coupled oscillator networks, to social networks [22]. In real world network, human Brain Network has been investigated under CS [23]; in [24] the authors took into account three directed realworld networks, Football, USTop500, and C. elegans, and tested two methods on the reconstruction for the three networks. In [25], CS is exploited for reducing the memory cost in switches and routers. In [26], the authors gather and spread information across a large P2P overlay network efficiently by CS.
Prior studies about network reconstruction mainly focused on analyzing the collective dynamics complex networks with evolutionary game data. Santos et al. [27] study the mechanism of cooperative evolution with data from game theory. Rong et al. [28] investigate, in the networked prisoner’s dilemma game, how the degreemixing schema influences the cooperation. Besides the network games [29, 30], the network synchronization [31], the topological structure [32, 33], and so on are popular research topics in the field of complex system. Specifically, analyzing the dynamic properties of complex system is of great significance. The topological characteristics paly important role on the network controllability [34]. Guo et al. [35] investigate the role of the assortative coeffcicent for the network reconstruction and find that when the assortative coefficient is positive, the norm minimization method could regenerate the social network more accurately. However, whether network topology can affect the reconstruction accuracy and choose proper method is important for network reconstruction. Inspired by this, we investigate the effect on the accuracy rate of the network reconstruction by norm minimization method with different topological structure of networks measured by variable clustering coefficient among two type network models. Newman and Watts raise smallworld network, highlighting their high clustering and shortest average path length [36]. Barabási and Albert (BA) established a network with both growth mechanism and preferential attachment mechanism [37, 38]; the nodes’ degree of the system follows the principle of the powerlaw distribution. The existing classical network model that incorporates both properties is called Holme–Kim model [39]. It is built based on BA model and possesses the scalefree characteristic. In this article, we control the parameter of the model by adjusting the change of the clustering coefficient. To verify the restructing algorithm we have mentioned, we model various network structures with variable clustering coefficient and investigate the relation between accuracy and clustering coefficient. At last, we also investigate the performance by using orthogonal matching pursuit (OMP), a greedy algorithm, which shows difference with norm minimization.
In this paper, first we generate a series networks by Holme–Kim model and NewmanWatts smallworld model, then we reveal the structure of network with evolutionarygame data by using norm minimization. Furthermore, we compare our framework with OMP, another method for network reconstruction. The results show that, with the network topological structure changing, our method is 10% higher than that of OMP in terms of success rate (SR), which measures the accuracy of network reconstruction. Specially, Holme–Kim model acts distinctly different among the two algorithms. Meanwhile, OMP has 1.2 times the convergence rate of norm minimization. Our work shows the accuracy of prediction for two types of network topologies, with the two methods performing differently, and choosing the proper method is important.
2. Methods
We address the mechanism of uncovering two types network topologies with evolutionary PD game time series data based on norm minimization, one kind of compressive sensing method. It is carried out through exploring two evolutionary games generating in Holme–Kim networks and NewmanWatts smallworld networks; individual interactive information is accessible, then we make an attempt to decode the network structure from measurable data.
2.1. Reconstruction Processes
CS is first used for finding solutions to underdetermine linear systems through processing signal to acquire and remodeling signal. The advantage of CS [40–42] is that it can reconstruct a small number of linear measurements of the signal that contain enough information. It often happens on the fact that abundant signals are compressible or sparse when they are expressed in the proper basis and frame. The purpose of CS is mainly aimed at reconstructing vector from G (, G is inear measurements); convex optimization problem can be expressed as follows:from which the vector denotes the measurement vector and measurement matrix whose rows have unit length projects data. is the norm of vector X. As a kind of compression estimates, the calculation speed of norm method is slow, the measurement data required is small, and the precision is high. Optimum solution to the convex optimization can be accessible [43]; it has been widely used for network reconstruction problem easily [44]. Considering that the length of an unknown vector is much more than the observable measurements () and the number of nonzero elements is less than , all these are main advantages of CS. The measurement vector and matrix are generated from the evolutionary game progress where accessible data about strategy and payoff for each agent can be got from the dynamic interaction. In general, two game theories are used to investigate cooperation in social networks; one is prisoner’s dilemma (PD) game [45], and the other is snowdrift game (SG) [46]. Recently, the prisoner’s dilemma (PD) game has been used combined with spatial or topological dimension [47, 48]. PD game has been a framework to exploit cooperation for complex social network among nodes [49]; it can serve for network reconstruction. In fact, the structure of network often can affect the style of cooperation; much research has been done about it. In terms of mechanism for PD game, there exist many ways to deal with cooperation; in [50], it is demonstrated that costly punishment may decrease cooperation sometimes. In general, two strategies S belong to an agent: cooperation () or defection (), the strategy matrices for cooperation is S and strategy matrices for defection is S; for the PD game, we can simplify the payoff matrices as follows: we implement Eq. (1) based on evolutionary game data with numerical computations through complex networks. The payoff matrices P arewhere is the parameter that can indicate the temptation to defect; each agent plays the PD game with its neighbors and gains payoffs step by step. For example, as for agent , after one round, the payoff isin Eq. (3) denotes the strategies of agent and denotes the strategies of agent respectively, and is total payoff over all the neighbor set of . After each round of the game, the agent will adjust its own strategy according to the its payoff and the neighbors’, allowing them to achieve the desired benefits in subsequent rounds, thus forming game evolution process. Common strategy evolution rules have imitated the best Copy dynamics, Fermi dynamics, and so on. The experimental part of this paper will use the Fermi dynamics rule to carry out the PD game evolution. The rule of the dynamics of Fermi: the probability of the node next round learning node ’s strategy is [51] The parameter denotes the rationality of the player in the game; when it comes close to zero, players will only learn the strategy, the revenue of which is higher than its own in this round. When increases, the probability of a player learning a low yield neighbor strategy will increase, which can be expressed by being if and if . When approaches , this means that the player chooses completely random decision making.
Each agent possesses one node in the evolutionary game. Assume that the number of nodes in the game network is ; the links between nodes can be represented by an adjacency matrix A with order. If node is the neighbor of node , the matrix element ; otherwise . The total payoff for node can be expressed as follows: in which denotes connection between agent and its neighbor , and denotes the total payoff of node from the PD game with , and denotes the the total rounds that all agents implement PD game with their own neighbors. And is the payoff matrix for node , expressed as follows:then we solve the data informationandwhere and Eq. (6)–(8) satisfy the following equation:
In a similar fashion, through compressive sensing method, the remaining agents yield payoff from their neighborconnection; the overall network adjacency matrix can be expressed as . Due to the sparsity of , it is assured that it can be solved by using CS theory to get accurate results from partial time series data (, where denotes the length of time series data, and denotes the number of moment: for example, means that the number of used measurements equals ).
2.2. Network Model
A network can be denoted as an adjacent matrix , which contains nodes and edges. In general, represents the degree of node , and represents the clustering coefficients of node ; it represents the ratio between the number of closed triplets and the total number of connected triplets of vertices; it can be calculated as follows: where denotes that there exists a partnership between node and , so when , then a triangle forms among nodes , , . The whole network clustering coefficient should be expressed as
We validated our method by using PD games data occurring in Holme–Kim networks. Contrary to BA model, Holme–Kim model adds Triad Formation process (TF process), in order to change the principle when a new node is attached to an existing node by the principle called Preferential Attachment process (PA process). By this way, it not only makes the network growth mode more flexible, but also increases the clustering coefficient. In the Holme–Kim model, the evolution process of network has three driver factors: growth, preference attachment, and triad formation. The algorithm of the Holme–Kim model is shown as follows [52]:
Growth. At the beginning, the network has nodes; on each time step, one new node with edges connects with the existing nodes ( ).
Preferential Attachment. There is preference when the new node chooses other nodes to connect. The ratio of choosing node depends on the degree of this node. It can be expressed as follows:
Triad Formation. After adding an edge between new node and neighbor in the previous PA step, another neighbor node of is chosen to connect with node with probability . The network structure varies as changes; Figure 1 shows the relationship between probabilities and clustering coefficients of network. It is obvious that as increases, grows as well, which implies that the network gets more closely.
Another PD game data occurring in NewmanWatts smallworld network (homogeneous smallworld network) exhibits a homogeneous connectivity distribution, in the sense that the number of connections for all nodes is the same; the algorithm steps can be described as(1)First, initializing a network with nodes, it is ringshaped; each node has neighbors, , is an integer (usually small).(2)Then adding an edge between the unconnected nodes with probability ().
Dunring the process, there will be multiple edges between any pair of nodes. All nodes will have no selfloops; the clustering coefficients of the network are denoted as .
3. Experimental Results
3.1. Generating Artificial Networks with Tunable Clustering Coefficient
The PD game is simulated on two types of networks, Holme–Kim networks and NewmanWatts smallworld. To test the efficiency in reconstructing a network with our method, we first generate an artificial scalefree network with nodes by using Holme–Kim model and vary the value from to . The clustering coefficients () are also incorporated into this range correspondingly. Then, without loss of generality, we set ==, =. We, especially, study the realtionship between SR, which measures the accuracy of network reconstruction, and the degree in Holme–Kim networks. Each piece of data is averaged, performed on networks by runs. In order to reconfirm the performance of the algorithm, we set different network sizes to further investigate the performance. Analogously, we also reproduce a group of NewmanWatts smallworld networks by using compressive sensing method to adjust their clustering coefficients into the same range. In order to uncover the topology structure of the evolution network, we record the strategies and payoffs in the form of time series as the system tends to the steady state.
3.2. Evaluation Criterion
PD game is implemented to investigate the performance of the network diffusion dynamics and structures; after recording the measurement matrix and measurement vector , we introduce the SR to measure the performance; the accuracy rate can be expressed as follows: in which denotes neighbors of node durning test set; denotes the neighbors of node durning training set. For a single player, SR denotes the ratio of the successfully predicted number of neighbor connections to the actual number of neighbors. At last, we get the average value for the whole network.
3.3. Results
Figure 2(a) shows the SR of the network construction by means of norm minimization, as shown in the picture; different indicate different topological structures of networks with tunable clustering coefficients; judging from transverse direction, the SR would increase along with the increase of value; the SR, especially, would reach the highest and would not get larger obviously when value gets close to . From the vertical perspective, the value of SR increases with the increase of , for instance, the SR with which, when the length of data was , is higher than that of , and so forth. It demonstrates that we can use norm minimization to reconstruct network effectively. Moreover, it is necessary to detail the progress of whole network reconstruction to infer local characteristic for each sigle node; we investigate the SR among single nodes, as shown in the subgraph in Figure 2(a). The bigger the degree for each node, the higher the SR. It indicates that the hub node has higher SR, which manifests that the node, which has the maximum degree, contributes to the accurate reconstruction.
(a)
(b)
(c)
Furthermore, in order to validate norm minimization algorithm, we set different network sizes to further investigate the performance; we generate another two kinds of network size, which incorporates nodes and nodes, respectively. As shown in Figure 2(b), when the value increases, the SR increases correspondingly, but gets lower when the network size increases. From this point of view, we can coclude that the network size can influence the result of network reconstruction. For instance, when the =, network size decreases from to , then SR increases from to , and so forth. The relationship between SR and network size is inversely related. In reality, noise exists everywhere in physical systems; the data get from complex systems are more or less influenced by noise. In order to further improve the experiment, Gaussian noises [()] are added in the experiment (, is the noise parameter) to investigate the stability of the result. Figure 2(c) indicates that the network size is and . We find that, compared with the data after adding the Gaussian noise, the accuracy of initial data is higher, although the CS method could reconstruct the missed links in the network.
As a control group, we investigate the relationship between SR and clustering coefficient in NewmanWatts smallworld network by means of norm minimization, in which respectively. As shown in Figure 3(a) we can find that SR decreases as the clustering coefficients of the the network increase, which shows adverse tendency compared with Holme–Kim model. The main reason may be originating from the fact that the degree distribution in NewmanWatts smallworld network is homogeneous; the nodes which have homogeneous degrees need similar data to reconstruct the network. The subgraph in Figure 3(b) shows the relation between the SR and degree distribution of each game player, in which the network size is and . It shows that the bigger the degree of the node, the lower the SR.
(a)
(b)
(c)
The methods used to solve sparse approximation problems are available in a variety of ways. As we present our norm minimization algorithm in the above context of networks, we would like to compare the performance of our framework for network reconstruction with OMP [53], a greedy algorithm, which can be expressed ascomparied with norm minimization. OMP needs much more data and has lower accurcy [54]. The number of iterations required to find the correct support set determines the complexity of the algorithm. For the comparison, we carry out all experiments. The results are shown in Figures 4 and 5. The overall tendency is implemented by OMP in accordance with norm minimization. In addition, the two methods are simultaneously implemented on scalefree networks and smallworld netowrk, with data occurring in evolutionary games. As shown in Figures 6 and 7, we can find that the former proposed method is higher than or equal to OMP; for the Holme–Kim model network, the resulting SR in our method is higher than OMP; for the NewmanWatts smallworld model, the resulting SR is nearly equal to OMP. The main reason may result from the fact that both norm minimization and OMP can solve the problem of sparse signal recovery [55]. Both the norm and orthogonal matching pursuit are the methods used to solve sparse approximation problems; by using L1norm minimization method, it can get optimal solution to the problem of network reconstruction [56]. However, NewmanWatts smallworld behaves much more sparse [57], as described in Table 1. These results demonstrate that two type networks can be efficiently inferred from limited measurements using norm minimization method. In addition, we compare the two algorithms on the performance of convergence rate between two models as shown in Tables 2, 3, 4, and 5. In order to achieve high accuracy with different data length, the convergence rate is different. Compared with the norm minimization, the OMP yields a faster computation speed; overall OMP is 1.2 times the computation speed of norm minimization. Inspired by this, we may consider using OMP in smallworld network. All the above demonstrate that the network topological structure influences the accuracy of network reconstruction. We should use a proper method to deal with the complex problem of network reconstruction.





(a)
(b)
(a)
(b)
(a)
(b)
(c)
(a)
(b)
(c)
4. Conclusion
In our study, we investigate the effect on the accuracy of the network reconstruction by norm minimization method with different topological structures of networks, measured by variable clustering coefficients among two types of network models: one is scalefree network and the other is smallworld network. First, we construct two types of network models with variable clustering coefficients, then we reconstruct the network based on the evolutionarygame data by norm minimization method. We find that the success rate of the two kinds of network performs differently; for Holme–Kim (scalefree) network, the success rate increases correspondingly when the clustering coefficients increase but decreases when the clustering coefficients increase in the NewmanWatts (smallworld network). The explanation can be derived from the fact that, in Holme–Kim model, the bigger the degree for each node, the lower the success rate, while the smallworld behaves opposite. Meanwhile, both of the success rates for the two network models decrease as the network size increases. At last, we adopt OMP method to reconstruct network. The results show that the SR carried out by norm minimization method is higher than or at least equal to OMP, and the accuracy rate of norm minimization method is 10% higher than that of OMP. Meanwhile, OMP is 1.2 times the convergence rate of norm minimization. From the above, we can conclude that the network structure has influence on the accuracy of the network reconstruction by compressive sensing method.
Our method, mentioned in the paper, can be adopted to reconstruct sparse networks among the realworld networks for the reason that smallworld phenomenon and scalefree characteristics are two typical complex network characteristics. Our contribution to the current literature can be summarized as follows: the method metioned above needs time series data; usually the topology structure of the network cannot be abtained. From this point of view, if we do not know about the topology structure, we may first choose norm minimization method; if we know the topology structure of the network, the network has the same characteristics as HolmeKim model (scalefree characteristics); we may be more likely to choose norm minimization; if the network has the same properties as the smallworld network, for the accuracy recovery by norm minimization is nearly equal to that of OMP, we can adopt both of these methods; however, OMP method has an advantage over norm minimization from a convergence speed perspective, so if we consider the speed of convergence, we may choose OMP method. Overall, our methods, in principle, are applicable in realworld such as protein network, Internet network. Meanwhile, the research also puts forward application of CS in other research fields, such as remote sensing and social networks.
Meanwhile, there exist some shortcomings in this paper, which may influence the further research for network reconstruction. First, the two methods mentioned in this paper are used to recover sparse network; better methods are worth exploring [58, 59]. Second, we only investigate the effect of compressive sensing depending on dynamic clustering coefficients of the macro network structure. More characteristics should be considered such as betweenness, closeness, and eigenvector centrality to verify our methods. In addition, we should also consider the micro network structure, such as Ring, Chain, and Star, which may affect the result [60]. Third, in this paper, we consider only two phenomena: one is the smallworld, and the other is scalefree network, but in the actual network there are both scalefree network and small world network natures of the network, so it is possible that the two methods may not effectively reconstruct the network; we should find a better way. Last, during the process of simulation, all the data are observable. In fact, the measurement can be obtained partially [61, 62]; that is to say, some hidden nodes cannot be got in the system. How to implement our methods in these situations deserves to be studied further.
Generally speaking, this paper puts forward two methods to deal with the problem of network reconstruction through two different manners. It provides directions for us to reconstruct complex network; yet it is expected to make efforts to pursue better approaches. All these deserved to be explored.
Data Availability
No data were used to support this study.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This work is supported by the National Natural Science Foundation of China (Grant No. 71271126), doctoral Fund of Ministry of Education of China (No. 20120078110002), and Fundamental Research Funds for the Central Universities, supported by the GIFSUFE (Grant No. CXJJ2016414).
References
 M. Timme, “Revealing Network Connectivity from Response Dynamics,” Physical Review Letters, vol. 98, no. 22, 2007. View at: Publisher Site  Google Scholar
 J. Bongard and H. Lipson, “Automated reverse engineering of nonlinear dynamical systems,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 104, no. 24, pp. 9943–9948, 2007. View at: Publisher Site  Google Scholar
 A. Clauset, C. Moore, and M. E. J. Newman, “Hierarchical structure and the prediction of missing links in networks,” Nature, vol. 453, no. 7191, pp. 98–101, 2008. View at: Publisher Site  Google Scholar
 R. Guimerà and M. SalesPardo, “Missing and spurious interactions and the reconstruction of complex networks,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 106, no. 52, pp. 22073–22078, 2009. View at: Publisher Site  Google Scholar
 Z. Levnajić and A. Pikovsky, “Network Reconstruction from Random Phase Resetting,” Physical Review Letters, vol. 107, no. 3, 2011. View at: Publisher Site  Google Scholar
 D. Marbach, R. J. Prill, T. Schaffter, C. Mattiussi, D. Floreano, and G. Stolovitzky, “Revealing strengths and weaknesses of methods for gene network inference,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 107, no. 14, pp. 6286–6291, 2010. View at: Publisher Site  Google Scholar
 G. Michailidis and F. D'AlchéBuc, “Autoregressive models for gene regulatory network inference: sparsity, stability and causality issues,” Mathematical Biosciences, vol. 246, no. 2, pp. 326–334, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 Z. Shen, W.X. Wang, Y. Fan, Z. Di, and Y.C. Lai, “Reconstructing propagation networks with natural diversity and identifying hidden sources,” Nature Communications, vol. 5, no. 5, p. 4323, 2014. View at: Publisher Site  Google Scholar
 L. Lü and T. Zhou, “Link prediction in complex networks: a survey,” Physica A: Statistical Mechanics and its Applications, vol. 390, no. 6, pp. 1150–1170, 2011. View at: Publisher Site  Google Scholar
 N. Dojer, A. Gambin, A. Mizera, B. Wilczyński, and J. Tiuryn, “Applying dynamic Bayesian networks to perturbed gene expression data,” BMC Bioinformatics, vol. 7, article no. 249, 2006. View at: Publisher Site  Google Scholar
 E. D. Sontag, “Network reconstruction based on steadystate data,” Essays in Biochemistry, vol. 45, pp. 161–176, 2008. View at: Publisher Site  Google Scholar
 E. J. Candes, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” Institute of Electrical and Electronics Engineers Transactions on Information Theory, vol. 52, no. 2, pp. 489–509, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 J. Jin, Y. Gu, and S. Mei, “An Introduction to Compressive Sampling and Its Applications,” Journal of Electronics Information & Technology, vol. 32, no. 2, pp. 470–475, 2010. View at: Publisher Site  Google Scholar
 J. Romberg, “Imaging via compressive sampling,” IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 14–20, 2008. View at: Publisher Site  Google Scholar
 J. M. Smith, Evolution and the Theory of Games, Springer, Boston, MA, USA, 1993. View at: Publisher Site
 S. Hempel, A. Koseska, J. Kurths, and Z. Nikoloski, “Inner composition alignment for inferring directed networks from short time series,” Physical Review Letters, vol. 107, no. 5, 2011. View at: Google Scholar
 W. Wang, R. Yang, Y. Lai, V. Kovanis, and C. Grebogi, “Predicting Catastrophes in Nonlinear Dynamical Systems by Compressive Sensing,” Physical Review Letters, vol. 106, no. 15, 2011. View at: Publisher Site  Google Scholar
 L. Xiao, P. Yang, Y. Xiao et al., “Efficient compressive sensing detectors for generalized spatial modulation systems,” IEEE Transactions on Vehicular Technology, vol. 66, no. 2, pp. 1284–1298, 2017. View at: Publisher Site  Google Scholar
 L. D. Abreu and J. L. Romero, “M{SE} estimates for multitaper spectral estimation and offgrid compressive sensing,” Institute of Electrical and Electronics Engineers Transactions on Information Theory, vol. 63, no. 12, pp. 7770–7776, 2017. View at: Publisher Site  Google Scholar  MathSciNet
 W.X. Wang, Y.C. Lai, C. Grebogi, and J. Ye, “Network Reconstruction Based on EvolutionaryGame Data via Compressive Sensing,” Physical Review X, vol. 1, no. 2, Article ID 021021, pp. 1–7, 2011. View at: Publisher Site  Google Scholar
 T. S. Gardner, D. Di Bernardo, D. Lorenz, and J. J. Collins, “Inferring genetic networks and identifying compound mode of action via expression profiling,” Science, vol. 301, no. 5629, pp. 102–105, 2003. View at: Publisher Site  Google Scholar
 X. Han, Z. Shen, W. Wang, and Z. Di, “Robust Reconstruction of Complex Networks from Sparse Data,” Physical Review Letters, vol. 114, no. 2, 2015. View at: Publisher Site  Google Scholar
 H. Lee, D. S. Lee, H. Kang, B.N. Kim, and M. K. Chung, “Sparse brain network recovery under compressed sensing,” IEEE Transactions on Medical Imaging, vol. 30, no. 5, pp. 1154–1165, 2011. View at: Publisher Site  Google Scholar
 P. Siyari, H. R. Rabiee, M. Salehi, and M. E. Mehdiabadi, “Network reconstruction under compressive sensing,” in Proceedings of the 2012 ASE International Conference on Social Informatics, SocialInformatics 2012, pp. 19–25, USA, December 2012. View at: Google Scholar
 Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani, “Counter braids: A novel counter architecture for perflow measurement,” in Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS'08, pp. 121–132, USA, June 2008. View at: Google Scholar
 R. Gaeta, M. Grangetto, and M. Sereno, “Local access to sparse and large global information in P2P networks: A case for compressive sensing,” in Proceedings of the 2010 IEEE 10th International Conference on PeertoPeer Computing, P2P 2010, Netherlands, August 2010. View at: Google Scholar
 F. C. Santos and J. M. Pacheco, “Scalefree networks provide a unifying framework for the emergence of cooperation,” Physical Review Letters, vol. 95, no. 9, Article ID 098104, 2005. View at: Publisher Site  Google Scholar
 Z. Rong, X. Li, and X. Wang, “Roles of mixing patterns in cooperation on a scalefree networked game,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 76, no. 2, 2007. View at: Publisher Site  Google Scholar
 D.H. Shin and Y.J. Shin, “Why do people play social network games?” Computers in Human Behavior, vol. 27, no. 2, pp. 852–861, 2011. View at: Publisher Site  Google Scholar
 M. O. Jackson, “Allocation rules for network games,” Games and Economic Behavior, vol. 51, no. 1, pp. 128–154, 2005. View at: Publisher Site  Google Scholar  MathSciNet
 T. Yang, Z. Meng, G. Shi, Y. Hong, and K. H. Johansson, “Network synchronization with nonlinear dynamics and switching interactions,” Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 61, no. 10, pp. 3103–3108, 2016. View at: Publisher Site  Google Scholar  MathSciNet
 M. P. van den Heuvel, R. C. W. Mandl, C. J. Stam, R. S. Kahn, and H. E. Hulshoff Pol, “Aberrant frontal and temporal complex network structure in schizophrenia: a graph theoretical analysis,” The Journal of Neuroscience, vol. 30, no. 47, pp. 15915–15926, 2010. View at: Publisher Site  Google Scholar
 S. Boccaletti, G. Bianconi, and R. Criado, “The structure and dynamics of multilayer networks,” Physics Reports, vol. 544, no. 1, pp. 1–122, 2014. View at: Publisher Site  Google Scholar
 M. Pósfai, Y. Liu, J. Slotine, and A. Barabási, “Effect of correlations on network controllability,” Scientific Reports, vol. 3, no. 1, 2013. View at: Publisher Site  Google Scholar
 Q. Guo, G. Liang, J. Fu, J. Han, and J. Liu, “Roles of mixing patterns in the network reconstruction,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 94, no. 5, 2016. View at: Publisher Site  Google Scholar
 D. J. Watts and S. H. Strogatz, “Collective dynamics of “smallworld” networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. View at: Publisher Site  Google Scholar
 A. L. Barabási, R. Albert, and H. Jeong, “Meanfield theory for scalefree random networks,” Physica A: Statistical Mechanics and its Applications, vol. 272, no. 1, pp. 173–187, 1999. View at: Publisher Site  Google Scholar
 A. Barabasi and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999. View at: Publisher Site  Google Scholar  MathSciNet
 P. Holme and B. J. Kim, “Growing scalefree networks with tunable clustering,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 65, no. 2, Article ID 026107, 2002. View at: Publisher Site  Google Scholar
 D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 E. J. Candès and M. B. Wakin, “An introduction to compressive sampling: a sensing/sampling paradigm that goes against the common knowledge in data acquisition,” IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21–30, 2008. View at: Publisher Site  Google Scholar
 E. J. Candes and T. Tao, “Nearoptimal signal recovery from random projections: universal encoding strategies?” Institute of Electrical and Electronics Engineers Transactions on Information Theory, vol. 52, no. 12, pp. 5406–5425, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 E. J. Candes, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on Pure and Applied Mathematics, vol. 59, no. 8, pp. 1207–1223, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 S. G. Shandilya and M. Timme, “Inferring network topology from complex dynamics,” New Journal of Physics , vol. 13, no. 1, p. 013004, 2011. View at: Publisher Site  Google Scholar
 K. Sigmund and M. A. Nowak, “Evolutionary game theory,” Current Biology, vol. 9, no. 14, pp. R503–R505, 1999. View at: Publisher Site  Google Scholar
 C. Hauert and M. Doebell, “Spatial structure often inhibits the evolution of cooperation in the snowdrift game,” Nature, vol. 428, no. 6983, pp. 643–646, 2004. View at: Publisher Site  Google Scholar
 G. Abramson and M. Kuperman, “Social games in a social network,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 63, Article ID 030901, 2001. View at: Publisher Site  Google Scholar
 G. Szabó, J. Vukov, and A. Szolnoki, “Phase diagrams for an evolutionary prisoner's dilemma game on twodimensional lattices,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 72, no. 4, Article ID 047107, 2005. View at: Publisher Site  Google Scholar
 M. A. Nowak and R. M. May, “Evolutionary games and spatial chaos,” Nature, vol. 359, no. 6398, pp. 826–829, 1992. View at: Publisher Site  Google Scholar
 J.J. Wu, B.Y. Zhang, Z.X. Zhou et al., “Costly punishment does not always increase cooperation,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 106, no. 41, pp. 17448–17451, 2009. View at: Publisher Site  Google Scholar
 G. Szabó and C. Tőke, “Evolutionary prisoner’s dilemma game on a square lattice,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 58, no. 1, pp. 69–73, 1998. View at: Publisher Site  Google Scholar
 Z.Y. Wang, J.T. Han, and J. Zhao, “Identifying node spreading influence for tunable clustering coefficient networks,” Physica A: Statistical Mechanics and its Applications, vol. 486, pp. 242–250, 2017. View at: Publisher Site  Google Scholar
 A. Kulkarni and T. Mohsenin, “Low Overhead Architectures for OMP Compressive Sensing Reconstruction Algorithm,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 64, no. 6, pp. 1468–1480, 2017. View at: Publisher Site  Google Scholar
 J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Transactions on Information Theory, vol. 53, no. 12, pp. 4655–4666, 2007. View at: Publisher Site  Google Scholar  MathSciNet
 V. K. Goyal, A. K. Fletcher, and S. Rangan, “Compressive sampling and lossy compression: Do random measurements provide an efficient method of representing sparse signals?” IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 48–56, 2008. View at: Publisher Site  Google Scholar
 E. J. Candès, “The restricted isometry property and its implications for compressed sensing,” Comptes Rendus Mathematique, vol. 346, no. 910, pp. 589–592, 2008. View at: Publisher Site  Google Scholar  MathSciNet
 Z.J. Jiang, “The numbers of participants and nucleonnucleon collisions in highenergy heavyion collisions,” Acta Physica Sinica, vol. 56, no. 9, pp. 5191–5195, 2007 (Chinese). View at: Google Scholar
 Z. Xu, X. Chang, F. Xu, and H. Zhang, “ regularization: a thresholding representation theory and a fast solver,” IEEE Transactions on Neural Networks and Learning Systems, vol. 23, no. 7, pp. 1013–1027, 2012. View at: Publisher Site  Google Scholar
 L. Ma, X. Han, Z. Shen, W. Wang, Z. Di, and Z. Gao, “Efficient Reconstruction of Heterogeneous Networks from Time Series via Compressed Sensing,” PLoS ONE, vol. 10, no. 11, p. e0142837, 2015. View at: Publisher Site  Google Scholar
 S. Battiston, G. Caldarelli, R. M. May, T. Roukny, and J. E. Stiglitz, “The price of complexity in financial networks,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 113, no. 36, pp. 10031–10036, 2016. View at: Publisher Site  Google Scholar  MathSciNet
 Y. Yuan, G.B. Stan, S. Warnick, and J. Goncalves, “Robust dynamical network structure reconstruction,” Automatica, vol. 47, no. 6, pp. 1230–1235, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 D. Hayden, Y. H. Chang, J. Goncalves, and C. Tomlin, Compressed sensing for network reconstruction, 2014.
Copyright
Copyright © 2018 Jingti Han and Changmei Mao. 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.