Description Usage Arguments Value Examples
Function computes various network measures including the size of the number of nodes (|V|), the number of edges (|E|), the average degree (k), uncorrected and corrected average local clustering (C, Cc), uncorrected and corrected average shortest path lengths (L, Lc), the small-world index (S) from Humphries & Gurney (2008), assortivity (A), and the size of largest component (p) relative to the entire network.
1 2 | network_stats(adj, giant = FALSE, weights = NULL,
mode = "undirected")
|
adj |
numeric matrix representing the adjacency matrix. |
giant |
logical specifying whether the should be computed for the largest component. |
weights |
numeric vector of edge weights. Optional. |
mode |
character, either |
A named numeric vector containing the computed network statistics.
1 2 3 4 5 6 7 8 9 10 11 | # get fluency data
data(animal_fluency)
# edge lists of fluency graphs
edge_list = threshold_graph(animal_fluency)
# get adjacency matrices
adj = edg_to_adj(edge_list)
# get structural overview
network_stats(adj)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.