A Collection of Tools for Network Analysis
LFR benchmark graphs
Discrete core-periphery model
dyad census with node attributes
Find Cliques, maximal or not, fast
Cartesian product of two graphs
Graph correlation
Direct product of two graphs
Multiple networks from a single edgelist with a typed attribute
k partite graphs
helper function
Reciprocity correlation coefficient
Generate random graphs with a given coreness sequence
Adjacency list
weighted dense adjacency matrix
Convert a list of graphs to an adjacency matrices
two-mode network from a data.frame
Clique Vertex Matrix
Homophilic random graph using BA preferential attachment model
split graph
Print graphs to terminal
Maximal Structural Equivalence
triad census with node attributes
Provides a collection of network analytic (convenience) functions which are missing in other standard packages. This includes triad census with attributes <doi:10.1016/j.socnet.2019.04.003>, core-periphery models <doi:10.1016/S0378-8733(99)00019-2>, and several graph generators. Most functions are build upon 'igraph'.
Useful links