network_stats: Network statistics

In memnet: Network Tools for Memory Research

Description

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.

Usage

network_stats(adj, giant = FALSE, weights = NULL,
  mode = "undirected")

Arguments

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 "directed" or "undirected", specifying whether the network should be interepeted as directed or undirected. Defaults to "undirected".

Value

A named numeric vector containing the computed network statistics.

Examples

# 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)

memnet documentation built on May 2, 2019, 9:35 a.m.