Skip to main content
Article thumbnail
Location of Repository

Typical distances in ultrasmall random networks

By Steffen Dereich, Christian Mönch and Peter Mörters

Abstract

We show that in preferential attachment models with power-law exponent $\tau\in(2,3)$ the distance between randomly chosen vertices in the giant component is asymptotically equal to $(4+o(1))\, \frac{\log\log N}{-\log (\tau-2)}$, where $N$ denotes the number of nodes. This is twice the value obtained for several types of configuration models with the same power-law exponent. The extra factor reveals the different structure of typical shortest paths in preferential attachment graphs.Comment: 16 page

Topics: Mathematics - Probability, Mathematics - Combinatorics, Primary 05C80, Secondary 60C05, 90B15
Year: 2011
OAI identifier: oai:arXiv.org:1102.5680
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1102.5680 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.