March  2012, 7(1): 59-69. doi: 10.3934/nhm.2012.7.59

A sufficient condition for classified networks to possess complex network features

1. 

College of Science, Nanjing University of Aeronautics & Astronautics, Nanjing, 210016, China, China, China

2. 

College of Science, Nanjing University of Posts and Telecommunications, Nanjing, 210046, China

Received  March 2011 Revised  December 2011 Published  February 2012

We investigate network features for complex networks. A sufficient condition for the limiting random variable to possess the scale free property and the high clustering property is given. The uniqueness and existence of the limit of a sequence of degree distributions for the process is proved. The limiting degree distribution and a lower bound of the limiting clustering coefficient of the graph-valued Markov process are obtained as well.
Citation: Xianmin Geng, Shengli Zhou, Jiashan Tang, Cong Yang. A sufficient condition for classified networks to possess complex network features. Networks & Heterogeneous Media, 2012, 7 (1) : 59-69. doi: 10.3934/nhm.2012.7.59
References:
[1]

R. Albert and A.-L. Barabási, Emergence of scaling in random networks,, Science, 286 (1999), 509.  doi: 10.1126/science.286.5439.509.  Google Scholar

[2]

R. Albert and A.-L. Barabási, Statistical mechanics of complex networks,, Reviews of Mordern Physics, 74 (2002), 47.  doi: 10.1103/RevModPhys.74.47.  Google Scholar

[3]

D. J. Aldous, A tractable complex network model based on the stochastic mean-field model of distance,, in, 650 (2004), 51.   Google Scholar

[4]

D. J. Aldous and W. S. Kendall, Short-length routes in low-cost networks via Poisson line patterns,, Advances in Applied Probability, 40 (2008), 1.  doi: 10.1239/aap/1208358883.  Google Scholar

[5]

H. G. Bartel, H. J. Mucha and J. Dolata, On a modified graph-theoretic partitioning method of cluster analysis,, Match-Communications in Mathematical and in Computer Chemistry, 48 (2003), 209.   Google Scholar

[6]

B. Bollobás, S. Janson and O. Riordan, The phase transition in inhomogeneous random graphs,, Random Structures and Algorithms, 31 (2007), 3.  doi: 10.1002/rsa.20168.  Google Scholar

[7]

A. Diaz-Guilera, Complex networks: Statics and dynamics,, Advanced Summer School in Physics 2006, 885 (2007), 107.   Google Scholar

[8]

Z. P. Fan, G. R. Chen and Y. N. Zhang, A comprehensive multi-local-world model for complex networks,, Physics Letters A, 373 (2009), 1601.  doi: 10.1016/j.physleta.2009.02.072.  Google Scholar

[9]

A. Ganesh and F. Xue, On the connectivity and diameter of small-world networks,, Advances in Applied Probability, 39 (2007), 853.  doi: 10.1239/aap/1198177228.  Google Scholar

[10]

P. Holme and B. J. Kim, Growing scale-free networks with tunable clustering,, Physical Review E, 65 (2002).   Google Scholar

[11]

G. Lee and G. I. Kim, Degree and wealth distribution in a network,, Physica A-Statistical Mechanics and its Applications, 383 (2007), 677.   Google Scholar

[12]

N. Miyoshi, T. Shigezumi, R. Uehara and O. Watanabe, Scale free interval graphs,, Theoretical Computer Science, 410 (2009), 4588.  doi: 10.1016/j.tcs.2009.08.012.  Google Scholar

[13]

Y. Ou and C.-Q. Zhang, A new multimembership clustering method,, Journal of Industrial and Management Optimization, 3 (2007), 619.  doi: 10.3934/jimo.2007.3.619.  Google Scholar

[14]

M. M. Sørensen, b-tree facets for the simple graph partitioning polytope,, Journal of Combinatorial Optimization, 8 (2004), 151.  doi: 10.1023/B:JOCO.0000031417.96218.26.  Google Scholar

[15]

J. Szymański, Concentration of vertex degrees in a scale-free random graph process,, Random Structures and Algorithms, 26 (2005), 224.  doi: 10.1002/rsa.20065.  Google Scholar

[16]

D. J. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks,, Nature, 393 (1998), 440.  doi: 10.1038/30918.  Google Scholar

