Nonlinear Dynamics in Epidemic SystemsView this Special Issue
Research Article | Open Access
Yuhong Ruan, Anwei Li, "Influence of Dynamical Change of Edges on Clustering Coefficients", Discrete Dynamics in Nature and Society, vol. 2015, Article ID 172720, 5 pages, 2015. https://doi.org/10.1155/2015/172720
Influence of Dynamical Change of Edges on Clustering Coefficients
Clustering coefficient is a very important measurement in complex networks, and it describes the average ratio between the actual existent edges and probable existent edges in the neighbor of one vertex in a complex network. Besides, in a complex networks, the dynamic change of edges can trigger directly the evolution of network and further affect the clustering coefficients. As a result, in this paper, we investigate the effects of the dynamic change of edge on the clustering coefficients. It is illustrated that the increase and decrease of the clustering coefficient can be effectively controlled by adding or deleting several edges of the network in the evolution of complex networks.
Clustering coefficient is one of the most important quantities in complex networks which can depict the average number of the ratio of the actual existence sides of the neighbors of the point and the sides that may exist in the neighbors of the point in the complex networks. At present, there are two different but the most basic definitions of clustering coefficients. Firstly, Watts and Strogatz proposed the concept of the clustering coefficients in their creative small-world network model which is denoted by . Secondly, shortly after Watts and Strogatz proposed the clustering coefficients, Newman et al. defined a concept similar to the former “transitivity,” which is denoted by .
Although the clustering coefficients is widely used in the study of complex networks, scholars do not have clustering coefficients discontinuous [3–19]. Shi et al. made a good overview on the research in this area and proposed a general method of calculating the clustering coefficients . Soffer and Vazquez proposed a definition of clustering coefficients independent of degree .
In the complex networks, dynamic change of the edges directly led to the dynamic evolution of the network and thus affect the variation of the clustering coefficients. And one of the core features of complex networks is a huge number of nodes and edges. This feature directly affects the complexity of calculating the clustering coefficient. In this paper, how dynamical changes of the edges affect the clustering coefficient is deeply presented which can reveal the impact of changes of the edge in the quality and quantity on the clustering coefficients. In addition, the obtained results show that, in the evolution of complex networks, we can make the clustering coefficients increase or decrease by deleting or adding the certain edges of networks.
2. Basic Concepts
For a given complex network, denotes the adjacency matrix of the network, denotes the number of nodes in the network, denotes the degree of node , denotes the set of neighbors of node , denotes the number of edges in the neighbors of node , and denotes the clustering coefficient of node ; namely,with global clustering coefficient:
As a special case, if , then .
For sake of description, we define a set by the adjacency matrix of the network. The set is used to describe a set of triangles with a shared edge . And we use the to denote the number of these triangles. In fact, when the edge exists, is equal to the number of nodes in . We show an example in Figure 1.
3. Effect of Edge Changes on the Clustering Coefficients
3.1. Effect of Deleting an Edge on the Clustering Coefficients
In this paper, we do not consider deleting the associated edge of suspension node. One edge of network is deleted, , , , and will certainly change, and may change. These factors that are intertwined directly affect the change of , and then affect the change of the complex network clustering coefficient .
Case 1 ( and ). (1) After the edge is deleted, the triangles that contained the shared edge turn to trielements because of losing side , but does not change. As a result, the changing amount of is(2) turns to , . turns to . In addition, the triangles which contained the shared edge turn to trimer because of losing side . Therefore, the number of the edges of neighbors of node reduces , turns to , and the amount of change is denoted by . As a result, we have the following expressions:
Similarly, turns to , and the amount of change is denoted by with
As mentioned above, when is a edge of the complex networks with and , deleting edge will lead to the change amount of the network clustering coefficient which is denoted by :
Case 2 ( and ). Consider the following:
Case 3 ( and ). Consider the following:
Case 4 ( and ). Consider the following:
3.2. Effect of Adding an Edge on the Clustering Coefficients
If edge is added, clustering coefficient , , and will change.
In this case, we just consider and .(1)The changing amount of is as follows: (2) turns into , . turn into . Without loss of generality, we assume that the former trielements turn into triangle because of adding edge . Therefore, the number of the edges among the neighbors of node increases . The above reasons make turn into and the changing amount is denoted by . As a result, we have the following expressions:
Similarly, turns into , and the changing amount is denoted by with
After adding an edge into the network, the changing amount of the clustering coefficients of the network is with
From the above analysis, one can see that, by adding or deleting an edge in the complex networks, the clustering coefficients of the complex networks may change. If we continue in-depth to analysis the above conclusions under the premise without destroying network connectivity, the following conclusions can be clearly gained.
Theorem 1. Deleting (adding) the edge does not constitute a triangle with any nodes in the network, and the clustering coefficient of the network increases (decreases).
Proof. If the edge does not constitute a triangle with any nodes in the network, then Based on the above analysis, if , then ; if , then . That is to say that deleting the edge does not constitute a triangle with any nodes in the network, and the clustering coefficient of the network increases.
Similarly, based on formula (13), adding the edge does not constitute a triangle with any nodes in the network, and the clustering coefficient of the network decreases.
Theorem 2. If , then after the edge was deleted.
Proof. When , if , by Theorem 1, ; if , after the edge was deleted, , , and .
When ,Obviously, if , then .
Corollary 3. If , then if edge is deleted.
If , then or (do not consider this case). When , as , after the edge was deleted, .
It is obtained directly from formula (13).
Corollary 4. If , then if the edge is added.
4. Discussion and Conclusion
In this paper, we present a systematic study on the effects of dynamic change of edges on clustering coefficients. It was found that the increase and decrease of the clustering coefficient can be effectively characterized by adding or deleting some edges of the network in the evolution of complex networks.
For the adaptive network, the susceptible may keep away from the infective for the reason that the susceptible individuals have the ability to recognize the infective group and avoid connecting with them . In this case, the susceptible will delete or add some edges in the complex networks. That is to say that our results can be extended to the disease transmission on complex networks [23–25].
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
- D. J. Watts and S. H. Strogatz, “Collective dynamics of 'small-world' networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.
- M. E. J. Newman, S. H. Strogatz, and D. J. Watts, “Random graphs with arbitrary degree distributions and their applications,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 64, no. 2, Article ID 026118, 2001.
- T. Schank and D. Wagner, “Approximating clustering coefficient and transitivity,” Journal of Graph Algorithms and Applications, vol. 9, no. 2, pp. 265–275, 2005.
- A. Barrat and M. Weigt, “On the properties of small-world network models,” European Physical Journal B, vol. 13, no. 3, pp. 547–560, 2000.
- R. Albert and A.-L. Barabasi, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol. 74, no. 1, pp. 47–97, 2002.
- K. Klemm and V. M. Eguíluz, “Growing scale-free networks with small-world behavior,” Physical Review E, vol. 65, no. 5, Article ID 057102, 2002.
- A. Fronczak, P. Fronczak, and J. A. Holyst, “Mean-field theory for clustering coefficients in Barabási-Albert networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 68, no. 4, Article ID 046126, 2003.
- M. Boguna and R. Pastor-Satorras, “Class of correlated random networks with hidden variables,” Physical Review E, vol. 68, no. 3, Article ID 036112, 2003.
- M. E. J. Newman and J. Park, “Why social networks are different from other types of networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 68, no. 3, Article ID 036122, 9 pages, 2003.
- P. M. Gleiss, P. F. Stadler, A. Wagner, and D. A. Fell, “Relevant cycles in chemical reaction networks,” Advances in Complex Systems, vol. 4, no. 2-3, pp. 207–226, 2001.
- G. Bianconi and A. Capocci, “Number of loops of size h in growing scale-free networks,” Physical Review Letters, vol. 90, no. 7, Article ID 078701, 2003.
- B. Bollobás and O. M. Riordan, “Mathematical results on scale-free random graphs,” in Handbook of Graphs and Networks, S. Bornholdt and H. G. Schuster, Eds., vol. 1, pp. 1–34, Wiley-VCH, Weinheim, Germany, 2002.
- M. E. J. Newman, “The structure and function of complex networks,” SIAM Review, vol. 45, no. 2, pp. 167–256, 2003.
- S. N. Dorogovtsev, A. V. Goltsev, and J. F. F. Mendes, “Pseudofractal scale-free web,” Physical Review E, vol. 65, no. 6, Article ID 066122, 2002.
- Z. Liu, Y.-C. Lai, N. Ye, and P. Dasgupta, “Connectivity distribution and attack tolerance of general networks with both preferential and random attachments,” Physics Letters Section A, vol. 303, no. 5-6, pp. 337–344, 2002.
- S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, “Structure of growing networks with preferential linking,” Physical Review Letters, vol. 85, no. 21, pp. 4633–4636, 2000.
- S. N. Dorogovtsev and J. F. F. Mendes, “Scaling properties of scale-free evolving networks: continuous approach,” Physical Review E, vol. 63, no. 5, Article ID 056125, 2001.
- D. Shi, Q. Chen, and L. Liu, “Markov chain-based numerical method for degree distributions of growing networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 71, no. 3, Article ID 036140, 2005.
- P. L. Krapivsky and S. Rendner, “Network growth by copying,” Physical Review E, vol. 71, Article ID 036118, 2005.
- D. Shi, S. X. Zhu, and L. Liu, “Clustering coefficients of growing networks,” Physica A, vol. 381, no. 1-2, pp. 515–524, 2007.
- S. N. Soffer and A. Vazquez, “Network clustering coefficient without degree-correlation biases,” Physical Review E, vol. 71, no. 5, Article ID 057101, 2005.
- T. Gross, C. J. D. D'Lima, and B. Blasius, “Epidemic dynamics on an adaptive network,” Physical Review Letters, vol. 96, no. 20, Article ID 208701, 2006.
- X. Zhang, G.-Q. Sun, Y.-X. Zhu, J. Ma, and Z. Jin, “Epidemic dynamics on semi-directed complex networks,” Mathematical Biosciences, vol. 246, no. 2, pp. 242–251, 2013.
- G.-Q. Sun, Z. Jin, L.-P. Song, A. Chakraborty, and B.-L. Li, “Phase transition in spatial epidemics using cellular automata with noise,” Ecological Research, vol. 26, no. 2, pp. 333–340, 2011.
- G.-Q. Sun, Q.-X. Liu, Z. Jin, A. Chakraborty, and B.-L. Li, “Influence of infection rate and migration on extinction of disease in spatial epidemics,” Journal of Theoretical Biology, vol. 264, no. 1, pp. 95–103, 2010.
Copyright © 2015 Yuhong Ruan and Anwei Li. 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.