Projects per year
Abstract
We show that in preferential attachment models with powerlaw exponent τ ∈ (2, 3) the distance between randomly chosen vertices in the giant component is asymptotically equal to (4 + o(1))log log N / (log(τ  2)), where N denotes the number of nodes. This is twice the value obtained for the configuration model with the same powerlaw exponent. The extra factor reveals the different structure of typical shortest paths in preferential attachment graphs.
Original language  English 

Pages (fromto)  583601 
Journal  Advances in Applied Probability 
Volume  44 
Issue number  2 
DOIs  
Publication status  Published  Jun 2012 
Fingerprint
Dive into the research topics of 'Typical distances in ultrasmall random networks'. Together they form a unique fingerprint.Projects
 1 Finished

INTERSECTION LOCAL TIMES AND STOCHASTIC PROCESSES IN RANDOM MEDIA
Morters, P.
Engineering and Physical Sciences Research Council
1/09/05 → 31/08/10
Project: Research council