Expand description
Graphlet decomposition (ALGO-CL-020).
Counterpart of igraph_graphlets(), igraph_graphlets_candidate_basis(),
and igraph_graphlets_project() from references/igraph/src/cliques/glet.c.
Graphlet decomposition models a weighted undirected graph via the union of potentially overlapping dense social groups. Step one finds a candidate basis of cliques at weight thresholds; step two projects the graph onto that basis via an iterative NNLS-like algorithm.
Reference: Hossein Azari Soufiani and Edoardo M. Airoldi, “Graphlet decomposition of a weighted network” (2012).
Structs§
- Graphlet
Basis - Result of
graphlets_candidate_basis: a list of basis cliques with their associated weight thresholds. - Graphlet
Decomposition - Result of
graphlets: basis cliques with their projected weights, sorted by decreasing weight.
Functions§
- graphlets
- Full graphlet decomposition: find basis + project + sort by weight.
- graphlets_
candidate_ basis - Find a candidate graphlets basis for a weighted undirected graph.
- graphlets_
project - Project a graph onto a graphlets basis.