Nothing
ig.degree.betweenness: "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) <doi:10.1002/cjs.70060>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Benjamin Smith [aut, cre] (ORCID: <https://orcid.org/0009-0007-2206-0177>), Tyler Pittman [aut] (ORCID: <https://orcid.org/0000-0002-5013-6980>), Wei Xu [aut] (ORCID: <https://orcid.org/0000-0002-0257-8856>) |
| Maintainer | Benjamin Smith <benyamin.smith@mail.utoronto.ca> |
| License | MIT + file LICENSE |
| Version | 0.2.1 |
| URL | https://github.com/benyamindsmith/ig.degree.betweenness https://benyamindsmith.github.io/ig.degree.betweenness/ |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the ig.degree.betweenness package in your browser
Any scripts or data that you put into this service are public.
