Most actions on regular trees are almost free. (Q1016446)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Most actions on regular trees are almost free. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8462832570075989
0 references
0.8388152122497559
0 references
0.7925133109092712
0 references
0.7904677391052246
0 references
0.7826800346374512
0 references
