sample_gnp_signed

Generate random signed graphs according to the G(n,p) Erdos-Renyi model

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

sample_gnp_signed function

<dl><dt>n</dt>
<dd>The number of vertices in the graph.</dd>
<dt>p</dt>
<dd>The probability for drawing an edge between two arbitrary vertices.</dd>
<dt>p_neg</dt>
<dd>The probability of a drawn edge to be a negative tie</dd>
<dt>directed</dt>
<dd>logical, whether the graph will be directed. defaults to FALSE.</dd>
<dt>loops</dt>
<dd>logical, whether to add loop edges, defaults to FALSE.</dd></dl>

Arguments

Generate random signed graphs according to the G(n,p) Erdos-Renyi model — sample_gnp_signed

<dl>

<dt>n</dt>
<dd>The number of vertices in the graph.</dd>


<dt>p</dt>
<dd>The probability for drawing an edge between two arbitrary vertices.</dd>


<dt>p_neg</dt>
<dd>The probability of a drawn edge to be a negative tie</dd>


<dt>directed</dt>
<dd>logical, whether the graph will be directed. defaults to FALSE.</dd>


<dt>loops</dt>
<dd>logical, whether to add loop edges, defaults to FALSE.</dd>

</dl>

sample_gnp_signed: Generate random signed graphs according to the G(n,p) Erdos-Renyi model

Description

Usage

Value

Arguments

References

Examples