build_laplacian

Build a Laplacian matrix (combinatorial Laplacian or random-walk Laplacian)
from a symmetric (weighted) graph adjacency matrix.

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

build_laplacian function

<dl><dt>adj_mat</dt>
<dd>Symmetric adjacency matrix from which to build the Laplacian.</dd>
<dt>type_lap</dt>
<dd>Type of Laplacian to build.
One of <code>"comb"</code> (combinatorial) or <code>"rw"</code> (random-walk).</dd></dl>

Arguments

Build a Laplacian matrix — build_laplacian

<dl>

<dt>adj_mat</dt>
<dd>Symmetric adjacency matrix from which to build the Laplacian.</dd>


<dt>type_lap</dt>
<dd>Type of Laplacian to build.
One of <code>"comb"</code> (combinatorial) or <code>"rw"</code> (random-walk).</dd>

</dl>

build_laplacian: Build a Laplacian matrix

Description

Usage

Value

Arguments

Examples