"Node+Edge Betweenness Community Detection Algorithm for 'igraph' Objects"

Implements the "Node + Edge Betweenness" 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 implementation of the algorithm, visualization, and analysis of the resulting community structure along with the original dataset used in the publication. Methods are based on results from Smith, Pittman and Xu (2026) .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

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

0.2.1 by Benjamin Smith, 4 months ago


https://github.com/benyamindsmith/ig.degree.betweenness, https://benyamindsmith.github.io/ig.degree.betweenness/


Report a bug at https://github.com/benyamindsmith/ig.degree.betweenness/issues


Browse source code at https://github.com/cran/ig.degree.betweenness


Authors: Benjamin Smith [aut, cre] (ORCID: , Tyler Pittman [aut] , Wei Xu [aut]


Documentation:   PDF Manual  


MIT + file LICENSE license


Imports BBmisc, dplyr, ggplot2, igraph, igraphdata, lifecycle, qgraph, rlist, stats, tibble, tidyr


See at CRAN