Explicit formulas for hook walks on continual Young diagrams

DOI10.1016/S0196-8858(03)00096-4zbMATH Open1051.05080arXivmath/0303376OpenAlexW2037057570MaRDI QIDQ1883409FDOQ1883409

Authors: Dan Romik 

Publication date: 12 October 2004

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: We consider, following the work of S. Kerov, random walks which are continuous-space generalizations of the Hook Walks defined by Greene-Nijenhuis-Wilf, performed under the graph of a continual Young diagram. The limiting point of these walks is a point on the graph of the diagram. We present several explicit formulas giving the probability densities of these limiting points in terms of the shape of the diagram. This partially resolves a conjecture of Kerov concerning an explicit formula for the so-called Markov transform. We also present two inverse formulas, reconstructing the shape of the diagram in terms of the densities of the limiting point of the walks. One of these two formulas can be interepreted as an inverse formula for the Markov transform. As a corollary, some new integration identities are derived.

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

Recommendations

• Transition probabilities for continual Young diagrams and the Markov moment problem
• Expected lengths and distribution functions for Young diagrams in the hook
• Another probabilistic method in the theory of Young tableaux
• A \(q\)-analog of the hook walk algorithm and random Young tableaux
• scientific article; zbMATH DE number 1857665

zbMATH Keywords

Markov transformContinual Young diagramsHook walkTransition measure

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial aspects of representation theory (05E10)

Cites Work

• Title not available (Why is that?)
• Distribution functions of means of a Dirichlet process
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transition probabilities for continual Young diagrams and the Markov moment problem
• Title not available (Why is that?)
• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• Another probabilistic method in the theory of Young tableaux
• Title not available (Why is that?)
• On growing a random Young tableau

Cited In (10)

• Jeu de taquin dynamics on infinite Young tableaux and second class particles
• Limit shapes for random square Young tableaux
• Transition probabilities for continual Young diagrams and the Markov moment problem
• Asymptotics of Young diagrams and hook numbers
• Distributional properties of means of random probability measures
• Second class particles and limit shapes of evacuation and sliding paths for random tableaux.
• Random distributions via sequential quantile array
• On hooks of skew Young diagrams and bars in shifted diagrams
• Periodic Pólya urns, the density method and asymptotics of Young tableaux
• Specification of the Base Measure of Nonparametric Priors via Random Means

This page was built for publication: Explicit formulas for hook walks on continual Young diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883409)