computeEigenvector: Eigenvector centrality of a rooted binary phylo tree.

In Leonardini/treeCentrality: Computation of Network Science Statistics on Trees in Linear Time

Description

computeEigenvector computes the eigenvector centrality of a rooted binary phylo tree.

Usage

computeEigenvector(tree, weight = FALSE, scale = FALSE)

Arguments

tree	A phylo tree; needs to be binary and rooted, but the root can be arbitrary.
weight	A logical scalar; if TRUE, branch lengths are used; if a root edge is present, it is ignored!
scale	A logical scalar; if TRUE, the resulting vector is scaled to have a maximum value of 1. If no scaling is used (the default), the eigenvector has unit length in the Euclidean norm.

Value

A list containing the dominant eigenvector and its corresponding eigenvalue.

See Also

Other network science-based tree shape statistics: computeBetweenness, computeCloseness, computeDiameter, computeFarness, computeWienerIndex

Leonardini/treeCentrality documentation built on April 7, 2020, 3:18 p.m.