Termination of Multipartite Graph Series Arising from Complex Network Modelling

  • Matthieu Latapy
  • Thi Ha Duong Phan
  • Christophe Crespelle
  • Thanh Qui Nguyen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6508)

Abstract

An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs. However, this approach has, until now, severe limitations resulting from its incapacity to reproduce a key property of this object: the overlapping nature of cliques in complex networks. In order to get rid of these limitations we propose to encode the structure of clique overlaps in a network thanks to a process consisting in iteratively factorising the maximal bicliques between the upper level and the other levels of a multipartite graph. We show that the most natural definition of this factorising process leads to infinite series for some instances. Our main result is to design a restriction of this process that terminates for any arbitrary graph. Moreover, we show that the resulting multipartite graph has remarkable combinatorial properties and is closely related to another fundamental combinatorial object. Finally, we show that, in practice, this multipartite graph is computationally tractable and has a size that makes it suitable for complex network 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. Reviews of Modern Physics 74, 47 (2002)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Barabasi, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks. Advances in Physics 51 (2002)Google Scholar
  4. 4.
    Erdös, P., Rényi, A.: On random graphs I. Publications Mathematics Debrecen 6, 290–297 (1959)MATHGoogle Scholar
  5. 5.
    Gély, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques. Discrete Applied Mathematics 157(7), 1447–1459 (2009)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Guillaume, J.-L., Latapy, M.: Bipartite structure of all complex networks. Information Processing Letters (IPL) 90(5), 215–221 (2004)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Guillaume, J.-L., Latapy, M.: Bipartite graphs as models of complex networks. Physica A 371, 795–813 (2006)CrossRefGoogle Scholar
  8. 8.
    Latapy, M., Magnien, C., Del Vecchio, N.: Basic notions for the analysis of large two-mode networks. Social Networks 30(1), 31–48 (2008)CrossRefGoogle Scholar
  9. 9.
    Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. In: Random Structures and Algorithms (1995)Google Scholar
  10. 10.
    Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440–442 (1998)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Matthieu Latapy
    • 1
  • Thi Ha Duong Phan
    • 2
    • 3
  • Christophe Crespelle
    • 1
  • Thanh Qui Nguyen
    • 4
  1. 1.LIP6, CNRS and Université Pierre et Marie Curie (UPMC - Paris 6)ParisFrance
  2. 2.Institute of MathematicsHanoiVietnam
  3. 3.LIAFA, Universite Paris 7ParisFrance
  4. 4.University of CanThoQuan Ninh Kieu, CanThoVietnam

Personalised recommendations