About this Journal Submit a Manuscript Table of Contents
Abstract and Applied Analysis

Volume 2014 (2014), Article ID 761235, 7 pages

http://dx.doi.org/10.1155/2014/761235
Research Article

Asymptotic Degree Distribution of a Kind of Asymmetric Evolving Network

1School of Mathematics and Physics, Anhui Polytechnic University, Wuhu, Anhui 241000, China

2School of Management Engineering, Anhui Polytechnic University, Wuhu, Anhui 241000, China

3School of Applied Mathematics, Beijing Normal University Zhuhai, Zhuhai, Guangdong 519087, China

Received 19 May 2014; Accepted 4 June 2014; Published 9 July 2014

Academic Editor: Hongli Dong

Copyright © 2014 Zhimin Li 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.

Abstract

We propose a kind of evolving network which shows tree structure. The model is a combination of preferential attachment model and uniform model. We show that the proportional degree sequence obeys power law, exponential distribution, and other forms according to the relation of and parameter .

1. Introduction

In recent ten years, there has been much interest in understanding the properties of real large-scale complex networks which describe a wide range of systems in nature and society. Examples of such networks appear in communications, biology, social science, economics, and so forth [1]. In pursuit of such understanding, mathematicians and physicists usually use random graphs to model all these real-life networks. In the investigation of various complex networks, the degree distribution is always the main concern because it characterizes the fundamental topological properties of complex networks which show importance in network control, estimation, and sensor [28]. Several models were introduced to explain the properties. Bollobás [9] proposed a model with vertices and edges. In this model, the degree distribution is approximately Poisson distribution. Later, Barabási and Albert [10] proposed the following model: at each time step, add a new vertex and a fixed number of edges originating at and directed towards vertices chosen at random with probability proportional to their degrees. Based on simulation and heuristic approximation, they predicted that the degree distribution behaves like for all . The result was confirmed by Barabási et al. [11, 12]. In order to generate power laws with arbitrary exponents, Dorogovtsev et al. [13] and Drine et al. [14] introduced the following natural generalization of the above model: the destination of the new edges added at each time step is chosen with probability proportional to the degree plus an initial attractiveness ; they gave a nonrigorous argument that the degree distribution behaves like for large .

In some real networks, experiments show that the distribution obeys neither power law nor exponential. To explain the phenomenon, we propose a model as follows: starting with a single vertex, at each time step, a new vertex is added and linked to one of the existing vertices, which is chosen according the following rule: at time , where is integer, we choose one of the existing vertices with probability proportional to the degree; that is, we have probability , where is the degree of the vertex chosen and is the total degree of vertices; at another time step, we choose one of the existing vertices with equal probability. Related models were also proposed by Krapivsky and Redner [15] and Li [16] to describe the organization of growing networks. In this paper, we will focus on the distribution of evolving network and the distribution of the number of vertices with given degree will be considered in Section 2. In Section 3, we will consider the asymptotic degree distribution.

2. The Number of Vertices with Given Degrees

Let denote the number of vertices with degree at time . We will consider the case in this section and the case will be considered in the next section. As , we obtain the following result.

Lemma 1. In the evolving network, the expectation of the number of degree 1 satisfies

Proof. Herein after, denotes asymptotic equivalence as . From the way the network is formed, we can see that, for , the number of vertices of degree 1 does not change if we attach a new vertex to a vertex with degree 1 and increases by 1 if we attach to vertices of degree larger than 1 after joining the vertex . Assuming is multiple of , that is, , where is integer number, and taking expectation of , we obtain The first equation shows that when we add a new vertex and link it to one of existing vertices with preferential attachment, the number of vertex increases by 1, while the second equation comes from the uniform attachment. Continuing the iteration and noticing the boundary condition , we have Considering the term we have We obtain that when is not a multiple of , assuming , where is an integer number; we also obtain When is large enough, we can see that As a result, we have

Now we discuss the number of degree 2 in the network; we have the following.

Lemma 2. For ,

Proof. We prove the case that is a multiple of and assume , where is an integer number; considering the expectation of , we have Noticing the boundary condition and Lemma 1, we have By the estimation and the fact that we obtain that The case , which is not a multiple of , is the same as Lemma 1, just a little tedious.

3. Asymptotic Degree Distribution of Network

Let denote the proportion of vertices with degree at time . Considering the expectation of , we have the following theorem.

Theorem 3. For arbitrary and , the expectation of the number of degree satisfies

Proof. The case is just the result of Lemmas 1 and 2. Assume the result is true for ; that is, We will prove the result is true for . We just prove the case is a multiple of ; that is, , where is integer number. From the network constructed, we have Continuing the iteration and noticing the boundary condition , we obtain that Noticing the fact that We obtain The result is true for .

