Typical distances in ultrasmall random networks

Steffen Dereich, Christian Mönch, Peter Morters

Research output: Contribution to journalArticlepeer-review

18 Citations (SciVal)
151 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)583-601
JournalAdvances in Applied Probability
Issue number2
Publication statusPublished - Jun 2012


Dive into the research topics of 'Typical distances in ultrasmall random networks'. Together they form a unique fingerprint.

Cite this