| minmax_adj {treestats} | R Documentation |
Adjancency Matrix properties
Description
Calculates the eigenvalues of the Adjancency Matrix, where the Adjacency matrix is a square matrix indicate whether pairs of vertices are adjacent or not on a graph - here, entries in the matrix indicate connections between nodes (and betweens nodes and tips). Entries in the adjacency matrix are weighted by branch length. Then, using the adjacency matrix, we calculate the spectral properties of the matrix, e.g. the minimum and maximum eigenvalues of the matrix. When the R package RSpectra is available, a faster calculation can be used, which does not calculate all eigenvalues, but only the maximum and minimum. As such, when using this option, the vector of all eigenvalues is not returned
Usage
minmax_adj(phy, use_rspectra = FALSE)
Arguments
phy |
phylo object or ltable |
use_rspectra |
boolean to indicate whether the helping package RSpectra should be used, in which case only the minimum and maximum values are returned |
Value
List with the minimum and maximum eigenvalues
References
Chindelevitch, Leonid, et al. "Network science inspires novel tree shape statistics." Plos one 16.12 (2021): e0259877.