Explicit formulas for hook walks on continual Young diagrams
From MaRDI portal
Publication:1883409
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.
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
Cites work
- scientific article; zbMATH DE number 3561857 (Why is no real title available?)
- scientific article; zbMATH DE number 1303717 (Why is no real title available?)
- scientific article; zbMATH DE number 1126911 (Why is no real title available?)
- scientific article; zbMATH DE number 1857665 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- 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
- Distribution functions of means of a Dirichlet process
- On growing a random Young tableau
- Transition probabilities for continual Young diagrams and the Markov moment problem
Cited in
(11)- Jeu de taquin dynamics on infinite Young tableaux and second class particles
- On hooks of skew Young diagrams and bars in shifted diagrams
- Transition probabilities for continual Young diagrams and the Markov moment problem
- Random distributions via sequential quantile array
- Limit shapes for random square Young tableaux
- Distributional properties of means of random probability measures
- Periodic Pólya urns, the density method and asymptotics of Young tableaux
- Second class particles and limit shapes of evacuation and sliding paths for random tableaux.
- The Karlin-McGregor formula for paths connected with a clique
- Specification of the Base Measure of Nonparametric Priors via Random Means
- Asymptotics of Young diagrams and hook numbers
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)