Displaying similar documents to “A discrete theory of search. II”

The square model for random groups

Tomasz Odrzygóźdź (2016)

Colloquium Mathematicae

Similarity:

We introduce a new random group model called the square model: we quotient a free group on n generators by a random set of relations, each of which is a reduced word of length 4. We prove that, just as in the Gromov model, for densities > 1/2 a random group in the square model is trivial with overwhelming probability and for densities < 1/2 a random group is hyperbolic with overwhelming probability. Moreover, we show that for densities d < 1/3 a random group in the square model...