A sufficient condition for classified networks to possess complex network features | Zendy

Xianmin Geng | Zendy; Shengli Zhou | Zendy; Jiashan Tang | Zendy; Yang Cong | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A sufficient condition for classified networks to possess complex network features

Author(s) -

Xianmin Geng,

Shengli Zhou,

Jiashan Tang,

Yang Cong

Publication year - 2012

Publication title -

networks and heterogeneous media

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.732

H-Index - 34

eISSN - 1556-181X

pISSN - 1556-1801

DOI - 10.3934/nhm.2012.7.59

Subject(s) - clustering coefficient , limiting , uniqueness , cluster analysis , degree distribution , complex network , limit (mathematics) , graph , property (philosophy) , mathematics , scale free network , degree (music) , statistical physics , computer science , topology (electrical circuits) , discrete mathematics , combinatorics , mathematical analysis , physics , statistics , mechanical engineering , philosophy , epistemology , acoustics , engineering

We investigate network features for complex networks. A sucient 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 coecient of the graph-valued Markov process are obtained as well. © American Institute of Mathematical Sciences.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research