graphonSpectralClustering: Graph clustering using the pairwise graphon distances and...

In graphclust: Hierarchical Graph Clustering for a Collection of Networks

Graph clustering using the pairwise graphon distances and spectral clustering

Description

Graph clustering using the pairwise graphon distances and spectral clustering

Usage

graphonSpectralClustering(allAdj, nbClusters, sig = 0.1, nbCores = 1)

Arguments

allAdj	list of adjacency matrices
nbClusters	number of clusters to be found
sig	parameter for Gaussian kernel used for the similarity matrix
nbCores	number of cores for parallelization.

Value

list with the obtained graph clusteirng ($clust) and the matrix with the pairwise graphon distances between all pairs of networks

Examples

theta <- list(pi=c(.5,.5), gamma=matrix((1:4)/8,2,2))
obs <- rCollectSBM(rep(10,4), theta)$listGraphs
res <- graphonSpectralClustering(obs, 2, nbCores=1)

graphclust documentation built on June 7, 2023, 5:18 p.m.