Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Exponential inequalities for VLMC empirical trees”
Probabilistic proofs of hook length formulas involving trees.
Analysis of some statistics for increasing tree families.
Panholzer, Alois, Prodinger, Helmut (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Large deviations of Markov chains indexed by random trees
Amir Dembo, Peter Mörters, Scott Sheffield (2005)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Exponential generating functions for trees with weighted edges and labeled nodes.
Woan, Wen-jin, Tankersley, Barbara (2007)
Journal of Integer Sequences [electronic only]
Similarity:
The best bounds in a theorem of Russell Lyons.
Marchal, Philippe (1998)
Electronic Communications in Probability [electronic only]
Similarity:
Mixing time for a random walk on rooted trees.
Fulman, Jason (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Descendants in increasing trees.
Kuba, Markus, Panholzer, Alois (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Descendants in heap ordered trees or a triumph of computer algebra.
Prodinger, Helmut (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Parallel computation on 2-3-trees
W. Paul, U. Vishkin, H. Wagener (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: