Turn adjacency matrices or edgelists into static or dynamic signed networks.
network.sign(
mat = NULL,
pos.mat = NULL,
neg.mat = NULL,
directed = FALSE,
loops = FALSE,
matrix.type = c("adjacency", "edgelist"),
vertex.names = NULL,
vertex.attr = NULL,
dual.sign = FALSE,
timepoints = NULL,
tie.breaker = c("zero", "positive", "negative", "first", "last"),
...
)A signed network of class `static.sign` or `dynamic.sign`.
(List of) signed adjacency matrices or edgelists. For dynamic networks, provide a list. Adjacency matrices must contain only -1, 0, or 1. Edgelists must have three columns: "From", "To", and "Sign".
Optional. Positive adjacency matrix or list of matrices.
Optional. Negative adjacency matrix or list of matrices. If provided, these are treated as two separate layers of the same network.
Logical; should edges be interpreted as directed? Defaults to FALSE.
Logical; should loops be allowed? Defaults to FALSE.
Either "adjacency" or "edgelist".
Optional. A vector or list of vertex names.
Optional. Additional vertex attributes.
Logical. Allow positive and negative edges simultaneously between the same pair.
Optional. Pooling definition for dynamic networks.
How to resolve ties when pooling signed matrices.
Additional arguments passed to `network::network`.