![]() ![]() dyad.census: Compute a Holland and Leinhardt MAN Dyad Census. ![]() diag.remove: Remove the Diagonals of Adjacency Matrices in a Graph Stack.degree: Compute the Degree Centrality Scores of Network Positions.cutpoints: Identify the Cutpoints of a Graph or Digraph.cug.test: Univariate Conditional Uniform Graph Tests.cugtest: Perform Conditional Uniform Graph (CUG) Hypothesis Tests for.consensus: Estimate a Consensus Structure from Multiple Observations.connectedness: Compute Graph Connectedness Scores.components: Find the Number of (Maximal) Components Within a Given Graph.component.dist: Calculate the Component Size Distribution of a Graph.coleman: Coleman's High School Friendship Data.closeness: Compute the Closeness Centrality Scores of Network Positions.clique.census: Compute Cycle Census Information.centralization: Find the Centralization of a Given Network, for Some Measure. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |