User Tools

Site Tools


dilena

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
dilena [2021/10/12 05:44]
gda
dilena [2021/10/12 05:48]
gda removed
Line 6: Line 6:
  
 DiLeNA is modular and it is composed of two main components: DiLeNA is modular and it is composed of two main components:
-  * Graph Generator: it is in charge of downloading the transactions of the examined DLT, generated during the time interval of interest. Then, a directed graph is built, that represents the interactions among the nodes. The vertices of the graph correspond to the addresses in the DLT and, for each transaction, an edge directed from the sender to the recipient of the transactions is made (if not already existing). +  * **Graph Generator**: it is in charge of downloading the transactions of the examined DLT, generated during the time interval of interest. Then, a directed graph is built, that represents the interactions among the nodes. The vertices of the graph correspond to the addresses in the DLT and, for each transaction, an edge directed from the sender to the recipient of the transactions is made (if not already existing). 
-  * Graph Analyzer: this module is in charge of calculating the typical metrics related to the obtained graph. Among the others, the tool is able to measure the degree distribution, network clustering coefficient, as well as to identify the main component and some of its main +  * **Graph Analyzer**: this module is in charge of calculating the typical metrics related to the obtained graph. Among the others, the tool is able to measure the degree distribution, network clustering coefficient, as well as to identify the main component and some of its main metrics, such as the average shortest path. Moreover, the tool computes if the network is a small world, by comparing it with a corresponding random graph (with the same amount of nodes and edges). 
-metrics, such as the average shortest path. Moreover, the tool computes if the network is a small world, by comparing it with a corresponding random graph (with the same amount of nodes and edges).+
 DiLeNA is available in source code form. DiLeNA is available in source code form.
  
Line 23: Line 23:
 To cite the DiLeNA software use: To cite the DiLeNA software use:
  
-<file text ppna21.txt>+<file text gda-ppna21.txt>
 Luca Serena, Stefano Ferretti, Gabriele D'Angelo Luca Serena, Stefano Ferretti, Gabriele D'Angelo
 Cryptocurrencies Activity as a Complex Network: Analysis of Transactions Graphs. Cryptocurrencies Activity as a Complex Network: Analysis of Transactions Graphs.
Line 32: Line 32:
 If you use BibTeX for LaTeX, use: If you use BibTeX for LaTeX, use:
  
-<file latex ppna21.tex>+<file latex gda-ppna21.tex>
 @article{gda-ppna21, @article{gda-ppna21,
  author = "Luca Serena and Stefano Ferretti and Gabriele D'Angelo",  author = "Luca Serena and Stefano Ferretti and Gabriele D'Angelo",