Description Usage Arguments Functions
Helper functions for ego centric network analysis
1 2 3 4 5 6 7 8 9 | dyad.poss(max.alteri, directed = F)
sanitize.wide.edges(max.alteri)
create.edge.names.wide(x)
dyads.possible.between.groups(x, y)
din.page.dist(x)
|
max.alteri |
A |
directed |
A |
x |
|
y |
|
dyad.poss
: Returns the count of possible edges in an
undirected or directed, ego-centered network, based on the number of alteri.
sanitize.wide.edges
: Generates a data.frame
marking possible dyads in
a wide alter-alter relation data.frame
. Row names corresponds to the
network size. This is useful for sanitizing alter-alter relations in the wide
format.
create.edge.names.wide
: Creates a vector
of names for variables
containing data on alter-alter relations/ dyads in ego-centered networks.
dyads.possible.between.groups
: Calculates the possible edges between members of
different groups in an ego-centered network.
din.page.dist
: Calculates the optimal distribution of a number of
equally sized objects on a DIN-Norm DIN 476 (i.e. DIN A4) page in landscape
view.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.