Name
Abstract | ||
|---|---|---|
Being able to generate large synthetic graphs resembling those found in the real world, is of high importance for the design of new graph algorithms and benchmarks. In this paper, we first compare several probability models in terms of goodness-of-fit, when used to model the degree distribution of real graphs. Second, after confirming that the MOEZipf model is the one that gives better fits, we present a method to generate MOEZipf distributions. The method is shown to work well in practice when implemented in a scalable synthetic graph generator. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-27308-2_40 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Graph algorithms,Zipf's law,Graph,Graph generation,Computer science,Parallel computing,Theoretical computer science,Degree distribution,Scalability | Conference | 9523 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ariel Duarte-López | 1 | 0 | 0.68 |
| Arnau Prat-Pérez | 2 | 227 | 13.44 |
| Marta Pérez-Casany | 3 | 12 | 2.41 |