The diameter of random massive graphs

  • Authors:
  • Linyuan Lu

  • Affiliations:
  • University of California, San Diego

  • Venue:
  • SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the “power law”. Here we determine the diameter of random power law graphs up to a constant factor for almost all ranges of parameters. These results show a strong evidence that the diameters of most massive graphs are about logarithm of their sizes up to a constant factor.