Some probabilistic trees with algebraic roots (Q286127)

From MaRDI portal
Revision as of 00:18, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references