show all references

References:
[1]

R. Albert and A.-L. Barabási, Emergence of scaling in random networks,, Science, 286 (1999), 509.  doi: 10.1126/science.286.5439.509.  Google Scholar

[2]

R. Albert and A.-L. Barabási, Statistical mechanics of complex networks,, Reviews of Mordern Physics, 74 (2002), 47.  doi: 10.1103/RevModPhys.74.47.  Google Scholar

[3]

D. J. Aldous, A tractable complex network model based on the stochastic mean-field model of distance,, in, 650 (2004), 51.   Google Scholar

[4]

D. J. Aldous and W. S. Kendall, Short-length routes in low-cost networks via Poisson line patterns,, Advances in Applied Probability, 40 (2008), 1.  doi: 10.1239/aap/1208358883.  Google Scholar

[5]

H. G. Bartel, H. J. Mucha and J. Dolata, On a modified graph-theoretic partitioning method of cluster analysis,, Match-Communications in Mathematical and in Computer Chemistry, 48 (2003), 209.   Google Scholar

[6]

B. Bollobás, S. Janson and O. Riordan, The phase transition in inhomogeneous random graphs,, Random Structures and Algorithms, 31 (2007), 3.  doi: 10.1002/rsa.20168.  Google Scholar

[7]

A. Diaz-Guilera, Complex networks: Statics and dynamics,, Advanced Summer School in Physics 2006, 885 (2007), 107.   Google Scholar

[8]

Z. P. Fan, G. R. Chen and Y. N. Zhang, A comprehensive multi-local-world model for complex networks,, Physics Letters A, 373 (2009), 1601.  doi: 10.1016/j.physleta.2009.02.072.  Google Scholar

[9]

A. Ganesh and F. Xue, On the connectivity and diameter of small-world networks,, Advances in Applied Probability, 39 (2007), 853.  doi: 10.1239/aap/1198177228.  Google Scholar

[10]

P. Holme and B. J. Kim, Growing scale-free networks with tunable clustering,, Physical Review E, 65 (2002).   Google Scholar

[11]

G. Lee and G. I. Kim, Degree and wealth distribution in a network,, Physica A-Statistical Mechanics and its Applications, 383 (2007), 677.   Google Scholar

[12]

N. Miyoshi, T. Shigezumi, R. Uehara and O. Watanabe, Scale free interval graphs,, Theoretical Computer Science, 410 (2009), 4588.  doi: 10.1016/j.tcs.2009.08.012.  Google Scholar

[13]

Y. Ou and C.-Q. Zhang, A new multimembership clustering method,, Journal of Industrial and Management Optimization, 3 (2007), 619.  doi: 10.3934/jimo.2007.3.619.  Google Scholar

[14]

M. M. Sørensen, b-tree facets for the simple graph partitioning polytope,, Journal of Combinatorial Optimization, 8 (2004), 151.  doi: 10.1023/B:JOCO.0000031417.96218.26.  Google Scholar

[15]

J. Szymański, Concentration of vertex degrees in a scale-free random graph process,, Random Structures and Algorithms, 26 (2005), 224.  doi: 10.1002/rsa.20065.  Google Scholar

[16]

D. J. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks,, Nature, 393 (1998), 440.  doi: 10.1038/30918.  Google Scholar

[1]

Deena Schmidt, Janet Best, Mark S. Blumberg. Random graph and stochastic process contributions to network dynamics. Conference Publications, 2011, 2011 (Special) : 1279-1288. doi: 10.3934/proc.2011.2011.1279

[2]

Francesco Sanna Passino, Nicholas A. Heard. Modelling dynamic network evolution as a Pitman-Yor process. Foundations of Data Science, 2019, 1 (3) : 293-306. doi: 10.3934/fods.2019013

[3]

Weiqing Xie. A free boundary problem arising from the process of Czochralski crystal growth. Conference Publications, 2001, 2001 (Special) : 380-385. doi: 10.3934/proc.2001.2001.380

[4]

Pikkala Vijaya Laxmi, Obsie Mussa Yesuf. Analysis of a finite buffer general input queue with Markovian service process and accessible and non-accessible batch service. Journal of Industrial & Management Optimization, 2010, 6 (4) : 929-944. doi: 10.3934/jimo.2010.6.929

