In mathematics, random groups are certain groups obtained by a probabilistic construction. They were introduced by Misha Gromov to answer questions such as "What does a typical group look like?" It so happens that, once a precise definition is given, random groups satisfy some properties with very high probability, whereas other properties fail with very high probability. For instance, very probably random groups are hyperbolic groups. In this sense, one can say that "most groups are hyperbolic".
Definition The definition of random groups depends on a probabilistic model on the set of possible groups. Various such probabilistic models yield different (but related) notions of random groups. Any group can be defined by a group presentation involving generators and relations. For instance, the Abelian group Z × Z {\displaystyle \mathbb {Z} \times \mathbb {Z} } has a presentation with two generators a {\displaystyle a} and b {\displaystyle b} , and the relation a b = b a {\displaystyle ab=ba} , or equivalently a b a − 1 b − 1 = 1 {\displaystyle aba^{-1}b^{-1}=1} . The main idea of random groups is to start with a fixed number of group generators a 1 , a 2 , … , a m {\displaystyle a_{1},\,a_{2},\,\ldots ,\,a_{m}} , and imposing relations of the form r 1 = 1 , r 2 = 1 , … , r k = 1 {\displaystyle r_{1}=1,\,r_{2}=1,\,\ldots ,\,r_{k}=1} where each r j {\displaystyle r_{j}} is a random word involving the letters a i {\displaystyle a_{i}} and their formal inverses a i − 1 {\displaystyle a_{i}^{-1}} . To specify a model of random groups is to specify a precise way in which m {\displaystyle m} , k {\displaystyle k} and the random relations r j {\displaystyle r_{j}} are chosen. Once the random relations r k {\displaystyle r_{k}} have been chosen, the resulting random group G {\displaystyle G} is defined in the standard way for group presentations, namely: G {\displaystyle G} is the quotient of the free group F m {\displaystyle F_{m}} with generators a 1 , a 2 , … , a m {\displaystyle a_{1},\,a_{2},\,\ldots ,\,a_{m}} , by the normal subgroup R ⊂ F m {\displaystyle R\subset F_{m}} generated by the relations r 1 r 2 , … , r k {\displaystyle r_{1}\,r_{2},\,\ldots ,\,r_{k}} seen as elements of F m {\displaystyle F_{m}} :
G = F m / ⟨ r 1 , r 2 , … , r k ⟩ . {\displaystyle G=F_{m}/\langle r_{1},\,r_{2},\,\ldots ,\,r_{k}\rangle .}
… excerpt ends here. Continue reading the full article.
