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

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 topol...

Full description

Saved in:
Bibliographic Details
Published in:Abstract and Applied Analysis 2013-01, Vol.2013 (2013), p.780-784-1079
Main Authors: Hu, Guona, Xiao, Yuzhi, Jia, Huanshen, Zhao, Haixing
Format: Article
Language:English
Subjects:
Algorithms
Clustering (Computers)
Computer science
Entropy (Information theory)
Fractals
Mathematical research
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1085-3375
1687-0409
DOI:10.1155/2013/795682