A generative model for sparse, evolving digraphs - Archive ouverte HAL Access content directly
Conference Papers Year :

A generative model for sparse, evolving digraphs

(1) , (2, 1) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
analysis-pa-model.pdf (186.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01617851 , version 1 (17-10-2017)

Identifiers

Cite

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⟩
164 View
452 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More