A New Class of the Planar Networks with High Clustering and High Entropy | Zendy

Guona Hu | Zendy; Yuzhi Xiao | Zendy; Huanshen Jia | Zendy; Haixing Zhao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A New Class of the Planar Networks with High Clustering and High Entropy

Author(s) -

Guona Hu,

Yuzhi Xiao,

Huanshen Jia,

Haixing Zhao

Publication year - 2013

Publication title -

abstract and applied analysis

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.228

H-Index - 56

eISSN - 1687-0409

pISSN - 1085-3375

DOI - 10.1155/2013/795682

Subject(s) - clustering coefficient , mathematics , cluster analysis , planar , degree distribution , entropy (arrow of time) , statistical physics , exponential function , topology (electrical circuits) , complex network , computer science , combinatorics , mathematical analysis , statistics , physics , computer graphics (images) , quantum mechanics

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. © 2013 Guona Hu et al.

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