Most actions on regular trees are almost free. (Q1016446): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963865708 / rank | |||
Normal rank |
Latest revision as of 10:32, 30 July 2024
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
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
random generations
0 references
almost free actions
0 references
dense subgroups
0 references
Galton-Watson processes
0 references
random elements
0 references