Deterministic scale-free networks created in a recursive manner

Simple item page
dc.creatorZhang, Zhongzhi
dc.creatorRong, Lili
dc.date2005-12-07
dc.date.accessioned2026-07-07T07:56:35Z
dc.date.available2026-07-07T07:56:35Z
dc.descriptionIn a recursive way and by including a parameter, we introduce a family of deterministic scale-free networks. The resulting networks exhibit small-world effects. We calculate the exact results for the degree exponent, the clustering coefficient and the diameter. The major points of our results indicate: the degree exponent can be adjusted; 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 the diameter grows logarithmically with the number of network vertices.
dc.description5 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0512143
dc.identifierhttp://arxiv.org/abs/cond-mat/0512143
dc.identifierCommunications, Circuits and Systems Proceedings, 2006 International Conference on Volume 4, June 2006 Page(s): 2683-2686
dc.identifierdoi:10.1109/ICCCAS.2006.285223
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/127360
dc.subjectStatistical Mechanics
dc.subjectOther Condensed Matter
dc.titleDeterministic scale-free networks created in a recursive manner
dc.typetext

Files

Collections

arXiv