Statistical problems involving permutations with restricted positions

DOI10.1214/lnms/1215090070zbMath1373.62176OpenAlexW1489201621WikidataQ58803821 ScholiaQ58803821MaRDI QIDQ5365676

Susan P. Holmes, Persi Diaconis, Ronald L. Graham

Publication date: 9 October 2017

Published in: State of the art in probability and statistics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.lnms/1215090070

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Nonparametric statistical resampling methods (62G09) Permutations, words, matrices (05A05) Determinants, permanents, traces, other special matrix functions (15A15)

Related Items

Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs, Card guessing with partial feedback, Complexity of Hamiltonian cycle reconfiguration, Parikh word representability of bipartite permutation graphs, Sequential importance sampling for estimating expectations over the space of perfect matchings, Testing Independence Under Biased Sampling, Testing independence of bivariate censored data using random walk on restricted permutation graph, Hit and run as a unifying device, Comparison theory for Markov chains on different state spaces and application to random walk on derangements, Syzygies for Metropolis base chains, Efficient generation of random derangements with the expected distribution of cycle lengths, Interval graph limits, Sequential Importance Sampling for Estimating the Number of Perfect Matchings in Bipartite Graphs: An Ongoing Conversation with Laci, The mixing time of switch Markov chains: a unified approach, On the permanents of circulant and degenerate Schur matrices, Permutation procedures with censored data, Estimation in exponential families on permutations, Permanental generating functions and sequential importance sampling, Quasimonotone graphs, Graph classes and the switch Markov chain for matchings, A discrete probability problem in card shuffling, Sequential importance sampling of binary sequences, Improving the estimation of Kendall's tau when censoring affects only one of the variables, The Perfect Matching Reconfiguration Problem, Counting Perfect Matchings and the Switch Chain, Computing expectations and marginal likelihoods for permutations, Generalized rook polynomials, Random decompositions of Eulerian statistics