Simplex triangulation induced scale-free networks
| dc.creator | Gu, Zhi-Ming | |
| dc.creator | Zhou, Tao | |
| dc.creator | Wang, Bing-Hong | |
| dc.creator | Yan, Gang | |
| dc.creator | Zhu, Chen-Ping | |
| dc.creator | Fu, Zhong-Qian | |
| dc.date | 2005-05-07 | |
| dc.date.accessioned | 2026-07-07T06:29:47Z | |
| dc.date.available | 2026-07-07T06:29:47Z | |
| dc.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. | |
| dc.description | 6 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0505175 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0505175 | |
| dc.identifier | Dynamics of Continuous, Discrete and Impulsive Systems B 13, 505-510 (2006) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/98161 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | Simplex triangulation induced scale-free networks | |
| dc.type | text |