Some probabilistic trees with algebraic roots

zbMath1336.05112arXiv1501.01135MaRDI QIDQ286127

Alejandro H. Morales, Olivier Bernardi

Publication date: 20 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsrandom treesmatrix-tree theorembranched polymers

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Symmetric groups (20B30)

Related Items (5)

Bijections and symmetries for the factorizations of the long cycle ⋮ \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group ⋮ Factorization problems in complex reflection groups ⋮ Factorization problems in complex reflection groups ⋮ Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson

Cites Work

• Bijections and symmetries for the factorizations of the long cycle
• A combinatorial approach to matrix algebra
• Some combinatorial problems associated with products of conjugacy classes of the symmetric group
• Branched Polymers

This page was built for publication: Some probabilistic trees with algebraic roots