Strong approximation in random towers of graphs. (Q397067)
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 6330535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong approximation in random towers of graphs. |
scientific article; zbMATH DE number 6330535 |
Statements
Strong approximation in random towers of graphs. (English)
0 references
14 August 2014
0 references
graphs
0 references
binary trees
0 references
automorphism groups
0 references
random subgroups
0 references
Schreier graphs
0 references
expander graphs
0 references
0 references
0.7826800346374512
0 references
0.7652711272239685
0 references
0.7635504603385925
0 references
0.7464308738708496
0 references
0.7445905208587646
0 references
