top of page
relatório de análise de rede
mapa: linear
distribuição: alternada


Degree Report
Results:
Average Degree: 2.000

Clustering Coefficient Metric Report
Parameters:
Network Interpretation: undirected
Results:
Average Clustering Coefficient: -
Total triangles: 0
The Average Clustering Coefficient is the mean value of individual coefficients.
Algorithm:
Matthieu Latapy, Main-memory Triangle Computations for Very Large (Sparse (Power-Law)) Graphs, in Theoretical Computer Science (TCS) 407 (1-3), pages 458-473, 2008

Connected Components Report
Parameters:
Network Interpretation: undirected
Results:
Number of Weakly Connected Components: 40
Algorithm:
Robert Tarjan, Depth-First Search and Linear Graph Algorithms, in SIAM Journal on Computing 1 (2): 146–160 (1972)



Graph Distance Report
Parameters:
Network Interpretation: undirected
Results:
Diameter: 0
Radius: 0
Average Path length: NaN
Algorithm:
Ulrik Brandes, A Faster Algorithm for Betweenness Centrality, in Journal of Mathematical Sociology 25(2):163-177, (2001)


Modularity Report
Parameters:
Randomize: On
Use edge weights: On
Resolution: 1.0
Results:
Modularity: -
Modularity with resolution: -
Number of Communities: 40
Algorithm:
Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, Etienne Lefebvre, Fast unfolding of communities in large networks, in Journal of Statistical Mechanics: Theory and Experiment 2008 (10), P1000
Resolution:
R. Lambiotte, J.-C. Delvenne, M. Barahona Laplacian Dynamics and Multiscale Modular Structure in Networks 2009

Weighted Degree Report
Results:
Average Weighted Degree: 2.000
bottom of page