From Theorem 3, we can see that exists; we denote it by . Now we consider the relation of and ; we introduce the following lemma.

Lemma 4. There exists a bound constant such that for arbitrary ,

Proof. Let denote the -algbra. For , we define By the tower property of conditional expectation and the fact that the -algbra can be deduced from , we obtain that, for , Noticing the fact that we have as a martingale sequence. According to the definition of the -algbra, we know the has no information of the network and has the whole information, so we have Therefore, we have

Now we prove that there exists a bound constant , such that . We will prove the result by induction. For the case , we have

Continuing the iteration and noticing the fact that , for , we obtain that Obviously, so we have Assume the result is true for ; that is, there exists a bound constant , such that For , by the definition of , we have Continuing the iteration and using the assumption for , we obtain that Noticing the fact that and we obtain that We just let and the result for is proved. By Asume-Hoeffding’s inequality, we have the following for arbitrary :

Theorem 5. For a fixed , one has

Proof. By the Borel-Cantelli Lemma, we need to prove the following for arbitrary : We have Noticing that and using Lemma 4, we obtain that there exists , such that

Remark 6. As a result, we can see that the distribution obeys the following rule.

When , , the degree distribution obeys power law; when , , the degree distribution obeys exponential distribution; otherwise, .

Conflict of Interests

The authors declare that there is no conflict of interests.

Acknowledgments

Zhimin Li was partially supported by National Natural Science Foundation of China (71171003 and 71271003), Anhui Natural Science Foundation (nos. 10040606Q03 and 1208085QA04), and Key University Science Research Project of Anhui Province (KJ2013A044).

References

  1. F. Chung and L. Y. Lu, Complex Graphs and Networks, American Mathematical Society, 2006.
  2. X. Zhang and L. Yang, “A fiber Bragg grating quasi-distributed sensing network with a wavelength-tunable chaotic fiber laser,” Systems Science and Control Engineering, vol. 2, no. 1, pp. 268–274, 2014. View at Publisher · View at Google Scholar
  3. H. Ahmada and T. Namerikawa, “Extended Kalman filter-based mobile robot localization with intermittent measurements,” Systems Science and Control Engineering, vol. 1, no. 1, pp. 113–126, 2013.
  4. D. Ding, Z. Wang, H. Dong, and H. Shu, “Distributed H state estimation with stochastic parameters and nonlinearities through sensor networks: the finite-horizon case,” Automatica, vol. 48, no. 8, pp. 1575–1585, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. D. Ding, Z. Wang, J. Hu, and H. Shu, “Dissipative control for state-saturated discrete time-varying systems with randomly occurring nonlinearities and missing measurements,” International Journal of Control, vol. 86, no. 4, pp. 674–688, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. Z. Wang, H. Dong, B. Shen, and H. Gao, “Finite-horizon H filtering with missing measurements and quantization effects,” IEEE Transactions on Automatic Control, vol. 58, no. 7, pp. 1707–1718, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. H. Ahmada and T. Namerikawa, “Extended Kalman filter-based mobile robot localization with intermittent measurements,” Systems Science & Control Engineering, vol. 1, no. 1, pp. 113–126, 2013.
  8. G. Kumar and K. Kumar, “Network security—an updated perspective,” Systems Science & Control Engineering, vol. 2, no. 1, pp. 325–334, 2014. View at Publisher · View at Google Scholar
  9. B. Bollobás, Random Graphs, Combrige University Press, Cambrige, UK, 2001.
  10. A. L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. A. L. Barabási, R. Albert, and H. Jeong, “Mean-field theory for scale-free random networks,” Physica A: Statistical Mechanics and its Applications, vol. 272, no. 1, pp. 173–187, 1999. View at Publisher · View at Google Scholar · View at Scopus
  12. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády, “The degree sequence of a scale-free random graph process,” Random Structures & Algorithms, vol. 18, no. 3, pp. 279–290, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  13. 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. View at Publisher · View at Google Scholar · View at Scopus
  14. E. Drine, M. Enachescu, and M. Mitzenmacher, “Variations on random graph models for the web,” Tech. Rep., Havard University, Deparment of Computer Science, 2001.
  15. P. L. Krapivsky and S. Redner, “Organization of growing random networks,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 63, no. 6, Article ID 066123, 2001. View at Scopus
  16. Z. Li, “Branching structure and maximum degree of an evolving random tree,” Theoretical and Mathematical Physics, vol. 166, no. 2, pp. 270–277, 2011. View at Publisher · View at Google Scholar · View at Scopus