A generative model for sparse, evolving digraphs

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01617851
Contributor : Preux Philippe <>
Submitted on : Tuesday, October 17, 2017 - 11:01:17 AM
Last modification on : Friday, March 22, 2019 - 1:34:43 AM
Long-term archiving on : Thursday, January 18, 2018 - 12:53:07 PM

Files

analysis-pa-model.pdf
Files produced by the author(s)

Identifiers

Citation

Georgios Papoudakis, Philippe Preux, Martin Monperrus. A generative model for sparse, evolving digraphs. 6th International Conference on Complex Networks and their Applications, Nov 2017, Lyon, France. pp.531-542, ⟨10.1007/978-3-319-72150-7_43⟩. ⟨hal-01617851⟩

Share

Metrics

Record views

258

Files downloads

213