runif.permutation

Generate a collection of n permutations uniformly at random

Includes functions to work with the Mallows and Generalized Mallows
Models. The considered distances are Kendall's-tau, Cayley, Hamming and Ulam
and it includes functions for making inference, sampling and learning such
distributions, some of which are novel in the literature. As a by-product,
PerMallows also includes operations for permutations, paying special attention
to those related with the Kendall's-tau, Cayley, Ulam and Hamming distances. It
is also possible to generate random permutations at a given distance, or with
a given number of inversions, or cycles, or fixed points or even with a given
length on LIS (longest increasing subsequence).

Ekhine Irurozki

PerMallows

Permutations and Mallows Distributions

Borja Calvo

runif.permutation function

<dl><dt>n</dt>
<dd>optional number of permutations to generate</dd>
<dt>perm.length</dt>
<dd>length of the permutations generated</dd></dl>

Arguments

Random permutation — runif.permutation

<dl>

<dt>n</dt>
<dd>optional number of permutations to generate</dd>


<dt>perm.length</dt>
<dd>length of the permutations generated</dd>

</dl>

runif.permutation: Random permutation

Description

Usage

Value

Arguments

Examples