Some probabilistic trees with algebraic roots (Q286127): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Bijections and symmetries for the factorizations of the long cycle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some combinatorial problems associated with products of conjugacy classes of the symmetric group / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Branched Polymers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A combinatorial approach to matrix algebra / rank | |||
Normal rank | |||
Latest revision as of 00:18, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some probabilistic trees with algebraic roots |
scientific article |
Statements
Some probabilistic trees with algebraic roots (English)
0 references
20 May 2016
0 references
Summary: We consider several probabilistic processes defining a random graph. One of these processes appeared recently in connection with a factorization problem in the symmetric group. For each process, we prove that the probability for the random graph to be a tree has an unexpectedly simple expression, which is independent of most parameters of the problem. This raises many open questions.
0 references
branched polymers
0 references
random graphs
0 references
random trees
0 references
matrix-tree theorem
0 references
