Fetching the paper…
Reading the bibliography…
In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent $\tau \in (2,3)$.
First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory
J. M. Hammersley and D. Welsh · 1965
Earlier work this paper cites.
The small world problem
S. Milgram · 1967
Earlier work this paper cites.
The asymptotic number of labeled graphs with given degree sequences
E. A. Bender and E. R. Canfield · 1978
Earlier work this paper cites.
The simple branching process: a note on convergence when the mean is infinite
P. L. Davies · 1978
Earlier work this paper cites.
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
B. Bollobás · 1980
Earlier work this paper cites.
How popular is your paper? an empirical study of the citation distribution
S. Redner · 1998
Earlier work this paper cites.
Collective dynamics of ‘small-world’ networks
D. J. Watts and S. H. Strogatz · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
A.-L. Barabási and R. Albert · 1999
Earlier work this paper cites.
On power-law relationships of the internet topology
M. Faloutsos, P. Faloutsos, and C. Faloutsos · 1999
Earlier work this paper cites.
Scale-free characteristics of random networks: the topology of the world-wide web
A.-L. Barabási, R. Albert, and H. Jeong · 2000
Earlier work this paper cites.
The diameter of sparse random graphs
F. Chung and L. Lu · 2001
Earlier work this paper cites.
The structure of scientific collaboration networks
M. E. J. Newman · 2001
Earlier work this paper cites.
Statistical mechanics of complex networks
R. Albert and A.-L. Barabási · 2002
Earlier work this paper cites.
Small world patterns in food webs
J. M. Montoya and R. V. Solé · 2002
Earlier work this paper cites.
On the power-law random graph model of massive data networks
H. Reittu and I. Norros · 2004
Cited alongside, same era.
Distances in random graphs with infinite mean degrees
H. v. d. Esker, R. v. d. Hofstad, G. Hooghiemstra, and D. Znamenski · 2005
Cited alongside, same era.
Distances in random graphs with finite variance degrees
R. v. d. Hofstad, G. Hooghiemstra, and P. Van Mieghem · 2005
Cited alongside, same era.
A resilient, low-frequency, small-world human brain functional network with highly connected association cortical hubs
S. Achard, R. Salvador, B. Whitcher, J. Suckling, and E. Bullmore · 2006
Cited alongside, same era.
Distances in random graphs with finite mean and infinite variance degrees
R. v. d. Hofstad, G. Hooghiemstra, and D. Znamenski · 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
First passage percolation on the Erdős-Rényi random graph
S. Bhamidi, R. v. d. Hofstad, and G. Hooghiemstra · 2011
Later among the works it cites.
On explosions in heavy-tailed branching random walks
O. Amini, L. Devroye, S. Griffiths, N. Olver, et al · 2013
Later among the works it cites.
Scale-free percolation
M. Deijfen, R. v. d. Hofstad, and G. Hooghiemstra · 2013
Later among the works it cites.
A spatial preferential attachment model with local clustering
E. Jacob and P. Mörters · 2013
Later among the works it cites.
Geometric inhomogeneous random graphs
K. Bringmann, R. Keusch, and J. Lengler · 2015
Later among the works it cites.
First passage percolation on inhomogeneous random graphs
I. Kolossváry and J. Komjáthy · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Universality for the distance in finite variance random graphs
H. v. d. Esker, R. v. d. Hofstad, and G. Hooghiemstra · 2008
Cited alongside, same era.
Complex brain networks: graph theoretical analysis of structural and functional systems
E. Bullmore and O. Sporns · 2009
Cited alongside, same era.
On percolation in random graphs with given vertex degrees
S. Janson · 2009
Cited alongside, same era.
A new approach to the giant component problem
S. Janson and M. J. Luczak · 2009
Cited alongside, same era.
Extreme value theory, poisson-dirichlet distributions, and first passage percolation on random networks
S. Bhamidi, R. v. d. Hofstad, and G. Hooghiemstra · 2010
Cited alongside, same era.
First passage percolation on random graphs with finite mean degrees
S. Bhamidi, R. v. d. Hofstad, and G. Hooghiemstra · 2010
Cited alongside, same era.
Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
E. Baroni, R. v. d. Hofstad, and J. Komjáthy · 2016
Later among the works it cites.
Random Graphs and Complex Networks, Vol. I
R. v. d. Hofstad · 2016
Later among the works it cites.
Random Graphs and Complex Networks, Vol. II
R. v. d. Hofstad · 2016
Later among the works it cites.
Explosive crump-mode-jagers branching processes
J. Komjáthy · 2016
Later among the works it cites.
Nonuniversality of weighted random graphs with infinite variance degree
E. Baroni, R. v. d. Hofstad, and J. Komjáthy · 2017
Closest in time.
Universality for first passage percolation on sparse random graphs
S. Bhamidi, R. v. d. Hofstad, and G. Hooghiemstra · 2017
Closest in time.
When is a scale-free graph ultra-small?
R. v. d. Hofstad and J. Komjáthy · 2017
Closest in time.