Recursive graphs with small-world scale-free properties

Simple item page
dc.creatorComellas, Francesc
dc.creatorFertin, Guillaume
dc.creatorRaspaud, André
dc.date2004-02-02
dc.date2004-04-14
dc.date.accessioned2026-07-25T23:00:58Z
dc.descriptionWe discuss a category of graphs, recursive clique trees, which have small-world and scale-free properties and allow a fine tuning of the clustering and the power-law exponent of their discrete degree distribution. We determine relevant characteristics of those graphs: the diameter, degree distribution, and clustering parameter. The graphs have also an interesting recursive property, and generalize recent constructions with fixed degree distributions.
dc.description4 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0402033
dc.identifierhttp://arxiv.org/abs/cond-mat/0402033
dc.identifierPhys. Rev. E 69, 037104 (2004)
dc.identifierdoi:10.1103/PhysRevE.69.037104
dc.identifier.urihttps://dspace.dare.co.zw/handle/123456789/94676
dc.subjectStatistical Mechanics
dc.titleRecursive graphs with small-world scale-free properties
dc.typetext

Files

Collections

Artificial intelligence