- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Abstract and Applied Analysis
Volume 2013 (2013), Article ID 795682, 5 pages
A New Class of the Planar Networks with High Clustering and High Entropy
1Department of Mathematics, Qinghai Normal University, Xining, Qinghai 810008, China
2School of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi 710062, China
3Department of Computer Science, Qinghai Normal University, Xining, Qinghai 810008, China
Received 27 September 2013; Accepted 16 November 2013
Academic Editor: Jinde Cao
Copyright © 2013 Guona Hu 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.
Small-world networks are ubiquitous in real-life systems, such as the World Wide Web, communication networks, and electric power grids, and most of them are stochastic. In this paper, we present a model that generates a small-world network in a simple deterministic way and analyze the relevant topological properties of the model, such as the degree distribution, clustering coefficient, and diameter. Meanwhile, according to the special structure of the model, we derive analytically the exact numbers of spanning trees in the planar networks. The results show that the model has a discrete exponential degree distribution, high clustering coefficient, short diameter, and high entropy.
Over the past decade, a lot of authors in different scientific communities have made a concerted effort toward unveiling and understanding the generic properties of complex networked systems in nature and society [1####^~^~^~^~^~^####x2013;5]. One of the most important things is the network modeling. Its importance lies in the fact that it cannot only capture correctly the processes that assembled the networks that we see today, but also help to know how various microscopic processes influence the network topology . At present, many papers related to complex network models are stochastic [7####^~^~^~^~^~^####x2013;9]. But the randomness, while in line with the major features of real-life networks, makes it harder to gain a visual understanding of how networks are shaped and how do different nodes relate to each other . Therefore, it would be not only of major theoretical interest but also of great practical significance to construct models that lead to small-world networks in deterministic fashions.
The first successful attempt to generate networks with high clustering coefficients and small average path length (APL) is the model introduced by Watts and Strogatz (WS model) . This pioneering work of Watts and Strogatz started an avalanche of research on the properties of small-world networks and the Watts-Strogatz (WS) model . A much-studied variant of the WS model was proposed by Newman and Watts [13, 14]. In 1999, Kasturirangan proposed an alternative model to WS small-world network . Actually, small-world networks are characterized by three main properties. First, their APL does not increase linearly with the system size, but grows logarithmically with the number of nodes or slower. Second, average node degree of the network is small. Third, the network has a strong average clustering  compared to an Erd####^~^~^~^~^~^####xf6;s-R####^~^~^~^~^~^####xe9;nyi (ER) random network [16, 17] of equal size and average node degree.
In this paper, we propose a generation algorithm of a deterministic planar network model. And we analyze its topological properties; the results show that our model has a discrete exponential degree distribution, high clustering, and small diameter, which appears small-world effect. In addition, it is known to us that the number of spanning trees is an important quantity characterizing the reliability of a network. Generally, the number of spanning trees in a network can be obtained by directly calculating a related determinant corresponding to the network. However, for a large network, evaluating the relevant determinant is intractable . Therefore, we propose a generic linear algorithm to count the number of spanning trees of the general planar networks. Using the algorithm, we derive analytically the exact numbers of spanning trees in the planar networks. Based on the number of spanning trees, we determine the entropy of its spanning trees.
2. Network Construction
The studied network is constructed in an iterative way. We denote the network after steps by . Then, the network at step is built as follows. For , is a complete graph with 4 nodes. For , is obtained from by replacing each existing iterative edge in with . The process is repeated till the desired graph order is reached; see Figure 1.
Now, we compute the order and size of . Let , , and denote, respectively, the set of vertices, edges, and iterative edges introduced at step , while and are the set of vertices and edges of the graph . Notice that, at each iteration, an iterative edge is replaced by two new iterative edges and three noniterative edges. Therefore, , and . As each iterative edge introduces at the next iteration two new vertices and five new edges, we have and . As , and . Thus, The average degree is then Obviously, for large , it is approximately equal to 5.
3. Relevant Characteristics of the Deterministic Small-World Network
In the following, we concentrate on the degree distribution, clustering coefficient, and diameter.
3.1. Degree Distribution
The degree is the simplest and the most intensively studied characteristic of an individual node. The degree of a node is the number of edges in the whole network connected to . The degree distribution is defined as the probability that a randomly selected node has exactly edges.
Let be the degree of node at step . All nodes can be divided into two categories. (i) Interior nodes; for those nodes that only connect to noniterative edges, their degree is always equal to 3. (ii) Noninterior nodes; one can see that at any iteration, a iterative edge is replaced by two new iterative edges and three new noniterative edges, so the degree of noninterior nodes is added 4 at each iteration. Thus, the degree of a node satisfies the relation . Then, . And we have Let be the step at which a node is created, then , and hence, for noninterior nodes, we have Therefore, the degree spectrum of the present network is a series of discrete values: at step , the number of nodes of degree , equals , respectively. Other values of degree are absent in the spectrum. Due to the discreteness of this degree spectrum, it is convenient to obtain its cumulative degree distribution ; that is, Using (5), we have . Hence, Obviously, when the size of the network is large, the degree distribution is an exponential of a power of degree .
3.2. Clustering Coefficient
Clustering coefficient is another significant property of a network, which provides a measure of the local structure within the network. The most immediate measure of clustering is the clustering coefficient for every node . By definition, clustering coefficient of a node is the ratio of the total number of edges that actually exist between all its nearest neighbors and the number of all possible edges between them; that is, . The clustering coefficient of the whole network is the average of all individual s. For this network, we can obtain the exact expression of the clustering coefficient . By construction, for any given node having a degree , there are links that actually exist among the neighbor nodes. So, one can see that there is a one-to-one corresponding relation between the coefficient of the node and its degree : . This expression indicates that the local clustering scales as .
Clearly, the number of nodes of degree , equals , respectively. The clustering coefficient is given by the following: For infinite , approaches to a constant value of 0.8309, so the clustering is high.
Besides degree distribution and clustering coefficient, average path length (APL) is another important parameter to characterize a network. APL is defined as the average number of edges along the shortest paths for all possible pairs of network nodes. People have found the small-world phenomenon in most real-life networks that behave with a short APL. For most network models, it is hard to obtain the analytic solution of APL. To demonstrate the short distance between any pair of nodes, we can adopt another parameter that is defined as the maximal communication delay in the network. If a network has a small diameter, then this network is undoubtedly with a short APL . For the network proposed, we denote the diameter at iteration as . According to Figure 1, we can clearly know that and . At each iteration, one can see that the diameter always lies between a pair of newly created nodes at this iteration because at each iterative edge we paste a complete graph , so the diameter for the network proposed has the following simple formula, .
Notice that the logarithm value of total number of nodes is approximately equal to for large . Thus, the diameter grows logarithmically with the number of nodes and the average path length increases more slowly than .
Based on the above discussions, our model is a deterministic small-world network because it is a sparse one with high clustering and short diameter, which satisfies the necessary property for small-world network.
4. Spanning Trees in the Network
In this section, we investigate the number of spanning trees in this network. Our aim is to derive the exact formula for the number of spanning trees and determine its entropy.
Let be a planar graph generated by steps. Since is symmetry, suppose that the edges , , and are weighted by , where denote the number of spanning trees of the subgraph and denote the number of spanning forests of the subgraph with two components such and belong to distinct components. Let be the number of spanning trees of . Figure 3 gives all spanning trees of and Figure 4 gives all spanning forests with two components. Then, by Figure 2, we have
According to Figures 2, 3, and 4, we obtain the recursion relations between and as follows: Let , by (10) it follows that with the initial condition . So, we get By (9), Substituting (11) and (12) with (13), we have From (14), together with (1), we determine the entropy of the number of spanning trees####^~^~^~^~^~^####x2014;an important quantity characterizing network structure####^~^~^~^~^~^####x2014;for as the limiting value [20, 21]:
The obtained entropy of spanning trees in can be compared to those found in other networks. In the pseudofractal fractal web , the entropy is 0.8959, a value less than 1, for the square lattice  and the two-dimensional Sierpinski gasket , their entropy of spanning trees is 1.16624 and 1.0486, respectively, and for the fractal scale-free lattice , the entropy is 1.0397. And all of them have the same average degree of 4. While in Apollonian network  having the average degree of 6, the entropy is 1.3540, the entropy of our model with average degree of 5 is between them.
In conclusion, we have investigated a simple model, which is constructed in a deterministic way. Then, we have presented an exhaustive analysis of many properties of the considered model and obtained the analytic solutions for most of the topological features, including degree distributions, clustering coefficient, and diameter. Finally, according to the special structure, we give a general algorithm to count the number of spanning trees of this model. Using the algorithm, we obtained entropies of spanning trees.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
This research supported by the National Science Foundation of China (nos. 61164005 and 60863006), the National Basic Research Program of China (no. 2010CB334708), and Program for Changjiang Scholars and Innovative Research Team in University (no. IRT1068).
- R. Albert and A. L. Barabási, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol. 74, no. 1, pp. 47–97, 2002.
- S. N. Dorogovtsev and J. F. F. Mendes, “Evolution of networks,” Advances in Physics, vol. 51, no. 4, pp. 1079–1187, 2002.
- M. E. J. Newman, “The structure and function of complex networks,” SIAM Review, vol. 45, no. 2, pp. 167–256, 2003.
- S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, “Complex networks: structure and dynamics,” Physics Reports, vol. 424, no. 4-5, pp. 175–308, 2006.
- Z. Zhang, Y. Lin, S. Gao, S. Zhou, and J. Guan, “Average distance in a hierarchical scale-free network: an exact solution,” Journal of Statistical Mechanics, vol. 2009, no. 10, Article ID P10022, 2009.
- Z. Z. Zhang, S. G. Zhou, and J. Q. Fang, “Recent progess of deterministic models of complex networks,” Complex Systems and Complexity Science, Article ID 16723813, 2008.
- S. N. Dorogovtsev and J. F. F. Mendes, “Scalling behavior of developing and decaying networks,” Europhysics Letters, vol. 52, no. 1, 2000.
- J. M. Kleinberg, “Navigation in a small world,” Nature, vol. 406, no. 6798, p. 845, 2000.
- J. Ozik, B. R. Hunt, and E. Ott, “Growing networks with geographical attachment preference: emergence of small worlds,” Physical Review E, vol. 69, no. 2, Article ID 026108, pp. 026108–5, 2004.
- A.-L. Barabási, E. Ravasz, and T. Vicsek, “Deterministic scale-free networks,” Physica A, vol. 299, no. 3-4, pp. 559–564, 2001.
- D. J. Watts and S. H. Strogatz, “Collective dynamics of small world network,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.
- Z. Zhang, L. Rong, and C. Guo, “A deterministic small-world network created by edge iterations,” Physica A, vol. 363, no. 2, pp. 567–572, 2006.
- M. E. J. Newman and D. J. Watts, “Renormalization group analysis of the small-world network model,” Physics Letters A, vol. 263, no. 4–6, pp. 341–346, 1999.
- M. E. J. Newman and D. J. Watts, “Scaling and percolation in the small-world network model,” Physical Review E, vol. 60, no. 6, pp. 7332–7342, 1999.
- R. Kasturirangan, Multiple Scales in Small-World Graphs AI Lab Memo. 1663, Massachusetts Institute of Technology, 1999.
- P. Erdös and A. R. Rényi, “On random graphs I,” Publicationes Mathematicae, vol. 6, pp. 290–297, 1959.
- P. Erdös and A. R. Rényi, “On the evolution of random graphs,” Publication of the Mathematical Institute of the Hungarian Academy of Sciences, vol. 5, pp. 17–61, 1960.
- Y. Z. Xiao and H. X. Zhao, “New method for counting the numberof spanning trees in a two-tree network,” Physica A, vol. 392, pp. 4576–4583, 2013.
- Z.-M. Lu and S.-Z. Guo, “A small-world network derived from the deterministic uniform recursive tree,” Physica A, vol. 391, no. 1-2, pp. 87–92, 2012.
- R. Burton and R. Pemantle, “Local characteristics, entropyand limit theorems for spanning trees and domino tilingsvia transfer-impedances,” Annals of Probability, vol. 21, p. 1329, 1993.
- R. Lyons, “Asymptotic enumeration of spanning trees,” Combinatorics Probability and Computing, vol. 14, no. 4, pp. 491–522, 2005.
- Z. Z. Zhang, H. X. Liu, B. Wu, and S. G. Zhou, “Enumeration of spanning trees in a pseudofractal scale-free web,” Europhysics Letters, vol. 90, no. 6, Article ID 680029, 2010.
- F. Y. Wu, “Number of spanning trees on a lattice,” Journal of Physics A, vol. 10, no. 6, article 4, pp. L113–L115, 1977.
- S.-C. Chang, L.-C. Chen, and W.-S. Yang, “Spanning trees on the Sierpinski gasket,” Journal of Statistical Physics, vol. 126, no. 3, pp. 649–667, 2007.
- Z. Zhang, H. Liu, B. Wu, and T. Zou, “Spanning trees in a fractal scale-free lattice,” Physical Review E, vol. 83, no. 1, Article ID 016116, 2011.
- Y. Lin, B. Wu, Z. Zhang, and G. Chen, “Counting spanning trees in self-similar networks by evaluating determinants,” Journal of Mathematical Physics, vol. 52, no. 11, Article ID 113303, 2011.