Most actions on regular trees are almost free. (Q1016446)

From MaRDI portal
Revision as of 11:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Most actions on regular trees are almost free.
scientific article

    Statements

    Most actions on regular trees are almost free. (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2009
    0 references
    Summary: Let \(T\) be a \(d\)-regular tree (\(d\geq 3\)) and \(A=\Aut(T)\) its automorphism group. Let \(\Gamma\) be the group generated by \(n\) independent Haar-random elements of \(A\). We show that almost surely, every nontrivial element of \(\Gamma\) has finitely many fixed points on \(T\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random generations
    0 references
    almost free actions
    0 references
    dense subgroups
    0 references
    Galton-Watson processes
    0 references
    random elements
    0 references
    0 references
    0 references