[5]

Yan Wang, Lei Wang, Yanxiang Zhao, Aimin Song, Yanping Ma. A stochastic model for microbial fermentation process under Gaussian white noise environment. Numerical Algebra, Control & Optimization, 2015, 5 (4) : 381-392. doi: 10.3934/naco.2015.5.381

[6]

Hongjun Gao, Fei Liang. On the stochastic beam equation driven by a Non-Gaussian Lévy process. Discrete & Continuous Dynamical Systems - B, 2014, 19 (4) : 1027-1045. doi: 10.3934/dcdsb.2014.19.1027

[7]

Daoyi Xu, Yumei Huang, Zhiguo Yang. Existence theorems for periodic Markov process and stochastic functional differential equations. Discrete & Continuous Dynamical Systems - A, 2009, 24 (3) : 1005-1023. doi: 10.3934/dcds.2009.24.1005

[8]

Zhongming Chen, Liqun Qi. Circulant tensors with applications to spectral hypergraph theory and stochastic process. Journal of Industrial & Management Optimization, 2016, 12 (4) : 1227-1247. doi: 10.3934/jimo.2016.12.1227

[9]

Linlin Tian, Xiaoyi Zhang, Yizhou Bai. Optimal dividend of compound poisson process under a stochastic interest rate. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-17. doi: 10.3934/jimo.2019047

[10]

Yejuan Wang, Peter E. Kloeden. The uniform attractor of a multi-valued process generated by reaction-diffusion delay equations on an unbounded domain. Discrete & Continuous Dynamical Systems - A, 2014, 34 (10) : 4343-4370. doi: 10.3934/dcds.2014.34.4343

[11]

Ummugul Bulut, Edward J. Allen. Derivation of SDES for a macroevolutionary process. Discrete & Continuous Dynamical Systems - B, 2013, 18 (7) : 1777-1792. doi: 10.3934/dcdsb.2013.18.1777

[12]

Harish Garg. Some robust improved geometric aggregation operators under interval-valued intuitionistic fuzzy environment for multi-criteria decision-making process. Journal of Industrial & Management Optimization, 2018, 14 (1) : 283-308. doi: 10.3934/jimo.2017047

[13]

Shaokuan Chen, Shanjian Tang. Semi-linear backward stochastic integral partial differential equations driven by a Brownian motion and a Poisson point process. Mathematical Control & Related Fields, 2015, 5 (3) : 401-434. doi: 10.3934/mcrf.2015.5.401

[14]

Volker Rehbock, Iztok Livk. Optimal control of a batch crystallization process. Journal of Industrial & Management Optimization, 2007, 3 (3) : 585-596. doi: 10.3934/jimo.2007.3.585

[15]

Simone Göttlich, Stephan Knapp. Semi-Markovian capacities in production network models. Discrete & Continuous Dynamical Systems - B, 2017, 22 (9) : 3235-3258. doi: 10.3934/dcdsb.2017090

[16]

Liu Hui, Lin Zhi, Waqas Ahmad. Network(graph) data research in the coordinate system. Mathematical Foundations of Computing, 2018, 1 (1) : 1-10. doi: 10.3934/mfc.2018001

[17]

Françoise Pène. Asymptotic of the number of obstacles visited by the planar Lorentz process. Discrete & Continuous Dynamical Systems - A, 2009, 24 (2) : 567-587. doi: 10.3934/dcds.2009.24.567

[18]

Paulina Grzegorek, Michal Kupsa. Exponential return times in a zero-entropy process. Communications on Pure & Applied Analysis, 2012, 11 (3) : 1339-1361. doi: 10.3934/cpaa.2012.11.1339

[19]

Yong-Kum Cho. On the Boltzmann equation with the symmetric stable Lévy process. Kinetic & Related Models, 2015, 8 (1) : 53-77. doi: 10.3934/krm.2015.8.53

[20]

Michel Pierre, Grégory Vial. Best design for a fastest cells selecting process. Discrete & Continuous Dynamical Systems - S, 2011, 4 (1) : 223-237. doi: 10.3934/dcdss.2011.4.223

2018 Impact Factor: 0.871

Metrics

  • PDF downloads (6)
  • HTML views (0)
  • Cited by (0)

Other articles
by authors

[Back to Top]