get_first_eigs

Compute the first few eigenvalues (by magnitude) and
associated eigenvectors of a matrix.

internal

Tools for spectral clustering of weighted directed networks using motif
adjacency matrices. Methods perform well on large and sparse networks, and
random sampling methods for generating weighted directed networks are also
provided. Based on methodology detailed in Underwood, Elliott and Cucuringu
(2020) <arXiv:2004.01293>.

William George Underwood

motifcluster

Motif-Based Spectral Clustering of Weighted Directed Networks

get_first_eigs function

<dl><dt>some_mat</dt>
<dd>Matrix for which eigenvalues and eigenvectors
are to be calculated.</dd>
<dt>num_eigs</dt>
<dd>Number of eigenvalues and eigenvectors to calculate.</dd></dl>

Arguments

Compute first few eigenvalues and eigenvectors of a matrix — get_first_eigs

<dl>

<dt>some_mat</dt>
<dd>Matrix for which eigenvalues and eigenvectors
are to be calculated.</dd>


<dt>num_eigs</dt>
<dd>Number of eigenvalues and eigenvectors to calculate.</dd>

</dl>

get_first_eigs: Compute first few eigenvalues and eigenvectors of a matrix

Description

Usage

Value

Arguments