Hierarchical Graph Clustering for a Collection of Networks
Adjusted Rand index
Sort stochastic block model parameter in a unique way using its grapho...
Fit a unique stochastic block model to a collection of networks
Fit a stochastic block model to every network in a collection of netwo...
Hierarchical graph clustering algorithm
Graph clustering method using graph moments
(squared) L2-norm of the graphons associated with two stochastic block...
Graph clustering using the pairwise graphon distances and spectral clu...
Plot the metagraph of the parameter of the stochastic block model asso...
Computation of graph moments of a network
Permute block labels of a stochastic block model parameter
Plot dendrogram to visualize the clustering obtained by the hierarchic...
Simulate a sample of networks of a stochastic block model
Simulate a collection of networks of a mixture of stochastic block mod...
Simulate a network of a stochastic block model
generation of a network of the directed preferential attachment (DPA) ...
Generation of a mixture of directed preferential attachment (DPA) mode...
(squared) norm between two stochastic block models
Graph clustering using an agglomerative algorithm to maximize the integrated classification likelihood criterion and a mixture of stochastic block models. The method is described in the article "Model-based clustering of multiple networks with a hierarchical algorithm" by T. Rebafka (2022) <arXiv:2211.02314>.