A probabilistic interpretation of the Macdonald polynomials

DOI10.1214/11-AOP674zbMATH Open1255.05194arXiv1007.4779MaRDI QIDQ690866FDOQ690866

Authors: Persi Diaconis, Arun Ram 

Publication date: 29 November 2012

Published in: The Annals of Probability (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1007.4779

Recommendations

• The genesis of the Macdonald polynomial statistic
• A combinatorial model for the Macdonald polynomials
• Macdonald polynomials and extended Gelfand-Tsetlin graph
• On combinatorial formulas for MacDonald polynomials
• Modified Macdonald polynomials and the multispecies zero-range process. I

zbMATH Keywords

Markov chainrates of convergenceMacdonald polynomialsrandom permutationsauxiliary variablesmeasures on partitions

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)

Cites Work

• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Some combinatorial properties of Jack symmetric functions
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Quantum \({\mathcal W}_ N\) algebras and Macdonald polynomials
• Generating a random permutation with random transpositions
• Title not available (Why is that?)
• Bayesian nonparametrics
• A combinatorial formula for nonsymmetric Macdonald polynomials
• Title not available (Why is that?)
• A combinatorial formula for Macdonald polynomials
• Random Fragmentation and Coagulation Processes
• A combinatorial formula for Macdonald polynomials
• Statistical mechanics of combinatorial partitions, and their limit shapes
• A Markov chain on the symmetric group and Jack symmetric functions
• A recursion and a combinatorial formula for Jack polynomials
• Logarithmic combinatorial structures: A probabilistic approach
• Orthogonal polynomials associated with root systems
• Title not available (Why is that?)
• Markov Chains
• Title not available (Why is that?)
• Title not available (Why is that?)
• A variational problem for random Young tableaux
• Random matrix theory over finite fields
• The uses of random partitions
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Asymptotics of Plancherel measures for symmetric groups
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• Quantum probability and spectral analysis of graphs. With a foreword by Professor Luigi Accardi.
• Title not available (Why is that?)
• On the distribution of large prime divisors
• Title not available (Why is that?)
• Harmonic analysis on finite groups. Representation theory, Gelfand pairs and Markov chains
• Cherednik algebras, Macdonald polynomials and combinatorics
• On the quotient ring by diagonal invariants.
• Random walks on trees and matchings
• Random permutations and related topics
• Title not available (Why is that?)
• Infinite wedge and random partitions
• Random permutations with cycle weights
• The sampling theory of neutral alleles and an urn model in population genetics
• Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula
• Ergodicity of multiplicative statistics
• The Structure of Random Partitions of Large Integers
• Title not available (Why is that?)
• The Poisson-Dirichlet law is the unique invariant distribution for uniform split-merge transfor\-mations.
• Breakthroughs in the theory of Macdonald polynomials

Cited In (16)

• 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
• Shannon information entropy, soliton clusters and Bose-Einstein condensation in log gravity
• From multiline queues to Macdonald polynomials via the exclusion process
• Generalized energy statistics and Kostka-Macdonald polynomials
• From Macdonald polynomials to a charge statistic beyond type \(A\)
• The ubiquitous Ewens sampling formula
• Integrable probability: from representation theory to MacDonald processes
• Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
• A generating function approach to counting theorems for square-free polynomials and maximal tori
• 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
• Hierarchical species sampling models

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)