We study three preferential attachment models where the parameters are such that the asymptotic degree distribution has infinite variance.
Reading the bibliography…
II. A mathematical theory of evolution, based on the conclusions of Dr. JC Willis, FRS
G. U. Yule · 1925
Earlier work this paper cites.
On a class of skew distribution functions
H. A. Simon · 1955
Earlier work this paper cites.
First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory
J. M. Hammersley and D. J. Welsh · 1965
Earlier work this paper cites.
The small world problem
J. Travers and 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.
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
B. Bollobás · 1980
Earlier work this paper cites.
Internet: Diameter of the world-wide web
R. Albert, H. Jeong, and A.-L. Barabási · 1999
Earlier work this paper cites.
Emergence of scaling in random networks
A.-L. Barabási and R. Albert · 1999
Earlier work this paper cites.
Random graphs
B. Bollobás · 2001
Earlier work this paper cites.
Statistical mechanics of complex networks
R. Albert and A.-L. Barabási · 2002
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.
The theory of branching processes
T. E. Harris · 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.
The structure and function of complex networks
M. E. Newman · 2003
Earlier work this paper cites.
Branching Processes
K. Athreya and P. Ney · 2004
Earlier work this paper cites.
The diameter of a scale-free random graph
B. Bollobás and O. Riordan · 2004
Earlier work this paper cites.
On the spread of viruses on the internet
N. Berger, C. Borgs, J. T. Chayes, and A. Saberi · 2005
Earlier work this paper cites.
Distances in random graphs with finite variance degrees
R. v. d. Hofstad, G. Hooghiemstra, and P. Van Mieghem · 2005
Earlier work this paper cites.
Probability and computing: Randomized algorithms and probabilistic analysis
M. Mitzenmacher and E. Upfal · 2005
Cited alongside, same era.
On a conditionally Poissonian graph process
I. Norros and H. Reittu · 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.
Random networks with sublinear preferential attachment: degree evolutions
S. Dereich and P. Mörters · 2009
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.
Diameters in preferential attachment models
S. Dommers, R. v. d. Hofstad, and G. Hooghiemstra · 2010
Cited alongside, same era.
First passage percolation on the Erdős-Rényi random graph
S. Bhamidi, R. v. d. Hofstad, and G. Hooghiemstra · 2011
Cited alongside, same era.
Random networks with concave preferential attachment rule
S. Dereich and P. Mörters · 2011
Cited alongside, same era.
Four degrees of separation
L. Backstrom, P. Boldi, M. Rosa, J. Ugander, and S. Vigna · 2012
Cited alongside, same era.
Typical distances in ultrasmall random networks
S. Dereich, C. Mönch, and P. Mörters · 2012
Cited alongside, same era.
On explosions in heavy-tailed branching random walks
O. Amini, L. Devroye, S. Griffiths, and N. Olver · 2013
Cited alongside, same era.
Random networks with sublinear preferential attachment: the giant component
S. Dereich and P. Mörters · 2013
Cited alongside, same era.
Random graphs and complex networks, Volume 1
R. v. d. Hofstad · 2016
Later among the works it cites.
50 years of first-passage percolation
A. Auffinger, M. Damron, and J. Hanson · 2017
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
Later among the works it cites.
Universality for first passage percolation on sparse random graphs
S. Bhamidi, R. v. d. Hofstad, and G. Hooghiemstra · 2017
Later among the works it cites.
Distances in scale free networks at criticality
S. Dereich, C. Mönch, and P. Mörters · 2017
Later among the works it cites.
Stochastic processes on random graphs, 2017
R. v. d. Hofstad · 2017
Later among the works it cites.
Explosion and distances in scale-free percolation
R. v. d. Hofstad and J. Komjáthy · 2017
Later among the works it cites.
Weighted Distances in Scale-Free Configuration Models
E. Adriaans and J. Komjáthy · 2018
Later among the works it cites.
Local neighbourhoods for first-passage percolation on the configuration model
S. Dereich and M. Ortgiese · 2018
Later among the works it cites.
Agglomeration in a preferential attachment random graph with edge-steps
C. Alves, R. Ribeiro, and R. Sanchis · 2019
Closest in time.
Preferential attachment random graphs with edge-step functions
C. Alves, R. Ribeiro, and R. Sanchis · 2019
Closest in time.
Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
E. Baroni, R. v. d. Hofstad, and J. Komjáthy · 2019
Closest in time.
Diameter in ultra-small scale-free random graphs
F. Caravenna, A. Garavaglia, and R. v. d. Hofstad · 2019
Closest in time.
Preferential attachment models for dynamic networks
A. Garavaglia · 2019
Closest in time.
The age-dependent random connection model
P. Gracar, A. Grauer, L. Lüchtrath, and P. Mörters · 2019
Closest in time.
Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
J. Komjáthy and B. Lodewijks · 2019
Closest in time.
Distances and large deviations in the spatial preferential attachment model
C. Hirsch and C. Mönch · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…