twoLevelGraph

Initially, edges are added from the first vertex to all the other
vertices. Thereafter, the first vertex is drawn from a Beta(shape1,
1.0) distribution and the second vertex is drawn from a
Beta(shape2, 1.0) distribution. The idea is that the edges will
tend to connect a small subset of vertices from the top of the tree
to leaf vertices. These vertex connections are similar to the pairs
that you might observe in an elimination tournament. The selected
vertices are sorted so it doesn't matter whether <code>shape1 &gt;
shape2</code> or <code>shape1 &lt; shape2</code>.

Provides convenience functions and pre-programmed
Stan models related to the paired comparison factor model. Its purpose
is to make fitting paired comparison data using Stan easy. This
package is described in Pritikin (2020) <doi:10.1016/j.heliyon.2020.e04821>.

Joshua Pritikin

pcFactorStan

Stan Models for the Paired Comparison Factor Model

Daniel C. Furr

Trustees of Columbia University 

twoLevelGraph function

<dl><dt>name</dt>
<dd>vector of vertex names</dd>
<dt>N</dt>
<dd>number of comparisons</dd>
<dt>shape1</dt>
<dd>beta distribution parameter for first edge</dd>
<dt>shape2</dt>
<dd>beta distribution parameter for second edge</dd></dl>

Arguments

Create an edge list with a random two level connectivity — twoLevelGraph

<dl>

<dt>name</dt>
<dd>vector of vertex names</dd>


<dt>N</dt>
<dd>number of comparisons</dd>


<dt>shape1</dt>
<dd>beta distribution parameter for first edge</dd>


<dt>shape2</dt>
<dd>beta distribution parameter for second edge</dd>

</dl>

twoLevelGraph: Create an edge list with a random two level connectivity

Description

Usage

Value

Arguments

See Also

Examples