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) <doi:10.48550/arXiv.2411.01394>.
Version: 0.2.0 Depends: R (≥ 4.1.0) Imports: igraph, igraphdata, rlist, BBmisc, qgraph, dplyr, tibble, tidyr, ggplot2 Suggests: knitr, rmarkdown Published: 2025-06-24 DOI: 10.32614/CRAN.package.ig.degree.betweenness Author: Benjamin Smith [aut, cre], Tyler Pittman [aut], Wei Xu [aut] Maintainer: Benjamin Smith <benyamin.smith at mail.utoronto.ca> BugReports: https://github.com/benyamindsmith/ig.degree.betweenness/issues License: MIT + file LICENSE URL: https://github.com/benyamindsmith/ig.degree.betweenness NeedsCompilation: no Citation: ig.degree.betweenness citation info CRAN checks: ig.degree.betweenness results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=ig.degree.betweenness to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4