Apollonian networks

Simple item page
dc.creatorAndrade Jr., Jose S.
dc.creatorHerrmann, Hans J.
dc.creatorAndrade, Roberto F. S.
dc.creatorda Silva, Luciano R.
dc.date2004-06-12
dc.date.accessioned2026-07-07T02:58:36Z
dc.date.available2026-07-07T02:58:36Z
dc.descriptionWe introduce a new family of networks, the Apollonian networks, that are simultaneously scale-free, small world, Euclidean, space-filling and matching graphs. These networks have a wide range of applications ranging from the description of force chains in polydisperse granular packings and geometry of fully fragmented porous media, to hierarchical road systems and area-covering electrical supply networks. Some of the properties of these networks, namely, the connectivity exponent, the clustering coefficient, and the shortest path are calculated and found to be particularly rich. The percolation, the electrical conduction and the Ising models on such networks are also studied and found to be quite peculiar. Consequences for applications are also discussed.
dc.description5 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0406295
dc.identifierhttp://arxiv.org/abs/cond-mat/0406295
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/24164
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleApollonian networks
dc.typetext

Files

Collections

arXiv