Indexing metadata

Distances in Random Graphs with Finite Mean and Infinite Variance Degrees


 
Dublin Core PKP Metadata Items Metadata for this Document
 
1. Title Title of document Distances in Random Graphs with Finite Mean and Infinite Variance Degrees
 
2. Creator Author's name, affiliation, country Remco W. van der Hofstad; Eindhoven University of Technology
 
2. Creator Author's name, affiliation, country Gerard Hooghiemstra; Delft University of Technology
 
2. Creator Author's name, affiliation, country Dmitri Znamenski; EURANDOM
 
3. Subject Discipline(s)
 
3. Subject Keyword(s) Branching processes, configuration model, coupling, graph distance.
 
3. Subject Subject classification Primary 05C80; secondary 05C12, 60J80.
 
4. Description Abstract

In this paper we study typical distances in random graphs with i.i.d. degrees of which the tail of the common distribution function is regularly varying with exponent $1-\tau$. Depending on the value of the parameter $\tau$ we can distinct three cases: (i) $\tau>3$, where the degrees have finite variance, (ii) $\tau\in (2,3)$, where the degrees have infinite variance, but finite mean, and (iii) $\tau\in (1,2)$, where the degrees have infinite mean. The distances between two randomly chosen nodes belonging to the same connected component, for $\tau>3$ and $\tau \in (1,2),$ have been studied in previous publications, and we survey these results here. When $\tau\in (2,3)$, the graph distance centers around $2\log\log{N}/|\log(\tau-2)|$. We present a full proof of this result, and study the fluctuations around this asymptotic means, by describing the asymptotic distribution. The results presented here improve upon results of Reittu and Norros, who prove an upper bound only.

The random graphs studied here can serve as models for complex networks where degree power laws are observed; this is illustrated by comparing the typical distance in this model to Internet data, where a degree power law with exponent $\tau\approx 2.2$ is observed for the so-called Autonomous Systems (AS) graph
 
5. Publisher Organizing agency, location
 
6. Contributor Sponsor(s) Netherlands Organization for Scientific Research (NWO).
 
7. Date (YYYY-MM-DD) 2007-05-28
 
8. Type Status & genre Peer-reviewed Article
 
8. Type Type
 
9. Format File format PDF
 
10. Identifier Uniform Resource Identifier http://ejp.ejpecp.org/article/view/420
 
10. Identifier Digital Object Identifier 10.1214/EJP.v12-420
 
11. Source Journal/conference title; vol., no. (year) Electronic Journal of Probability; Vol 12
 
12. Language English=en
 
14. Coverage Geo-spatial location, chronological period, research sample (gender, age, etc.)
 
15. Rights Copyright and permissions The Electronic Journal of Probability applies the Creative Commons Attribution License (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.

Summary of the Creative Commons Attribution License

You are free
  • to copy, distribute, display, and perform the work
  • to make derivative works
  • to make commercial use of the work
under the following condition of Attribution: others must attribute the work if displayed on the web or stored in any electronic archive by making a link back to the website of EJP via its Digital Object Identifier (DOI), or if published in other media by acknowledging prior publication in this Journal with a precise citation including the DOI. For any further reuse or distribution, the same terms apply. Any of these conditions can be waived by permission of the Corresponding Author.