General model for Apollonian networks

Simple item page
dc.creatorZhang, Zhongzhi
dc.creatorRong, Lili
dc.date2005-12-11
dc.date.accessioned2026-07-07T06:53:16Z
dc.date.available2026-07-07T06:53:16Z
dc.descriptionWe introduce a general deterministic model for Apollonian Networks in an iterative fashion. The networks have small-world effect and scale-free topology. We calculate the exact results for the degree exponent, the clustering coefficient and the diameter. The major points of our results indicate that (a) the degree exponent can be adjusted in a wide range, (b) the clustering coefficient of each individual vertex is inversely proportional to its degree and the average clustering coefficient of all vertices approaches to a nonzero value in the infinite network order, and (c) the diameter grows logarithmically with the number of network vertices.
dc.description5 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0512229
dc.identifierhttp://arxiv.org/abs/cond-mat/0512229
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/105524
dc.subjectStatistical Mechanics
dc.subjectOther Condensed Matter
dc.titleGeneral model for Apollonian networks
dc.typetext

Files

Collections

arXiv