eigen_centrality

Eigen vector centrality associates with each node v the positive
value e(v), such that: \(sum_{e~v} w(uv) * e(u) = \lambda * e(v)\). Thus,
e(v) is the Perron-Frobenius eigenvector of the adjacency matrix of the tree.

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

eigen_centrality function

<dl><dt>phy</dt>
<dd>phylo object or ltable</dd>
<dt>weight</dt>
<dd>if TRUE, uses branch lengths.</dd>
<dt>scale</dt>
<dd>if TRUE, the eigenvector is rescaled</dd></dl>

Arguments

Eigen vector centrality — eigen_centrality

<dl>

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


<dt>weight</dt>
<dd>if TRUE, uses branch lengths.</dd>


<dt>scale</dt>
<dd>if TRUE, the eigenvector is rescaled</dd>

</dl>

Last chance! 50% off unlimited learning

eigen_centrality: Eigen vector centrality

Description

Usage

Value

Arguments

References