Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs.

By José S. Andrade Jr., Hans Jürgen Herrmann, R. Andrade, L. R. da Silva. Physical Review Letters, 2004

328 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Critical phenomena in complex networks (2007, background): “4 Examples of deterministic small worlds: (a) of Barabási et al. (2001), (b) of Dorogovtsev and Mendes (2002) and Dorogovtsev et al. (2002a), (c) of Andrade et al. (2005) and Doye and Massen (2005), (d) of Jung et al. (2002).”
Edwards Statistical Mechanics for Jammed Granular Matter (2016, background): “The question of optimizing the density of packings made of particles of a particular shape is an outstanding scientific problem occupying scientists since the time of Apollonius of Perga (Andrade et al., 2005; Herrmann et al., 1990; Thomas, 1941) and Kepler (Kepler, 1611; Weaire and Aste, 2008), and”
Synchronization in complex networks (2008, background): “Additionally, the authors studied two types of deterministic SF networks: a pseudofractal SF network introduced by Dorogovtsev et al. (2002) and the Apollonian network introduced by Andrade et al. (2005).”