states


Dataframe showing the transitivity and intransitivity of each
of the four triads, the number of nodes,
the number of edges, the number of other individuals dominated
by the top-ranked individual, the mean distance of the network
and the maximum difference between out-degree and in-degrees,
in a four node network. Also gives the class of each state.


datasets

Determine paths and states that social networks develop over
time to form social hierarchies. Based upon algorithms described in
W. Brent Lindquist & Ivan D. Chase (2009) <DOI:10.1007/s11538-008-9371-9>.

James Curley

hierformR

Analysis of Dynamics Hierarchy Formation

states function

A data frame with 41 rows and 14 variables:
<dl>
  <dt>X003</dt><dd>Number of unconnected nodes</dd> <dt>X012</dt><dd>Number of triads with one single directed edge</dd> <dt>X021D</dt><dd>Number of triads with 2 edges going down</dd> <dt>X021U</dt><dd>Number of triads with 2 edges going up</dd> <dt>X021C</dt><dd>Number of triads with 2 edges that could be transitive/intransitive</dd> <dt>X030T</dt><dd>Number of transitive triads</dd> <dt>X030C</dt><dd>Number of intransitive triads</dd> <dt>maxdom</dt><dd>Number of individuals dominated by top ranked individual</dd> <dt>noedges</dt><dd>Number of edges in network</dd> <dt>nonodes</dt><dd>Number of nodes in network</dd> <dt>distance</dt><dd>Mean distance of the network</dd> <dt>degreediff</dt><dd>Max difference between each nodes out-degree and in-degree</dd> <dt>id</dt><dd>The id of the network</dd> <dt>class</dt><dd>The class of the network</dd> </dl>

states: Characteristics of 41 network states for 4 node graphs

Description

Usage

Arguments

Format