as_incidence_complex {signnet}

Complex Incidence Matrix

Description

The complex incidence matrix of a signed graph containing ambivalent ties.

Usage

as_incidence_complex(g, attr)

Arguments

g

igraph object.

attr

edge attribute name that encodes positive ("P"), negative ("N") and ambivalent ("A") ties.

Details

This function is slightly different than as_incidence_matrix since it is defined for bipartite graphs. The incidence matrix here is defined as a S \in C^{n,m}, where n is the number of vertices and m the number of edges. Edges (i,j) are oriented such that i<j and entries are defined as

S_{i(i,j)}=\sqrt{A_{ij}}

S_{j(i,j)}=-\sqrt{A_{ji}} if (i,j) is an ambivalent tie

S_{j(i,j)}=-A_{ji}\sqrt{A_{ji}} else

Value

a complex matrix

Author(s)

David Schoch

See Also

laplacian_matrix_complex,as_adj_complex