minmax_adj

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

Collection of phylogenetic tree statistics,
collected throughout the literature. All functions have been
written to maximize computation speed. The package includes
umbrella functions to calculate all statistics, all balance
associated statistics, or all branching time related statistics.
Furthermore, the 'treestats' package supports summary statistic
calculations on Ltables, provides speed-improved coding of
branching times, Ltable conversion and includes algorithms to
create intermediately balanced trees. Full description can be
found in Janzen (2024) <doi:10.1016/j.ympev.2024.108168>.

Thijs Janzen

treestats

Phylogenetic Tree Statistics

minmax_adj function

<dl><dt>phy</dt>
<dd>phylo object or ltable</dd>
<dt>use_rspectra</dt>
<dd>boolean to indicate whether the helping package RSpectra
should be used, in which case only the minimum and maximum values are
returned</dd></dl>

Arguments

Adjancency Matrix properties — minmax_adj

<dl>

<dt>phy</dt>
<dd>phylo object or ltable</dd>


<dt>use_rspectra</dt>
<dd>boolean to indicate whether the helping package RSpectra
should be used, in which case only the minimum and maximum values are
returned</dd>

</dl>

Last chance! 50% off unlimited learning

minmax_adj: Adjancency Matrix properties

Description

Usage

Value

Arguments

References