graph_from_adjacency_matrix_signed

Create signed graphs from adjacency matrices

Methods for the analysis of signed networks. This includes
several measures for structural balance as introduced by Cartwright
and Harary (1956) <doi:10.1037/h0046049>, blockmodeling algorithms
from Doreian (2008) <doi:10.1016/j.socnet.2008.03.005>, various
centrality indices, and projections of signed two-mode networks
introduced by Schoch (2020) <doi:10.1080/0022250X.2019.1711376>.

David Schoch

signnet

Methods to Analyse Signed Networks

graph_from_adjacency_matrix_signed function

<dl><dt>A</dt>
<dd>square adjacency matrix of a signed graph</dd>
<dt>mode</dt>
<dd>Character scalar, specifies how to interpret the supplied matrix. Possible values are: directed, undirected</dd>
<dt>...</dt>
<dd>additional parameters for <code>from_adjacency()</code></dd></dl>

Arguments

Create signed graphs from adjacency matrices — graph_from_adjacency_matrix_signed

<dl>

<dt>A</dt>
<dd>square adjacency matrix of a signed graph</dd>


<dt>mode</dt>
<dd>Character scalar, specifies how to interpret the supplied matrix. Possible values are: directed, undirected</dd>


<dt>...</dt>
<dd>additional parameters for <code>from_adjacency()</code></dd>

</dl>

graph_from_adjacency_matrix_signed: Create signed graphs from adjacency matrices

Description

Usage

Value

Arguments

Examples