A Method for 'Connecting The Dots' in Weighted Graphs

A method for pattern discovery in weighted graphs as outlined in Thistlethwaite et al. (2021) . Two use cases are achieved: 1) Given a weighted graph and a subset of its nodes, do the nodes show significant connectedness? 2) Given a weighted graph and two subsets of its nodes, are the subsets close neighbors or distant?


Reference manual

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


1.0.0 by Lillian Thistlethwaite, a year ago

Browse source code at https://github.com/cran/CTD

Authors: Lillian Thistlethwaite [aut, cre]

Documentation:   PDF Manual  

MIT + file LICENSE license

Depends on gmp, igraph, stats, grDevices, graphics

Suggests knitr, rmarkdown, huge, ggplot2, gplots, RColorBrewer, testthat

System requirements: gmp (>=5.0)

See at CRAN