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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barabasi, A.-L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications (1999)
Lakhina, A., Byers, J.W., Crovella, M., Xie, P.: Sampling biases in ip topology measurements. In: INFOCOM 2003 (2003)
Bollobas, B.: Random Graphs. Cambridge University Press, Cambridge (2001)
CAIDA. skitter project
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)
Viger, F., Barrat, A., Dallasta, C.L., Kolaczyk, E.D.: What is the real size of a sampled network? the case of the internet. Physical Review E 75, 056111 (2007)
Viger, F., Latapy, M.: Random generation of large connected simple graphs with prescribed degree distribution. In: COCOON 2005 (2005)
Dallasta, L., A-hamelin, I., Barrat, A., Vazquez, A., Vespignani, A.: Exploring networks with traceroute-like probes: theory and simulations. In: TCS (2004)
Latapy, M., Magnien, C., Ouedraogo, F.: A radar for the internet. In: Proceedings of ADN 2008 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, X., Latapy, M., Soria, M. (2011). Deciding on the Type of a Graph from a BFS. In: da F. Costa, L., Evsukoff, A., Mangioni, G., Menezes, R. (eds) Complex Networks. Communications in Computer and Information Science, vol 116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25501-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-25501-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25500-7
Online ISBN: 978-3-642-25501-4
eBook Packages: Computer ScienceComputer Science (R0)