From continuous to discrete: a No-U-Turn Sampler for permutations
From MaRDI portal
Cites work
- A Rate for the Erdős-Turán Law
- Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
- Bayesian Analysis of Binary and Polychotomous Response Data
- Bayesian Inference for Logistic Models Using Pólya–Gamma Latent Variables
- Comparison theorems for reversible Markov chains
- Estimation in exponential families on permutations
- Fixed points and cycle structure of random permutations
- Generating a random permutation with random transpositions
- GIST: Gibbs self-tuning for locally adaptive Hamiltonian Monte Carlo
- Hit and run as a unifying device
- scientific article; zbMATH DE number 431548 (Why is no real title available?)
- Limit theorems for fixed point biased permutations avoiding a pattern of length three
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- MCMC using Hamiltonian dynamics
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- On some problems of a statistical group-theory. I
- Optimum Monte-Carlo sampling using Markov chains
- Path coupling: a technique for proving rapid mixing in Markov chains
- Poisson process approximations for the Ewens sampling formula
- Probabilistic preference learning with the Mallows rank model
- The Calculation of Posterior Distributions by Data Augmentation
- The no-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
- What do we know about the Metropolis algorithm?
This page was built for publication: From continuous to discrete: a No-U-Turn Sampler for permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356865)
