A probabilistic interpretation of the Macdonald polynomials
From MaRDI portal
(Redirected from Publication:690866)
Abstract: The two-parameter Macdonald polynomials are a central object of algebraic combinatorics and representation theory. We give a Markov chain on partitions of k with eigenfunctions the coefficients of the Macdonald polynomials when expanded in the power sum polynomials. The Markov chain has stationary distribution a new two-parameter family of measures on partitions, the inverse of the Macdonald weight (rescaled). The uniform distribution on permutations and the Ewens sampling formula are special cases. The Markov chain is a version of the auxiliary variables algorithm of statistical physics. Properties of the Macdonald polynomials allow a sharp analysis of the running time. In natural cases, a bounded number of steps suffice for arbitrarily large k.
Recommendations
Cites work
- scientific article; zbMATH DE number 431548 (Why is no real title available?)
- scientific article; zbMATH DE number 108655 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- scientific article; zbMATH DE number 1069282 (Why is no real title available?)
- scientific article; zbMATH DE number 1957500 (Why is no real title available?)
- scientific article; zbMATH DE number 1963972 (Why is no real title available?)
- scientific article; zbMATH DE number 1782878 (Why is no real title available?)
- scientific article; zbMATH DE number 1857668 (Why is no real title available?)
- A Markov chain on the symmetric group and Jack symmetric functions
- A combinatorial formula for Macdonald polynomials
- A combinatorial formula for Macdonald polynomials
- A combinatorial formula for nonsymmetric Macdonald polynomials
- A recursion and a combinatorial formula for Jack polynomials
- A variational problem for random Young tableaux
- Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
- Asymptotics of Plancherel measures for symmetric groups
- Bayesian nonparametrics
- Breakthroughs in the theory of Macdonald polynomials
- Cherednik algebras, Macdonald polynomials and combinatorics
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula
- Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
- Ergodicity of multiplicative statistics
- Generating a random permutation with random transpositions
- Harmonic analysis on finite groups. Representation theory, Gelfand pairs and Markov chains
- Infinite wedge and random partitions
- Logarithmic combinatorial structures: A probabilistic approach
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Markov Chains
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- On the distribution of large prime divisors
- On the quotient ring by diagonal invariants.
- Orthogonal polynomials associated with root systems
- Quantum \({\mathcal W}_ N\) algebras and Macdonald polynomials
- Quantum probability and spectral analysis of graphs. With a foreword by Professor Luigi Accardi.
- Random Fragmentation and Coagulation Processes
- Random matrix theory over finite fields
- Random permutations and related topics
- Random permutations with cycle weights
- Random walks on trees and matchings
- Some combinatorial properties of Jack symmetric functions
- Statistical mechanics of combinatorial partitions, and their limit shapes
- The Poisson-Dirichlet law is the unique invariant distribution for uniform split-merge transfor\-mations.
- The Structure of Random Partitions of Large Integers
- The sampling theory of neutral alleles and an urn model in population genetics
- The uses of random partitions
Cited in
(16)- Hierarchical species sampling models
- Mixing time of Metropolis chain based on random transposition walk converging to multivariate Ewens distribution
- Macdonald polynomials and extended Gelfand-Tsetlin graph
- Macdonald cumulants, \(G\)-inversion polynomials and \(G\)-parking functions
- From multiline queues to Macdonald polynomials via the exclusion process
- Shannon information entropy, soliton clusters and Bose-Einstein condensation in log gravity
- From Macdonald polynomials to a charge statistic beyond type \(A\)
- Generalized energy statistics and Kostka-Macdonald polynomials
- The ubiquitous Ewens sampling formula
- Integrable probability: from representation theory to MacDonald processes
- A generating function approach to counting theorems for square-free polynomials and maximal tori
- Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
- qRSt: a probabilistic Robinson-Schensted correspondence for Macdonald polynomials
- Hahn polynomials and the Burnside process
- A Markov chain on the symmetric group that is Schubert positive?
- Commutation relations and Markov chains
This page was built for publication: A probabilistic interpretation of the Macdonald polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690866)
