Some probabilistic trees with algebraic roots
From MaRDI portal
(Redirected from Publication:286127)
Abstract: In this article we consider several probabilistic processes defining random grapha. One of these processes appeared recently in connection with a factorization problem in the symmetric group. For each of the probabilistic processes, we prove that the probability for the random graph to be a tree has an extremely simple expression, which is independent of most parameters of the problem. This raises many open questions.
Recommendations
Cites work
Cited in
(5)- Factorization problems in complex reflection groups
- Bijections and symmetries for the factorizations of the long cycle
- Factorization problems in complex reflection groups
- \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group
- Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
This page was built for publication: Some probabilistic trees with algebraic roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286127)