Capítols de llibrehttp://hdl.handle.net/2117/58402020-02-23T05:27:09Z2020-02-23T05:27:09ZMarshall-Olkin extended Zipf distributionPérez Casany, MartaDuarte López, ArielPrat Pérez, Arnauhttp://hdl.handle.net/2117/1059122020-02-12T22:01:30Z2017-06-28T07:17:33ZMarshall-Olkin extended Zipf distribution
Pérez Casany, Marta; Duarte López, Ariel; Prat Pérez, Arnau
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.
2017-06-28T07:17:33ZPérez Casany, MartaDuarte López, ArielPrat Pérez, ArnauBeing 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.Using the Marshall-Olkin extended Zipf distribution in graph generationDuarte López, ArielPrat Pérez, ArnauPérez Casany, Martahttp://hdl.handle.net/2117/1057442020-02-12T21:59:29Z2017-06-23T06:39:52ZUsing the Marshall-Olkin extended Zipf distribution in graph generation
Duarte López, Ariel; Prat Pérez, Arnau; Pérez Casany, Marta
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.
2017-06-23T06:39:52ZDuarte López, ArielPrat Pérez, ArnauPérez Casany, MartaBeing 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.Introduction to graph databasesLarriba Pey, JosepMartínez Bazán, NorbertDomínguez Sal, Davidhttp://hdl.handle.net/2117/282322020-02-12T21:46:57Z2015-06-09T08:37:06ZIntroduction to graph databases
Larriba Pey, Josep; Martínez Bazán, Norbert; Domínguez Sal, David
The use of graphs in analytic environments is getting more and more widespread, with applications in many different environments like social network analysis, fraud detection, industrial management, knowledge analysis, etc. Graph databases are one important solution to consider in the management of large datasets. The course will be oriented to tackle four important aspects of graph management. First, to give a characterization of graphs and the most common operations applied on them. Second, to review the technologies for graph management and focus on the particular case of Sparksee. Third, to analyze in depth some important applications and how graphs are used to solve them. Fourth, to understand the use of benchmarking to make the requirements of the user compatible with the growth of the technologies for graph management.
2015-06-09T08:37:06ZLarriba Pey, JosepMartínez Bazán, NorbertDomínguez Sal, DavidThe use of graphs in analytic environments is getting more and more widespread, with applications in many different environments like social network analysis, fraud detection, industrial management, knowledge analysis, etc. Graph databases are one important solution to consider in the management of large datasets. The course will be oriented to tackle four important aspects of graph management. First, to give a characterization of graphs and the most common operations applied on them. Second, to review the technologies for graph management and focus on the particular case of Sparksee. Third, to analyze in depth some important applications and how graphs are used to solve them. Fourth, to understand the use of benchmarking to make the requirements of the user compatible with the growth of the technologies for graph management.