Fetching the paper…
Reading the bibliography…
We study typical distances in a geometric random graph on the hyperbolic plane.
Intensitätsschwankungen im fernspreschverkehr
Palm, C. (1943) · 1943
Earlier work this paper cites.
The small world problem
Milgram, S. (1967) · 1967
Earlier work this paper cites.
On Palm probabilities
Jagers, P. (1973) · 1973
Earlier work this paper cites.
Poisson processes, volume 3 of Oxford Studies in Probability
Kingman, J. F. (1993) · 1993
Earlier work this paper cites.
Emergence of scaling in random networks
Barabási, A.-L. and Albert, R. (1999) · 1999
Earlier work this paper cites.
Random Graphs
Bollobás, B. (2001) · 2001
Earlier work this paper cites.
The degree sequence of a scale-free random graph process
Bollobás, B., Riordan, O., Spencer, J., and Tusnády, G. (2001) · 2001
Earlier work this paper cites.
Statistical mechanics of complex networks
Albert, R. and Barabási, A.-L. (2002) · 2002
Earlier work this paper cites.
General formalism for inhomogeneous random graphs
Söderberg, B. (2002) · 2002
Earlier work this paper cites.
Scale-free networks are ultrasmall
Cohen, R. and Havlin, S. (2003) · 2003
Cited alongside, same era.
Metric structure of random networks
Dorogovtsev, S. N., Mendes, J. F. F., and Samukhin, A. N. (2003) · 2003
Cited alongside, same era.
The diameter of a scale-free random graph
Bollobás, B. and Riordan, O. (2004) · 2004
Cited alongside, same era.
Complex Graphs and Networks (Cbms Regional Conference Series in Mathematics)
Chung, F. and Lu, L. (2006) · 2006
Cited alongside, same era.
On a conditionally poissonian graph process
Norros, I. and Reittu, H. (2006) · 2006
Cited alongside, same era.
The phase transition in inhomogeneous random graphs
Bollobás, B., Janson, S., and Riordan, O. (2007) · 2007
Cited alongside, same era.
Hyperbolic geometry of complex networks
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., and Boguná, M. (2010) · 2010
Later among the works it cites.
http://www.bbc.co.uk/news/technology-15844230
BBC (2011) · 2011
Later among the works it cites.
Typical distances in ultrasmall random networks
Dereich, S., Mönch, C., and Mörters, P. (2012) · 2012
Later among the works it cites.
Random hyperbolic graphs: degree sequence and clustering
Gugelmann, L., Panagiotou, K., and Peter, U. (2012) · 2012
Later among the works it cites.
On the largest component of a hyperbolic model of complex networks
Bode, M., Fountoulakis, N., and Müller, T. (2015) · 2015
Closest in time.
On a geometrization of the Chung–Lu model for complex networks
Fountoulakis, N. (2015) · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hofstad, R. v. d. and Hooghiemstra, G. (2008) · 2008
Cited alongside, same era.
Diameters in preferential attachment models
Dommers, S., Hofstad, R. v. d., and Hooghiemstra, G. (2010) · 2010
Cited alongside, same era.
Lectures on complex networks
Dorogovtsev, S. N. (2010) · 2010
Cited alongside, same era.
The average distances in random graphs with given expected degrees
Chung, F. and Lu, L. (2002a)
Cited in the paper.
Connected components in random graphs with given expected degree sequences
Chung, F. and Lu, L. (2002b)
Cited in the paper.
On the diameter of hyperbolic random graphs
Friedrich, T. and Krohmer, A. (2015) · 2015
Closest in time.
A bound for the diameter of random hyperbolic graphs
Kiwi, M. and Mitsche, D. (2015) · 2015
Closest in time.
Random graphs and complex networks
Hofstad, R. v. d. (2017) · 2017
Closest in time.