Fetching the paper…
Reading the bibliography…
In Chung-Lu random graphs, a classic model for real-world networks, each vertex is equipped with a weight drawn from a power-law distribution, and two vertices form an edge independently with probability proportional to the product of their weights.
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.
Extensions to McDiarmid’s inequality when differences are bounded with high probabiltiy
S. Kutin · 2002
Earlier work this paper cites.
Random geometric graphs
M. Penrose · 2003
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.
The phase transition in inhomogeneous random graphs
B. Bollobás, S. Janson, and O. Riordan · 2007
Earlier work this paper cites.
A spatial web graph model with local influence regions
W. Aiello, A. Bonato, C. Cooper, J. Janssen, and P. Prałat · 2008
Earlier work this paper cites.
The structure of geographical threshold graphs
M. Bradonjić, A. Hagberg, and A. G. Percus · 2008
Earlier work this paper cites.
Self-similarity of complex networks and hidden metric spaces
M. Á. Serrano, D. Krioukov, and M. Boguñá · 2008
Earlier work this paper cites.
Concentration of measure for the analysis of randomized algorithms
P. D. Dubhashi and A. Panconesi · 2009
Cited alongside, same era.
Sustaining the Internet with hyperbolic mapping
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.
Epidemics and Rumours in Complex Networks
M. Draief and L. Massouli · 2010
Cited alongside, same era.
Hyperbolic geometry of complex networks
D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguñá · 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.
On a geometrisation of the Chung-Lu model for complex networks
M. Bode, N. Fountoulakis, and T. Müller · 2015
Later among the works it cites.
An extension of mcdiarmid’s inequality
R. Combes · 2015
Later among the works it cites.
Cliques in hyperbolic random graphs
T. Friedrich and A. Krohmer · 2015
Later among the works it cites.
On the diameter of hyperbolic random graphs
T. Friedrich and A. Krohmer · 2015
Later among the works it cites.
Bootstrap percolation on geometric inhomogeneous random graphs
C. Koch and J. Lengler · 2016
Closest in time.
On the method of typical bounded differences
L. Warnke · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Typical distances in ultrasmall random networks
S. Dereich, C. Mönch, and P. Mörters · 2012
Cited alongside, same era.
Random hyperbolic graphs: degree sequence and clustering
L. Gugelmann, K. Panagiotou, and U. Peter · 2012
Cited alongside, same era.
Scale-free percolation
M. Deijfen, R. van der Hofstad, and G. Hooghiemstra · 2013
Cited alongside, same era.
A spatial preferential attachment model with local clustering
E. Jacob and P. Mörters · 2013
Cited alongside, same era.
Closest in time.
Typical distances in a geometric model for complex networks
M. A. Abdullah, M. Bode, and T. Müller · 2017
Closest in time.
Sampling Geometric Inhomogeneous Random Graphs in Linear Time
K. Bringmann, R. Keusch, and J. Lengler · 2017
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.
The diameter of kpkvb random graphs
T. Müller and M. Staps · 2017
Closest in time.