L. Addario, -. Berry, and S. Griffiths, The spectrum of random lifts. arXiv e-prints, 2010.

D. Aldous, Random walks on finite groups and rapidly mixing markov chains, Séminaire de Probabilités XVII 1981/82, pp.243-297, 1983.

D. Aldous and P. Diaconis, Shuffling cards and stopping times, Amer. Math. Monthly, vol.93, issue.5, pp.333-348, 1986.

V. D. N-alon and . Milman, Eigenvalues, expanders and superconcentrators, vol.11, 1984.

A. Amit and N. Linial, Random lifts of graphs: edge expansion, Combin. Probab. Comput, vol.15, issue.3, pp.317-332, 2006.

A. Amit, N. Linial, and J. Matou?ek, Random lifts of graphs: independence and chromatic number, Random Structures Algorithms, vol.20, issue.1, pp.1-22, 2002.

A. Amit, N. Linial, J. Matou?ek, and E. Rozenman, Random lifts of graphs, Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, pp.883-894, 2001.

L. Avena and H. Guldas, Remco van der Hofstad, and Frank den Hollander. Random walks on dynamic configuration models: a trichotomy, 2018.

A. Ben-hamou, E. Lubetzky, and Y. Peres, Comparing mixing times on sparse random graphs, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1734-1740, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01598912

A. Ben, -. Hamou, and J. Salez, Cutoff for nonbacktracking random walks on sparse random graphs, Ann. Probab, vol.45, issue.3, pp.1752-1770, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01141192

N. Berestycki, E. Lubetzky, Y. Peres, and A. Sly, Random walks on the random graph, Ann. Probab, vol.46, issue.1, pp.456-490, 2018.

C. Bordenave, A new proof of Friedman's second eigenvalue Theorem and its extension to random lifts, 2015.

C. Bordenave and B. Collins, Eigenvalues of random lifts and polynomial of random permutations matrices. arXiv e-prints, 2018.

C. Bordenave and H. Lacoin, Cutoff at the entropic time for random walks on covered expander graphs. arXiv e-prints, 2018.

P. Caputo and M. Quattropani, Mixing time of PageRank surfers on sparse random digraphs. arXiv e-prints, 2019.

K. L. and C. , Markov chains with stationary transition probabilities. Die Grundlehren der mathematischen Wissenschaften, Bd, vol.104, 1960.

P. Diaconis and M. Shahshahani, Generating a random permutation with random transpositions. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.57, pp.159-179, 1981.

Y. Drier and N. Linial, Minors in lifts of graphs, Random Structures Algorithms, vol.29, issue.2, pp.208-225, 2006.

A. Gaudillière and C. Landim, A dirichlet principle for non reversible markov chains and some recurrence theorems. Probability Theory and Related Fields, vol.71, pp.55-89, 2001.

A. Lorenz and . Gilch, Rate of escape of random walks on regular languages and free products by amalgamation of finite groups, In Fifth Colloquium on Mathematics and Computer Science, pp.2544-2560, 2008.

A. Lorenz and . Gilch, Asymptotic entropy of random walks on regular languages over a finite alphabet, Electron. J. Probab, vol.21, issue.8, p.42, 2016.

J. Hermon and S. Thomas, Cutoff for Mixing Times on Random Abelian Cayley Graphs. arXiv e-prints, 2018.

P. Steven and . Lalley, Random walks on regular languages and algebraic systems of generating functions, Algebraic methods in statistics and probability, vol.287, pp.201-230, 2000.

N. Linial and E. Rozenman, Random lifts of graphs: perfect matchings, Combinatorica, vol.25, issue.4, pp.407-424, 2005.

E. Lubetzky and Y. Peres, Cutoff on all Ramanujan graphs. arXiv e-prints, 2015.

E. Lubetzky and A. Sly, Cutoff phenomena for random walks on random regular graphs, Duke Math. J, vol.153, issue.3, pp.475-510, 2010.

E. Lubetzky, B. Sudakov, and V. Vu, Spectra of lifted ramanujan graphs

A. Lubotzky, Discrete groups, expanding graphs and invariant measures, Progress in Mathematics. Birkhäuser Verlag, vol.125, 1994.

R. Lyons, Random walks and percolation on trees, Ann. Probab, vol.18, issue.3, pp.931-958, 1990.

T. Lyons, A simple criterion for transience of a reversible Markov chain, Ann. Probab, vol.11, issue.2, pp.393-402, 1983.

R. Montenegro and P. Tetali, Mathematical aspects of mixing times in Markov chains, Found. Trends Theor. Comput. Sci, vol.1, issue.3, p.121, 2006.

T. Nagnibeda, S. Sweeden, and A. , Green functions on trees with finitely many cone types, 1999.

T. Nagnibeda and W. Woess, Random walks on trees with finitely many cone types, J. Theoret. Probab, vol.15, issue.2, pp.383-422, 2002.

S. Sawyer and T. Steger, The rate of escape for anisotropic random walks in a tree, Probability Theory and Related Fields, vol.76, pp.207-230, 1987.

P. Sousi and S. Thomas, Cutoff for Random Walk on Dynamical Erdös-R\'enyi Graph, 2018.

C. Takacs, Random walk on periodic trees, Electron. J. Probab, vol.2, p.16, 1997.

W. Woess, Random walks and periodic continued fractions, Adv. in Appl. Probab, vol.17, issue.1, pp.67-84, 1985.