On reconstructing a hidden permutation

DOI10.4230/LIPICS.APPROX-RANDOM.2014.604MaRDI QIDQ2969649zbMATH OpenFDO

Authors Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi

Publication date 22 March 2017

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2014.604

zbMATH Keywords

Mallows modelrank aggregationreconstruction

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorics in computer science (68R05) Randomized algorithms (68W20)

Recommendations

• Sorting from Noisier Samples
• Sampling and learning Mallows and generalized Mallows models under the Cayley distance
• On learning mixture models for permutations
• Mallows and generalized Mallows model for matchings
• Estimation in exponential families on permutations

Cited in

(9)

• Permutation reconstruction from a few large patterns
• Mixing of permutations by biased transpositions
• Permutation reconstruction from minors
• Reconstructing convex permutominoes
• On learning mixture models for permutations
• scientific article; zbMATH DE number 7758305 (Why is no real title available?)
• Iterated decomposition of biased permutations via new bounds on the spectral gap of Markov chains
• Approximate maximum rank aggregation: beyond the worst-case
• Reconstructing permutations from identification minors

This page was built for publication: On reconstructing a hidden permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969649)