J. M. Alonso, T. Brady, D. Cooper, V. Ferlini, M. Lustig et al., Notes on word hyperbolic groups, Group theory from a geometrical viewpoint, pp.3-63, 1990.

G. N. Arzhantseva, A property of subgroups of infinite index in a free group, Proc. Amer. Math. Soc, vol.128, issue.11, pp.3205-3210, 2000.

G. N. Arzhantseva and A. Y. , Ol'shanski?. Generality of the class of groups in which subgroups with a lesser number of generators are free, Mat. Zametki, vol.59, issue.4, pp.489-496, 1996.

F. Bassino, A. Martino, C. Nicaud, E. Ventura, and P. Weil, Statistical properties of subgroups of free groups, Random Structures Algorithms, vol.42, issue.3, pp.349-373, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00450218

F. Bassino, C. Nicaud, and P. Weil, Random generation of finitely generated subgroups of a free group, Internat. J. Algebra Comput, vol.18, issue.2, pp.375-405, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00164584

F. Bassino, C. Nicaud, and P. Weil, Generic properties of subgroups of free groups and finite presentations. In Algebra and computer science, Contemp. Math, vol.677, pp.1-43, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01171484

F. Bassino, C. Nicaud, and P. Weil, On the genericity of Whitehead minimality, J. Group Theory, vol.19, issue.1, pp.137-159, 2016.
DOI : 10.1515/jgth-2015-0030
URL : https://hal.archives-ouvertes.fr/hal-00919489

G. Baumslag, A. Myasnikov, and V. Remeslennikov, Malnormality is decidable in free groups, Internat. J. Algebra Comput, vol.9, issue.6, pp.687-692, 1999.

O. Bernardi and O. Giménez, A linear algorithm for the random sampling from regular languages, Algorithmica, vol.62, issue.1-2, pp.130-145, 2012.

J. Birget, S. Margolis, J. Meakin, and P. Weil, PSPACE-complete problems for subgroups of free groups and inverse finite automata, Theoret. Comput. Sci, vol.242, issue.1-2, pp.247-281, 2000.

J. S. Birman, Braids, links, and mapping class groups, Annals of Mathematics Studies, issue.82, 1974.

M. R. Bridson and D. T. Wise, Malnormality is undecidable in hyperbolic groups, Israel J. Math, vol.124, pp.313-316, 2001.

C. Champetier, Propriétés statistiques des groupes de présentation finie, Journal of Advances in Mathematics, vol.116, issue.2, pp.197-262, 1995.

M. Cordes, M. Duchin, Y. Duong, M. Ho, and A. P. Sánchez, Random nilpotent groups I. International Mathematics Research Notices, 2016.

K. Delp, T. Dymarz, and A. Schaffer-cohen, A matrix model for random nilpotent groups, 2016.

J. D. Dixon, Probabilistic group theory, C. R. Math. Acad. Sci. Soc. R. Can, vol.24, issue.1, pp.1-15, 2002.

D. B. Epstein, J. W. Cannon, D. F. Holt, S. V. Levy, M. S. Paterson et al., Word Processing in Groups. Jones and Bartlett, 1992.

P. Flajolet, P. Zimmerman, and B. Van-cutsem, A calculus for the random generation of labelled combinatorial structures, Theoret. Comput. Sci, vol.132, issue.1-2, pp.1-35, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00917729

A. Garreta, The diophantine problem over random diophantine groups, 2016.

A. Garreta, A. Miasnikov, and D. Ovchinnikov, Properties of random nilpotent groups, 2016.

A. Garreta, A. Miasnikov, and D. Ovchinnikov, Random nilpotent groups, polycyclic presentations, and Diophantine problems, Groups Complex. Cryptol, vol.9, issue.2, pp.99-115, 2017.

S. M. Gersten, On Whitehead's algorithm, Bull. Amer. Math. Soc. (N.S.), vol.10, issue.2, pp.281-284, 1984.

R. Gilman, A. Miasnikov, and D. Osin, Exponentially generic subsets of groups, Illinois J. Math, vol.54, issue.1, pp.371-388, 2010.

M. Greendlinger, Dehn's algorithm for the word problem, Comm. Pure Appl. Math, vol.13, pp.67-83, 1960.

M. Greendlinger, An analogue of a theorem of Magnus, Arch. Math, vol.12, pp.94-96, 1961.

R. I. Grigorchuk, Symmetrical random walks on discrete groups, Multicomponent random systems, vol.6, pp.285-325, 1980.

M. Gromov, Hyperbolic groups, Essays in group theory, vol.8, pp.75-263, 1987.

