ROBustness In Network (robin): an R Package for Comparison and Validation of Communities

@article{Policastro2021ROBustnessIN,
  title={ROBustness In Network (robin): an R Package for Comparison and Validation of Communities},
  author={Valeria Policastro and Dario Righelli and Annamaria Carissimo and L. Cutillo and Italia De Feis},
  journal={R J.},
  year={2021},
  volume={13},
  pages={292}
}
In network analysis, many community detection algorithms have been developed, however, their implementation leaves unaddressed the question of the statistical validation of the results. Here we present robin(ROBustness In Network), an R package to assess the robustness of the community structure of a network found by one or more methods to give indications about their reliability. The procedure initially detects if the community structure found by a set of algorithms is statistically… 

References

SHOWING 1-10 OF 49 REFERENCES

Validation of community robustness

Benchmark graphs for testing community detection algorithms.

This work introduces a class of benchmark graphs, that account for the heterogeneity in the distributions of node degrees and of community sizes, and uses this benchmark to test two popular methods of community detection, modularity optimization, and Potts model clustering.

A Comparative Analysis of Community Detection Algorithms on Artificial Networks

This study uses the Lancichinetti-Fortunato-Radicchi benchmark graph to test eight state-of-the-art community detection algorithms and provides guidelines that help to choose the most adequate community detection algorithm for a given network.

Finding and evaluating community structure in networks.

  • M. NewmanM. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.

Finding Statistically Significant Communities in Networks

OSLOM (Order Statistics Local Optimization Method), the first method capable to detect clusters in networks accounting for edge directions, edge weights, overlapping communities, hierarchies and community dynamics, is presented.

A Testing Based Extraction Algorithm for Identifying Significant Communities in Networks

A testing based community detection procedure called Extraction of Statistically Significant Communities (ESSC), based on p-values for the strength of connection between a single vertex and a set of vertices under a reference distribution derived from a conditional configuration network model, which is suggested to be an effective exploratory tool for the discovery of relevant community structure in complex network systems.

Fast unfolding of communities in large networks

This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.

A generalised significance test for individual communities in networks

This study proposes a method to statistically test the significance of individual communities in a given network by estimating a distribution of the quality function for randomised networks to calculate a likelihood of each community in the given network.

Comparing community structure identification

It is found that the most accurate methods tend to be more computationally expensive, and that both aspects need to be considered when choosing a method for practical purposes.

Finding community structure in networks using the eigenvectors of matrices.

  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
A modularity matrix plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations, and a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong are proposed.