Learn R Programming

ig.degree.betweenness (version 0.2.0)

"Smith-Pittman Community Detection Algorithm for 'igraph' Objects (2024)"

Description

Implements the "Smith-Pittman" community detection algorithm for network analysis using 'igraph' objects. This algorithm combines node degree and betweenness centrality measures to identify communities within networks, with a gradient evident in social partitioning. The package provides functions for community detection, visualization, and analysis of the resulting community structure. Methods are based on results from Smith, Pittman and Xu (2024) .

Copy Link

Version

Install

install.packages('ig.degree.betweenness')

Monthly Downloads

152

Version

0.2.0

License

MIT + file LICENSE

Issues

Pull Requests

Stars

Forks

Maintainer

Benjamin Smith

Last Published

June 24th, 2025

Functions in ig.degree.betweenness (0.2.0)

plot_node_degrees

Visualize Node Degree Distribution in a Network Graph
prep_unlabeled_graph

Prepared Unlabeled Graph to work with Degree-Betweenness Algorithm
cluster_degree_betweenness

Community structure detection based on node degree centrality and edge betweenness
oncology_network

Oncology Clinical Trial Referral Network
plot_simplified_edgeplot

Plot Simplified Edgeplot