M. Gromov, Asymptotic invariants of infinite groups, Geometric group theory, vol.2, pp.1-295, 1991.

D. F. Holt, B. Eick, and E. A. O'brien, Handbook of computational group theory. Discrete Mathematics and its Applications, 2005.

T. Jitsukawa, Malnormal subgroups of free groups, Computational and statistical group theory, vol.298, pp.83-95, 2001.

S. Kalajd?ievski, Automorphism group of a free group: centralizers and stabilizers, J. Algebra, vol.150, issue.2, pp.435-502, 1992.

I. Kapovich and P. Schupp, Delzant's T -invariant, Kolmogorov complexity and onerelator groups, Comment. Math. Helv, vol.80, issue.4, pp.911-933, 2005.

I. Kapovich and P. Schupp, Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups, Math. Ann, vol.331, issue.1, pp.1-19, 2005.

I. Kapovich and P. Schupp, On group-theoretic models of randomness and genericity, Groups Geom. Dyn, vol.2, issue.3, pp.383-404, 2008.

I. Kapovich, P. Schupp, and V. Shpilrain, Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups, Pacific J. Math, vol.223, issue.1, pp.113-140, 2006.

I. Kapovich and P. E. Schupp, Random quotients of the modular group are rigid and essentially incompressible, J. Reine Angew. Math, vol.628, pp.91-119, 2009.

H. Kesten, Symmetric random walks on groups, Trans. Amer. Math. Soc, vol.92, pp.336-354, 1959.

O. Kharlampovich, A. Miasnikov, and P. Weil, Stallings graphs for quasi-convex subgroups, J. Algebra, vol.488, pp.442-483, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02133838

A. Lubotzky and D. Segal, Subgroup growth, vol.212, 2003.

R. C. Lyndon and P. E. Schupp, Combinatorial group theory, Ergebnisse der Mathematik und ihrer Grenzgebiete, p.89, 1977.

I. G. Lysënok, Some algorithmic properties of hyperbolic groups, Izv. Akad. Nauk SSSR Ser. Mat, vol.53, issue.4, pp.814-832, 1989.

L. Markus-epstein, Stallings foldings and subgroups of amalgams of finite groups, Internat. J. Algebra Comput, vol.17, issue.8, pp.1493-1535, 2007.

A. G. Myasnikov and A. Ushakov, Random subgroups and analysis of the length-based and quotient attacks, J. Math. Cryptol, vol.2, issue.1, pp.29-61, 2008.

J. Nielsen, Die Isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden, Mathematische Annalen, vol.78, 1918.

Y. Ollivier, Sharp phase transition theorems for hyperbolicity of random groups, Geom. Funct. Anal, vol.14, issue.3, pp.595-679, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00138227

Y. Ollivier, invitation to random groups, Ensaios Matemáticos, vol.10, 2005.

, Sociedade Brasileira de Matemática, 2005.

Y. Ollivier, On a small cancellation theorem of Gromov, Bull. Belg. Math. Soc. Simon Stevin, vol.13, issue.1, pp.75-89, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00138229

Y. Ollivier, Some small cancellation properties of random groups, Internat. J. Algebra Comput, vol.17, issue.1, pp.37-51, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00138233

A. Y. , Ol'shanski?. Almost every group is hyperbolic, Internat. J. Algebra Comput, vol.2, issue.1, pp.1-17, 1992.

E. Rips, Subgroups of small cancellation groups, Bull. London Math. Soc, vol.14, issue.1, pp.45-47, 1982.

M. Sapir and I. ?pakulová, Almost all one-relator groups with at least three generators are residually finite, J. Eur. Math. Soc, vol.13, issue.2, pp.331-343, 2011.

P. E. Schupp, Embeddings into simple groups, J. London Math. Soc, vol.13, issue.2, pp.90-94, 1976.

P. Silva, X. Soler-escriva, and E. Ventura, Finite automata for Schreier graphs of virtually free groups, J. Group Theory, 2015.

J. R. Stallings, Topology of finite graphs, Invent. Math, vol.71, issue.3, pp.551-565, 1983.

N. W. Touikan, A fast algorithm for Stallings' folding process, Internat. J. Algebra Comput, vol.16, issue.6, pp.1031-1045, 2006.

J. H. Whitehead, On equivalent sets of elements in a free group, Ann. of Math, vol.37, issue.2, pp.782-800, 1936.

A. ?uk, Property (T) and Kazhdan constants for discrete groups, Geom. Funct. Anal, vol.13, issue.3, pp.643-670, 2003.