build_Gd

Build the sparse double-edge adjacency matrix <code>Gd</code> from a
graph adjacency 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

build_Gd function

<dl><dt>adj_mat</dt>
<dd>The original adjacency matrix.</dd></dl>

Arguments

Build double-edge adjacency matrix — build_Gd

<dl>

<dt>adj_mat</dt>
<dd>The original adjacency matrix.</dd>

</dl>

build_Gd: Build double-edge adjacency matrix

Description

Usage

Value

Arguments