Statistical problems involving permutations with restricted positions
From MaRDI portal
Recommendations
- Sequential Monte-Carlo methods for permutations tests on truncated data
- The asymptotic theory of permutation statistics.
- Statistical problems on random permutations with censored data
- Some problems of the theory of enumerating the permutations with restricted positions
- Permutation Tests for Linear Models
Cited in
(29)- Efficient generation of random derangements with the expected distribution of cycle lengths
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
- Testing independence of bivariate censored data using random walk on restricted permutation graph
- Permutation procedures with censored data
- Generalized rook polynomials
- Graph classes and the switch Markov chain for matchings
- Counting perfect matchings and the switch chain
- A discrete probability problem in card shuffling
- 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
- Parikh word representability of bipartite permutation graphs
- Six-vertex model with rare corners and random restricted permutations
- Testing Independence Under Biased Sampling
- Card guessing with partial feedback
- Sequential importance sampling of binary sequences
- Sequential importance sampling for estimating expectations over the space of perfect matchings
- Estimation in exponential families on permutations
- Syzygies for Metropolis base chains
- Comparison theory for Markov chains on different state spaces and application to random walk on derangements
- Quasimonotone graphs
- Improving the estimation of Kendall's tau when censoring affects only one of the variables
- Hit and run as a unifying device
- Computing expectations and marginal likelihoods for permutations
- Permanental generating functions and sequential importance sampling
- Interval graph limits
- On the permanents of circulant and degenerate Schur matrices
- Complexity of Hamiltonian cycle reconfiguration
- The Perfect Matching Reconfiguration Problem
- Random decompositions of Eulerian statistics
This page was built for publication: Statistical problems involving permutations with restricted positions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365676)
