as_adj_complex

This function returns the adjacency matrix for a signed graph that contains ambivalent ties

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

as_adj_complex function

<dl><dt>g</dt>
<dd>igraph object</dd>
<dt>attr</dt>
<dd>edge attribute name that encodes positive ("P"), negative ("N") and ambivalent ("A") ties.</dd></dl>

Arguments

Convert a signed graph to a complex adjacency matrix — as_adj_complex

<dl>

<dt>g</dt>
<dd>igraph object</dd>


<dt>attr</dt>
<dd>edge attribute name that encodes positive ("P"), negative ("N") and ambivalent ("A") ties.</dd>

</dl>

as_adj_complex: Convert a signed graph to a complex adjacency matrix

Description

Usage

Value

Arguments

See Also