laplacian_angle

Computes the angle between eigenvectors of the signed or complex Laplacian.

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

laplacian_angle function

<dl><dt>g</dt>
<dd>input graph. Must have a sign edge attribute</dd>
<dt>type</dt>
<dd>string. either "sign" for signed Laplacian or "complex" for complex Laplacian. Defaults to "sign"</dd>
<dt>...</dt>
<dd>additional parameters for Laplacian matrix such as the attribute containing "P","N" and "A" for the complex Laplacian</dd></dl>

Arguments

Author

Angle between Eigenvectors — laplacian_angle

<dl>

<dt>g</dt>
<dd>input graph. Must have a sign edge attribute</dd>


<dt>type</dt>
<dd>string. either "sign" for signed Laplacian or "complex" for complex Laplacian. Defaults to "sign"</dd>


<dt>...</dt>
<dd>additional parameters for Laplacian matrix such as the attribute containing "P","N" and "A" for the complex Laplacian</dd>

</dl>

laplacian_angle: Angle between Eigenvectors

Description

Usage

Value

Arguments

Author

Details

Examples