Learn R Programming

DCG (version 0.9.3)

Data Cloud Geometry (DCG): Using Random Walks to Find Community Structure in Social Network Analysis

Description

Data cloud geometry (DCG) applies random walks in finding community structures for social networks. Fushing, VanderWaal, McCowan, & Koehl (2013) ().

Copy Link

Version

Install

install.packages('DCG')

Monthly Downloads

186

Version

0.9.3

License

GPL (>= 2)

Maintainer

Jessica Vandeleest

Last Published

April 9th, 2019

Functions in DCG (0.9.3)

temperatureSample

generate temperatures temperatureSample generate tempatures based on either random or fixed intervals
as.SimilarityMatrix

Convert a matrix to a similarity matrix. as.SimilarityMatrix convert an adjacency matrix to a similarity matrix.
plotTheCluster

generate tree plots for selected ensemble matrix plotTrees plot one cluster tree
plotMultiEigenvalues

plot eigenvalues plotMultiEigenvalues plot eigenvalues to determine number of communities by finding the elbow point
GetSim

GetSim get similarity matrix from a distance matrix
getEigenvalueList

generate eigenvalues for all ensemble matrices getEigenvalueList get eigenvalues from ensemble matrices
as.symmetricAdjacencyMatrix

convert to a symmetric adjacency matrix
getEnsList

generating a list of ensemble matrices based on the similarity matrix and temperatures
getEns

generate ensemble matrix getEns get ensemble matrix from given similarity matrix and temperature
monkeyGrooming

Grooming network data
plotCLUSTERS

generate tree plots for each ensemble matrix plotCLUSTERS plot all cluster trees