netrankr
Analyzing Partial Rankings in Networks
Implements methods for centrality related analyses of networks. While the package includes the possibility to build more than 20 indices, its main focus lies on index-free assessment of centrality via partial rankings obtained by neighborhood-inclusion or positional dominance. These partial rankings can be analyzed with different methods, including probabilistic methods like computing expected node ranks and relative rank probabilities (how likely is it that a node is more central than another?). The methodology is described in depth in the vignettes and in Schoch (2018) doi:10.1016/j.socnet.2017.12.003.
- Version1.2.3
- R versionunknown
- LicenseMIT
- LicenseLICENSE
- Needs compilation?Yes
- netrankr citation info
- Last release12/19/2023
Documentation
- Vignette09 benchmarks
- Vignette05 centrality indices
- Vignette04 indirect relations in networks
- Vignette01 neighborhood-inclusion and centrality
- Vignette06 partial centrality
- Vignette03 positional dominance in networks
- Vignette07 probabilistic centrality
- Vignette02 uniquely ranked graphs
- Vignette08 use case
- MaterialREADME
- MaterialNEWS
Team
David Schoch
Julian Müller
Show author detailsRolesContributor
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports3 packages
- Suggests8 packages
- Linking To2 packages
- Reverse Depends1 package
- Reverse Suggests1 package