Computing expectations and marginal likelihoods for permutations

DOI10.1007/s00180-019-00901-2zbMath1482.62018OpenAlexW2952390021WikidataQ127703419 ScholiaQ127703419MaRDI QIDQ782657

Paul A. Smith, Ben Powell

Publication date: 28 July 2020

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00180-019-00901-2

zbMATH Keywords

random permutationobject trackingmatrix permanentidentity resolutionlinkage error

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Related Items (1)

expperm

Uses Software

• R
• lpSolve
• microbenchmark
• permute
• permutations
• pspearman
• BigMatch

Cites Work

• The complexity of computing the permanent
• The coolest way to generate combinations
• Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
• Bootstrap methods for stationary functional time series
• Regression analysis under incomplete linkage
• Approximating the Permanent with Fractional Belief Propagation
• Data Quality and Record Linkage Techniques
• A new algorithm for the assignment problem
• A Method for Calibrating False-Match Rates in Record Linkage
• A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
• Statistical problems involving permutations with restricted positions
• Permutations by Interchanges
• Regression Analysis With Linked Data
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing expectations and marginal likelihoods for permutations