The following pages link to (Q3138330):
Displaying 23 items.
- The cutoff phenomenon for Ehrenfest chains (Q436294) (← links)
- Separation cutoffs for random walk on irreducible representations (Q659593) (← links)
- A probabilistic interpretation of the Macdonald polynomials (Q690866) (← links)
- Stein's method, Jack measure, and the Metropolis algorithm (Q703689) (← links)
- The top-degree part in the matchings-Jack conjecture (Q831344) (← links)
- Separation cut-offs for birth and death chains (Q997420) (← links)
- Commutation relations and Markov chains (Q1017898) (← links)
- What do we know about the Metropolis algorithm? (Q1273859) (← links)
- To the Latimer-Macduffee theorem and beyond! (Q1307514) (← links)
- Hypergroup deformations and Markov chains (Q1337951) (← links)
- A geometric interpretation of the Metropolis-Hastings algorithm. (Q1431212) (← links)
- The Poisson-Dirichlet law is the unique invariant distribution for uniform split-merge transfor\-mations. (Q1879873) (← links)
- Asymptotics of Jack characters (Q2000644) (← links)
- The \(L^{2}\)-cutoff for reversible Markov processes (Q2269684) (← links)
- Mixing time of Metropolis chain based on random transposition walk converging to multivariate Ewens distribution (Q2346083) (← links)
- Bijection between oriented maps and weighted non-oriented maps (Q2363698) (← links)
- First hitting time analysis of the independence Metropolis sampler (Q2433963) (← links)
- Convergence rates of random walk on irreducible representations of finite groups (Q2481391) (← links)
- On adding a list of numbers (and other one-dependent determinantal processes) (Q3161732) (← links)
- Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286) (← links)
- Fundamental weight systems are quantum states (Q6084861) (← links)
- Random walks generated by the Ewens distribution on the symmetric group (Q6088379) (← links)
- Mixing reversible Markov chains in the max-\(\ell^2\)-distance (Q6634823) (← links)
