Advertisement

A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques

  • Takeya Shigezumi
  • Yushi Uno
  • Osamu Watanabe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5942)

Abstract

Scale-free networks are usually defined as the ones that have power-law degree distributions. Since many of real world networks such as the World Wide Web, the Internet, citation networks, biological networks, and so on, have this property in common, scale-free networks have attracted interests of researchers so far. They also revealed that such networks have some typical properties such as high cluster coefficient and small diameter as well, and a lot of network models have been proposed to explain them. Recently, some new observations for a real world network are reported [12]. It tries to find a special kind of cliques from a network and introduces observations; 1. the size distributions of cliques show a power-law, 2. the degree distribution of the network after contracting those cliques show a power-law, and 3. by regarding the contracted network as the original, 1 and 2 are observed repeatedly. In this paper, we propose a new network model constructed by a ‘clique expansion’ procedure, to explain these new hierarchical structure of cliques.

Keywords

scale-free network isolated cliques webgraph web structure modelling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Review of Modern Physics 74, 47–97 (2002)CrossRefGoogle Scholar
  2. 2.
    Athreya, K.B., Ney, P.E.: Branching Processes. Springer, Heidelberg (1972)zbMATHGoogle Scholar
  3. 3.
    Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn. Wiley, Chichester (1968)zbMATHGoogle Scholar
  5. 5.
    Ito, H., Iwama, K., Osumi, T.: Linear-time enumeration of isolated cliques. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 119–130. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604–632 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Krishna Reddy, P., Kitsuregawa, M.: Building a community hierarchy for the web based on bipartite graphs. In: Proceedings of the 13th IEICE Data Engineering Workshop, pages C4–1 (2002)Google Scholar
  9. 9.
    Shigezumi, T., Uno, Y., Watanabe, O.: A new model for a scale-free hierarchical structure of isolated cliques. Dept. of Math. and Comp. Sciences Tokyo Institute of Technology Research Reports, Series C (2009)Google Scholar
  10. 10.
    Song, C., Havlin, S., Makse, H.A.: Self-similarity of complex networks. Nature 433(7024), 392–395 (2005)CrossRefGoogle Scholar
  11. 11.
    Song, C., Havlin, S., Makse, H.A.: Origins of fractality in the growth of complex networks. Nature Physics 2(4), 275–281 (2006)CrossRefGoogle Scholar
  12. 12.
    Uno, Y., Kiyotani, T., Oguri, F.: Investigating web structure by cliques and stars. RIMS Kokyuroku 1644, 44–54 (2009)Google Scholar
  13. 13.
    Uno, Y., Ota, Y., Uemichi, A.: Web structure mining by isolated stars. In: Aiello, W., Broder, A., Janssen, J., Milios, E.E. (eds.) WAW 2006. LNCS, vol. 4936, pp. 149–156. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Takeya Shigezumi
    • 1
  • Yushi Uno
    • 2
  • Osamu Watanabe
    • 1
  1. 1.Tokyo Institute of TechnologyTokyoJapan
  2. 2.Osaka Prefecture UniversitySakaiJapan

Personalised recommendations