Learn R Programming
⚠️There's a newer version (1.6) of this package.Take me there.

expperm (version 0.1.0)

Computing Expectations and Marginal Likelihoods for Permutations

Description

A set of functions for computing expected permutation matrices given a matrix of likelihoods for each individual assignment. It has been written to accompany the forthcoming paper 'Computing expectations and marginal likelihoods for permutations'. Publication details will be updated as soon as they are finalized.

Copy Link

Version

Install

install.packages('expperm')

Monthly Downloads

184

Version

0.1.0

License

GPL-3

Maintainer

Ben Powell

Last Published

February 8th, 2019

Functions in expperm (0.1.0)

df2

A (second) small data frame of simulated records
coollex

Computing combinations with the Coollex algorithm
df1

A small data frame of simulated records
sink

A variational approximation of an expected permutation matrix
ryser

The Ryser method for computing an expected permutation matrix
gray

Gray code enumeration
triA

A small random tridiagonal matrix
A

A small random matrix
BG

The Brualdi-Gibson method for computing an expected permutation matrix
heap

Heap's algorithm for enumerating permutations
is.tridiagonal

Checking a matrix is tridiagonal
brute

Brute-force calculation of an expected permutation matrix
contractor

Contract a tridiagonal matrix