A Generative Model for Sparse, Evolving Digraphs

  • Georgios Papoudakis
  • Philippe Preux
  • Martin Monperrus
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 689)

Abstract

Generating graphs that are similar to real ones is an open problem, while the similarity notion is quite elusive and hard to formalize. In this paper, we focus on sparse digraphs and propose SDG, an algorithm that aims at generating graphs similar to real ones. Since real graphs are evolving and this evolution is important to study in order to understand the underlying dynamical system, we tackle the problem of generating series of graphs. We propose SEDGE, an algorithm meant to generate series of graphs similar to a real series. SEDGE is an extension of SDG. We consider graphs that are representations of software programs and show experimentally that our approach outperforms other existing approaches. Experiments show the performance of both algorithms.

Notes

Acknowledgements

This work was partially supported by CPER Nord-Pas de Calais/FEDER DATA Advanced data science and technologies 2015–2020, and the French Ministry of Higher Education and Research. We also wish to acknowledge the continual support of Inria, and the stimulating environment provided by the SequeL Inria project-team.

References

  1. 1.
    Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286 (1999)Google Scholar
  2. 2.
    Bollobas, B., Borgs, C., Chayes, J., Riordan, O.: Directed scale-free graphs. In: Proceedings SODA, pp. 132–139 (2003)Google Scholar
  3. 3.
    Carstens, C.J., Berger, A., Strona, G.: Curveball: a new generation of sampling algorithms for graphs with fixed degree sequence (2016). arXiv:1609.05137
  4. 4.
    Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88(9) (2015)Google Scholar
  5. 5.
    Kleitman, D., Wang, D.: Algorithms for constructing graphs and digraphs with given valences and factors. Discret. Math. 6(1), 79–88 (1973)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Musco, V., Monperrus, M., Preux, P.: A generative model of software dependency graphs to better understand software evolution (2015). arXiv:1410.7921
  7. 7.
    Musco, V., Monperrus, M., Preux, P.: Mutation-based graph inference for fault localization. In: Proceedings SCAM, pp. 97–106 (2016)Google Scholar
  8. 8.
    Musco, V., Monperrus, M., Preux, P.: A large-scale study of call graph-based impact prediction using mutation testing. Softw. Qual. J. 25(3), 921–950 (2017)CrossRefGoogle Scholar
  9. 9.
    Newman, M.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Raemaekers, S., Deursen, A.v., Visser, J.: The maven repository dataset of metrics, changes, and dependencies. In: Proceedings MSR, pp. 221–224. IEEE Press (2013)Google Scholar
  11. 11.
    Staudt, C.L., Hamann, M., Safro, I., Gutfraind, A., Meyerhenke, H.: Generating Scaled Replicas of Real-World Complex Networks, pp. 17–28. Springer International Publishing (2017)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Georgios Papoudakis
    • 1
  • Philippe Preux
    • 1
  • Martin Monperrus
    • 2
  1. 1.Université de Lille, CRIStAL & InriaVilleneuve d’AscqFrance
  2. 2.KTH Royal Institute of TechnologyStockholmSweden

Personalised recommendations