simplicial_degree() counts, for each node of a simplicial complex, how
many simplices of each dimension contain it: edges (dimension 1),
triangles (dimension 2) and so on. It is the higher-order counterpart of
a node's degree, and says which nodes take part in many group-level
structures rather than only in pairs.
The counts describe the complex as built, so they move with the
threshold or pathways build_simplicial() was given. A node in a clique
of m nodes is in choose(m - 1, k) of its k-simplices, so one large
clique raises the node's counts in every dimension up to the clique's
own;
compare nodes within a dimension.
Arguments
- sc
A
simplicial_complexfrombuild_simplicial().- normalized
Whether to divide each count of dimension k by the largest possible one,
choose(n_nodes - 1, k), the number of k-simplices a node can be in. DefaultFALSE.