Simplex triangulation induced scale-free networks

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called simplex triangulation networks(STNs) as they can be considered as a kind of network representation of simplex triangulation. We obtain the analytic results of power-law exponent $γ=2+\frac{1}{d-1}$ for $d$-dimensional STNs, and clustering coefficient $C$. We prove that the increasing tendency of average distance of STNs is a little slower than the logarithm of the number of nodes in STNs. In addition, the STNs possess hierarchical structure as $C(k)\sim k^{-1}$ when $k\gg d$ that in accord with the observations of many real-life networks.
6 pages, no figures

Keywords

Statistical Mechanics, Disordered Systems and Neural Networks

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/98161

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/0505175
 http://arxiv.org/abs/cond-mat/0505175
 Dynamics of Continuous, Discrete and Impulsive Systems B 13, 505-510 (2006)

Collections

arXiv