17 results (0.078 seconds)
++ed by:

1 non-PAUSE user(s).

Darko Obradovic
SNA::Network - A toolkit for Social Network Analysis
SNA::Network::Algorithm::Betweenness - Calculate betweenneess values for all nodes
SNA::Network::Algorithm::Connectivity - identify network components
SNA::Network::Algorithm::Cores - calculate core collapse sequences (CCS)
SNA::Network::Algorithm::HITS - implementation of Kleinberg's HITS algorithm
SNA::Network::Algorithm::Louvain - identifies communities with the Louvain-method developed by Blondel and Guillaume and Lamboitte and Lefebvre
SNA::Network::Algorithm::PageRank - implementation of the PageRank algorithm
SNA::Network::Community - Community class for SNA::Network
SNA::Network::Edge - Edge class for SNA::Network
SNA::Network::Filter::Guess - load and save networks from/to Guess .gdf files
SNA::Network::Filter::Pajek - load and save networks from/to Pajek .net files
SNA::Network::Generator::ByDensity - Generate random networks by density
SNA::Network::Generator::ConfigurationModel - Generate random networks according to the configuration model
SNA::Network::Generator::MCMC - Generate random networks by a series of edge swaps according to the Markov Chain Monte Carlo principle
SNA::Network::Node - Node class for SNA::Network
SNA::Network::Node::Plugin::Test - Test plugin for SNA::Network::Node
SNA::Network::Plugin::Test - Test plugin for SNA::Network
Changes for version 0.19
    • added module values and modularity methods
    • fixed Louvain algorithm's quadratic memory consumption

Hosting generously
sponsored by Bytemark