as_incidence_complex function

Complex Incidence Matrix

Complex Incidence Matrix

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

as_incidence_complex(g, attr)

Arguments

  • g: igraph object.
  • attr: edge attribute name that encodes positive ("P"), negative ("N") and ambivalent ("A") ties.

Returns

a complex matrix

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∈Cn,mS \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

Si(i,j)=Aij S_{i(i,j)}=\sqrt{A_{ij}} Sj(i,j)=−Ajiif(i,j)isanambivalenttie S_{j(i,j)}=-\sqrt{A_{ji}} if (i,j) is an ambivalent tie Sj(i,j)=−AjiAjielse S_{j(i,j)}=-A_{ji}\sqrt{A_{ji}} else

See Also

laplacian_matrix_complex ,as_adj_complex

Author(s)

David Schoch

signnet packageRead PDF manual
  • Maintainer: David Schoch
  • License: MIT + file LICENSE
  • Last published: 2025-02-05

Useful links