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 ${\displaystyle \mathbb {Z} \times \mathbb {Z} }$  has a presentation with two generators ${\displaystyle a}$  and ${\displaystyle b}$ , and the relation ${\displaystyle ab=ba}$ , or equivalently ${\displaystyle aba^{-1}b^{-1}=1}$ . The main idea of random groups is to start with a fixed number of group generators ${\displaystyle a_{1},\,a_{2},\,\ldots ,\,a_{m}}$ , and imposing relations of the form ${\displaystyle r_{1}=1,\,r_{2}=1,\,\ldots ,\,r_{k}=1}$  where each ${\displaystyle r_{j}}$  is a random word involving the letters ${\displaystyle a_{i}}$  and their formal inverses ${\displaystyle a_{i}^{-1}}$ . To specify a model of random groups is to specify a precise way in which ${\displaystyle m}$ , ${\displaystyle k}$  and the random relations ${\displaystyle r_{j}}$  are chosen.

Once the random relations ${\displaystyle r_{k}}$  have been chosen, the resulting random group ${\displaystyle G}$  is defined in the standard way for group presentations, namely: ${\displaystyle G}$  is the quotient of the free group ${\displaystyle F_{m}}$  with generators ${\displaystyle a_{1},\,a_{2},\,\ldots ,\,a_{m}}$ , by the normal subgroup ${\displaystyle R\subset F_{m}}$  generated by the relations ${\displaystyle r_{1}\,r_{2},\,\ldots ,\,r_{k}}$  seen as elements of ${\displaystyle F_{m}}$ :

${\displaystyle G=F_{m}/\langle r_{1},\,r_{2},\,\ldots ,\,r_{k}\rangle .}$ 

The simplest model of random groups is the few-relator model. In this model, a number of generators ${\displaystyle m\geq 2}$  and a number of relations ${\displaystyle k\geq 1}$  are fixed. Fix an additional parameter ${\displaystyle \ell }$  (the length of the relations), which is typically taken very large.

Then, the model consists in choosing the relations ${\displaystyle r_{1}\,r_{2},\,\ldots ,\,r_{k}}$  at random, uniformly and independently among all possible reduced words of length at most ${\displaystyle \ell }$  involving the letters ${\displaystyle a_{i}}$  and their formal inverses ${\displaystyle a_{i}^{-1}}$ .

This model is especially interesting when the relation length ${\displaystyle \ell }$  tends to infinity: with probability tending to ${\displaystyle 1}$  as ${\displaystyle \ell \to \infty }$  a random group in this model is hyperbolic and satisfies other nice properties.

More refined models of random groups have been defined.

For instance, in the density model, the number of relations is allowed to grow with the length of the relations. Then there is a sharp "phase transition" phenomenon: if the number of relations is larger than some threshold, the random group "collapses" (because the relations allow to show that any word is equal to any other), whereas below the threshold the resulting random group is infinite and hyperbolic.

Constructions of random groups can also be twisted in specific ways to build groups with particular properties. For instance, Gromov used this technique to build new groups that are counter-examples to an extension of the Baum–Connes conjecture.

• Mikhail Gromov. Hyperbolic groups. Essays in group theory, 75–263, Math. Sci. Res. Inst. Publ., 8, Springer, New York, 1987.
• Mikhail Gromov. "Random walk in random groups." Geom. Funct. Anal., vol. 13 (2003), 73–146.