Nothing
Deciphering hierarchy of agents exhibiting observable dominance events is a crucial problem in several disciplines, in particular in behavioural analysis of social animals, but also in social sciences and game theory. This package implements an inference approach based on graph theory, namely to extract the optimal acyclic subset of a weighted graph of dominance; this allows for hierarchy estimation through topological sorting. The package also contains infrastructure to investigate partially defined hierarchies and hierarchy dynamics.
Package details |
|
---|---|
Author | Miron B. Kursa [aut, cre] (ORCID: <https://orcid.org/0000-0001-7672-648X>) |
Maintainer | Miron B. Kursa <m@mbq.me> |
License | GPL-3 |
Version | 1.0.0 |
URL | https://gitlab.com/mbq/toporanga |
Package repository | View on CRAN |
Installation |
Install the latest version of this package by entering the following in R:
|
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.