lastnetN: Get network for last N interactions between each pair of...
In jalapic/hierformR: Analysis of Dynamics Hierarchy Formation
Description
Usage
Arguments
Value
Examples
Description
Get network for last N interactions between each pair of nodes
Usage
1
Arguments
df
a dataframe with two variables, winners and losers
N
the number of last interactions to get
all
If = FALSE then generates network based on one
directed edge with clear winner being individual with highest wins from
last N interactions between each pair. If = TRUE
then keeps uses all edges from last N interactions between each pair.
Value
a list with each element being the network object derived from the last
N interactions for each pair of nodes up to that row of the dataframe
Examples
1
jalapic/hierformR documentation built on May 18, 2019, 11:18 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value Examples
Description
Get network for last N interactions between each pair of nodes
Usage
1 |
Arguments
df |
a dataframe with two variables, winners and losers |
N |
the number of last interactions to get |
all |
If = |
Value
a list with each element being the network object derived from the last N interactions for each pair of nodes up to that row of the dataframe
Examples
1 |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.