Deciding on the Type of a Graph from a BFS
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.
KeywordsRandom Graph Degree Distribution Average Degree Preferential Attachment Reconstruction Strategy
Unable to display preview. Download preview PDF.
- 1.Barabasi, A.-L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications (1999)Google Scholar
- 2.Lakhina, A., Byers, J.W., Crovella, M., Xie, P.: Sampling biases in ip topology measurements. In: INFOCOM 2003 (2003)Google Scholar
- 4.CAIDA. skitter projectGoogle Scholar
- 5.Achliotas, D., Clauset, A., Kempe, D., Moore, C.: On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. Journal of the Association for Computing Machinery (2005)Google Scholar
- 7.Viger, F., Latapy, M.: Random generation of large connected simple graphs with prescribed degree distribution. In: COCOON 2005 (2005)Google Scholar
- 8.Dallasta, L., A-hamelin, I., Barrat, A., Vazquez, A., Vespignani, A.: Exploring networks with traceroute-like probes: theory and simulations. In: TCS (2004)Google Scholar
- 9.Latapy, M., Magnien, C., Ouedraogo, F.: A radar for the internet. In: Proceedings of ADN 2008 (2008)Google Scholar