count.perms.unfixed.points.gtet

perm.length

unfixed

Given the number of items in the permutations and the
number of unfixed points u, how many permutations are there
with at least u unfixed points?

This package includes functions to work with the Mallows, Generalized Mallows and Weighted 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 in those related with the Kendall's-$\tau$, Cayley, Ulam and Hamming distances and the random generation of permutations.

count.perms.unfixed.points.gtet: Count permutations with at least a given number of unfixed points

Description

Usage

Arguments

Value

Examples