aspl {memnet} | R Documentation |
Computes the average shortest path length (aspl) using igraph
's automatic
method.
aspl(adj, types = "uncorrected", weights = NULL, mode = "undirected")
adj |
numeric matrix representing the adjacency matrix. |
types |
character. Either |
weights |
numeric vector of edge weights. Optional. |
mode |
character, either |
Per default the uncorrected apsl is computed. Otherwise, the uncorrected aspl
is normalized by log(n nodes)/log(average degree)
, i.e., the expected
average shortest path length for an Erdös-Renyi random graph.
Local clustering coefficient.
# 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 average shortest path length aspl(adj) # get corrected average shortest path length aspl(adj, types = 'corrected')