Computing expectations and marginal likelihoods for permutations

Research output: Contribution to journalArticlepeer-review


This paper demonstrates how we can re-purpose sophisticated algorithms from a range of fields to help us compute expected permutations
and marginal likelihoods. The results are of particular use in the fields of
record linkage or identity resolution, where we are interested in finding pairs
of records across data sets that refer to the same individual. All calculations
discussed can be reproduced with the accompanying R package expperm.
Original languageEnglish
Number of pages21
JournalComputational Statistics
Early online date12 Jun 2019
Publication statusPublished - 12 Jun 2019

Bibliographical note

© The Author(s) 2019


  • Identity resolution
  • Linkage error
  • Matrix permanent
  • Object tracking
  • Random permutation

Cite this