Some probabilistic trees with algebraic roots (Q286127)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6583073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some probabilistic trees with algebraic roots |
scientific article; zbMATH DE number 6583073 |
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
0.7570715546607971
0 references
0.7538880109786987
0 references
0.7525731325149536
0 references
0.7513620257377625
0 references
0.7488895654678345
0 references
