- x
count; the number of nodes in the network
- directed
logical; should edges be interpreted as directed?
- hyper
logical; are hyperedges allowed? Currently ignored.
- loops
logical; should loops be allowed? Currently ignored.
- multiple
logical; are multiplex edges allowed? Currently ignored.
- bipartite
count; should the network be interpreted as bipartite? If
present (i.e., non-NULL) it is the count of the number of actors in the
bipartite network. In this case, the number of nodes is equal to the number
of actors plus the number of events (with all actors preceding all events).
The edges are then interpreted as nondirected.
- ignore.eval
logical; ignore edge values? Currently ignored.
- names.eval
optionally, the name of the attribute in which edge values
should be stored. Currently ignored.
- edge.check
logical; perform consistency checks on new edges?
- density
numeric; the probability of a tie for Bernoulli networks. If
neither density nor init
is given, it defaults to the number of nodes
divided by the number of dyads (so the expected number of ties is the same
as the number of nodes.)
- init
numeric; the log-odds of a tie for Bernoulli networks. It is
only used if density is not specified.
- numedges
count; if present, sample the Bernoulli network conditional
on this number of edges (rather than independently with the specified
probability).
- ...
additional arguments