Fetching the paper…
Reading the bibliography…
Real-world networks, like social networks or the internet infrastructure, have structural properties such as large clustering coefficients that can best be described in terms of an underlying geometry.
An approximation theorem for the poisson binomial distribution
L. Le Cam · 1960
Earlier work this paper cites.
Nonuniform random variate generation
L. Devroye · 1986
Earlier work this paper cites.
Space-efficient static trees and graphs
G. Jacobson · 1989
Earlier work this paper cites.
Measure theory and fine properties of functions
L. C. Evans and R. F. Gariepy · 1992
Earlier work this paper cites.
Efficient suffix trees on secondary storage
D. R. Clark and I. Munro · 1996
Earlier work this paper cites.
Emergence of scaling in random networks
A.-L. Barabási and R. Albert · 1999
Earlier work this paper cites.
The average distances in random graphs with given expected degrees
F. Chung and L. Lu · 2002
Earlier work this paper cites.
Connected components in random graphs with given expected degree sequences
F. Chung and L. Lu · 2002
Earlier work this paper cites.
Evolution of networks
S. N. Dorogovtsev and J. F. F. Mendes · 2002
Earlier work this paper cites.
Compact representations of separable graphs
D. K. Blandford, G. E. Blelloch, and I. A. Kash · 2003
Earlier work this paper cites.
Random geometric graphs
M. Penrose · 2003
Earlier work this paper cites.
The WebGraph framework I : compression techniques
P. Boldi and S. Vigna · 2004
Earlier work this paper cites.
The average distance in a random graph with given expected degrees
F. Chung and L. Lu · 2004
Earlier work this paper cites.
Efficient generation of large random networks
V. Batagelj and U. Brandes · 2005
Earlier work this paper cites.
On a conditionally Poissonian graph process
I. Norros and H. Reittu · 2006
Earlier work this paper cites.
The phase transition in inhomogeneous random graphs
B. Bollobás, S. Janson, and O. Riordan · 2007
Cited alongside, same era.
A spatial web graph model with local influence regions
W. Aiello, A. Bonato, C. Cooper, J. Janssen, and P. Prałat · 2008
Cited alongside, same era.
The structure of geographical threshold graphs
M. Bradonjić, A. Hagberg, and A. G. Percus · 2008
Cited alongside, same era.
Succincter
M. Pătraşcu · 2008
Cited alongside, same era.
On compressing social networks
F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan · 2009
Cited alongside, same era.
Models for the Compressible Web
F. Chierichetti, R. Kumar, S. Lattanzi, A. Panconesi, and P. Raghavan · 2009
Cited alongside, same era.
Sustaining the Internet with hyperbolic mapping
On the geometrisation of the Chung-Lu model and its component structure
M. Bode, N. Fountoulakis, and T. Müller · 2014
Later among the works it cites.
Clustering and the hyperbolic geometry of complex networks
E. Candellero and N. Fountoulakis · 2014
Later among the works it cites.
Random Graph Models for Complex Systems
U. Peter · 2014
Later among the works it cites.
Typical distances in a geometric model for complex networks
M. A. Abdullah, M. Bode, and N. Fountoulakis · 2015
Closest in time.
Inhomogeneous long-range percolation for real-life network modeling
P. Deprez, R. S. Hazra, and M. V. Wüthrich · 2015
Closest in time.
Cliques in hyperbolic random graphs
T. Friedrich and A. Krohmer · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Boguñá, F. Papadopoulos, and D. Krioukov · 2010
Cited alongside, same era.
A geometric model for on-line social networks
A. Bonato, J. Janssen, and P. Prałat · 2010
Cited alongside, same era.
Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces
F. Papadopoulos, D. Krioukov, M. Boguñá, and A. Vahdat · 2010
Cited alongside, same era.
Efficient generation of networks with given expected degrees
J. C. Miller and A. Hagberg · 2011
Cited alongside, same era.
Random hyperbolic graphs: degree sequence and clustering
L. Gugelmann, K. Panagiotou, and U. Peter · 2012
Cited alongside, same era.
On the giant component of random hyperbolic graphs
M. Bode, N. Fountoulakis, and T. Müller · 2013
Cited alongside, same era.
On the diameter of hyperbolic random graphs
T. Friedrich and A. Krohmer · 2015
Closest in time.
A bound for the diameter of random hyperbolic graphs
M. Kiwi and D. Mitsche · 2015
Closest in time.
Fast generation of dynamic complex networks with underlying hyperbolic geometry
M. Von Looz, C. L. Staudt, H. Meyerhenke, and R. Prutkin · 2015
Closest in time.
Hyperbolic random graphs: Separators and treewidth
T. Bläsius, T. Friedrich, and A. Krohmer · 2016
Closest in time.
Average distance in a general class of scale-free networks with underlying geometry
K. Bringmann, R. Keusch, and J. Lengler · 2016
Closest in time.
Structures in supercritical scale-free percolation
M. Heydenreich, T. Hulshof, and J. Jorritsma · 2016
Closest in time.
Bootstrap percolation on geometric inhomogeneous random graphs
C. Koch and J. Lengler · 2016
Closest in time.
Greedy routing and the algorithmic small-world phenomenon
K. Bringmann, R. Keusch, J. Lengler, Y. Maus, and A. Molla · 2017
Closest in time.