About the talk:
Despite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These power-laws hold for several snapshots of the Internet, between November 1997 and Aug 1999, despite a 50% growth of its size during that period. We show that our power-laws fit the real data very well resulting in correlation coefficients of 96% or higher. Our observations provide a novel perspective of the structure of the Internet. The power-laws describe concisely skewed distributions of graph properties such as the node outdegree.
An open question is why such regularities exist in something as ad-hoc and "random" as the Internet. We attempt to provide an intuitive exaplantion.
Joint work with Petros Faloutsos, Christos Faloutsos and George Siganos.
About the speaker:
Michalis Faloutsos is an assistant professor in the Department of Computer Science at the University of California, Riverside. He received his PhD and Master's from the University of Toronto and his 5-year BA from the National Technical University of Athens (NTUA).