A generative model for sparse, evolving digraphs
Document type :
Communication dans un congrès avec actes
Title :
A generative model for sparse, evolving digraphs
Author(s) :
Papoudakis, Georgios [Auteur]
Sequential Learning [SEQUEL]
Preux, Philippe [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Sequential Learning [SEQUEL]
Monperrus, Martin [Auteur]
KTH Royal Institute of Technology [Stockholm] [KTH ]
Sequential Learning [SEQUEL]
Preux, Philippe [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Sequential Learning [SEQUEL]
Monperrus, Martin [Auteur]
KTH Royal Institute of Technology [Stockholm] [KTH ]
Conference title :
6th International Conference on Complex Networks and their Applications
City :
Lyon
Country :
France
Start date of the conference :
2017-11-29
HAL domain(s) :
Informatique [cs]/Algorithme et structure de données [cs.DS]
English abstract : [en]
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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-01617851/document
- Open access
- Access the document
- http://arxiv.org/pdf/1710.06298
- Open access
- Access the document
- https://hal.inria.fr/hal-01617851/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01617851/document
- Open access
- Access the document
- document
- Open access
- Access the document
- analysis-pa-model.pdf
- Open access
- Access the document
- 1710.06298
- Open access
- Access the document
- document
- Open access
- Access the document
- analysis-pa-model.pdf
- Open access
- Access the document