Scale Free Interval Graphs

  • Naoto Miyoshi
  • Takeya Shigezumi
  • Ryuhei Uehara
  • Osamu Watanabe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5034)


Scale free graphs have attracted attention by their non-uniform structure that can be used as a model for various social and physical networks. In this paper, we propose a natural and simple random model for generating scale free interval graphs. The model generates a set of intervals randomly, which defines a random interval graph. The main advantage of the model is its simpleness. The structure/properties of the generated graphs are analyzable by relatively simple probabilistic and/or combinatorial arguments, which is different from the most of the other models for which we need to approximate the processes by certain differential equations. We indeed show that the distribution of degrees follows power law, and it achieves large cluster coefficient.


scale free graph small world network interval graphs 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barabási, A.: Linked: The New Science of Networks. Perseus Books Group (2002)Google Scholar
  2. 2.
    Barabási, A., Albert, R.: Emergence of Scaling in Random Networks. Science 286(5439), 509–512 (1999)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Cox, D.R., Isham, V.: Point Processes. Chapman & Hall, Boca Raton (1980)zbMATHGoogle Scholar
  4. 4.
    Newman, M.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)CrossRefMathSciNetzbMATHGoogle Scholar
  5. 5.
    Miyoshi, N., Shigezumi, T., Uehara, R., Watanabe, O.: Scale Free Interval Graphs. Dept. of Math. and Comp. Sciences Tokyo Institute of Technology Research Reports (Series C), series C-255 (2008),
  6. 6.
    Takács, L.: Introduction to the Theory of Queues. Oxford University Press, Oxford (1962)Google Scholar
  7. 7.
    Watts, D.J.: Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press, Princeton (2004)zbMATHGoogle Scholar
  8. 8.
    Watts, D.J., Strogatz, D.H.: Collective Dynamics of ’Small-World’ Networks. Nature 393, 440–442 (1998)CrossRefGoogle Scholar
  9. 9.
    Wolff, R.W.: Poisson Arrivals See Time Averages. Operations Research 30, 223–231 (1982)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Naoto Miyoshi
    • 1
  • Takeya Shigezumi
    • 1
  • Ryuhei Uehara
    • 2
  • Osamu Watanabe
    • 1
  1. 1.Tokyo Institute of TechnologyTokyoJapan
  2. 2.JAISTIshikawaJapan

Personalised recommendations