Learn R Programming

R package: dupNodes

Browse this from the web or browse the generated documentation

dupNodes is the companion package to paper "Intra-family links in the analysis of marital networks", with reference here.

It creates duplicates of nodes that have self loops in undirected graphs such as the one here

in this way

which has exactly the same degree; in this way, the weights of these self-loops can be taken into account when computing centrality measures such as betweenness.

Installation

Install released versions from CRAN as usual, or development version from here

library(devtools)
install_github("JJ/R-dupNodes")

Reference

Please cite this paper when using this package in your work

@Article{mm24:intra_family_links,
  author =       {Merelo, J.J. and Molinari, M.C. },
  title =        {Intra-family links in the analysis of marital networks},
  journal =      {Journal of computational social science},
  year =         2024,
  url= {https://link.springer.com/epdf/10.1007/s42001-023-00245-4},
  doi= {https://doi.org/10.1007/s42001-023-00245-4},
  month =     {January}
}

Examples

There are some examples explained in vignettes. Use vignette("dupNodes") to access all of chem, or individually:

  • vignette("doges-social-network") to apply functions here to data from the dogesr package; this is the online version
  • vignette("florentine-social-network"), which uses data from the well-known Florentine social network, with a (documented) self-loop added; browse it in CRAN

License

The contents of this repository are (c) JJ Merelo, 2024, and are released under the GPL 3 license.

Copy Link

Version

Install

install.packages('dupNodes')

Monthly Downloads

153

Version

0.3.0

License

GPL-3

Maintainer

Juan Merelo-Guervós

Last Published

April 10th, 2024

Functions in dupNodes (0.3.0)

dup.nodes.from.graph

Creates an igraph object from a igraph some of whose nodes have self-loops
florentine.sn

Data on matrimonial and commercial links of Florentine families
DNSLbetweenness_for_graph

Computes betweenness via duplication of nodes with self-loops for a graph
betweenness.with.duplicated.nodes

Computes betweenness of an igraph object that already has duplicated nodes
DNSL.betweenness

Computed betweenness via duplication of nodes with self-loops (Duplicated Nodes with Self Loops)
dup.nodes.from.data.frame

Creates an igraph object from a data frame with self-loops