Dereich, S., Moench, C. and Morters, P., 2012. Typical distances in ultrasmall random networks. Advances in Applied Probability, 44 (2), pp. 583-601.
We show that in preferential attachment models with power-law 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 power-law exponent. The extra factor reveals the different structure of typical shortest paths in preferential attachment graphs.
|Item Type ||Articles|
|Creators||Dereich, S., Moench, C. and Morters, P.|
|Departments||Faculty of Science > Mathematical Sciences|
Actions (login required)