Deciding on the type of a graph from a BFS - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Deciding on the type of a graph from a BFS

Xiaomin Wang
  • Function : Author
  • PersonId : 978686
Matthieu Latapy
Michèle Soria

Abstract

The degree distribution of the Internet topology is considered as one of its main properties. However, it is only known through a measurement procedure which gives a biased estimate. This measurement may in first approximation be modeled by a BFS (Breadth-First Search) tree. We explore here our ability to infer the type (Poisson or power-law) of the degree distribution from such a limited knowledge. We design procedures which estimate the degree distribution of a graph from a BFS of it, and show experimentally (on models and real-world data) that this approach succeeds in making the difference between Poisson and power-law graphs.
No file

Dates and versions

hal-01288795 , version 1 (15-03-2016)

Identifiers

Cite

Xiaomin Wang, Matthieu Latapy, Michèle Soria. Deciding on the type of a graph from a BFS. Workshop on Complex Networks CompleNet 2010, Oct 2010, Rio de Janeiro, Brazil. pp.68-74, ⟨10.1007/978-3-642-25501-4_7⟩. ⟨hal-01288795⟩
38 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More