Alon, N., Benjamini, I., Lubetzky, E. and Sodin, S. (2007) Non-backtracking random walks mix faster. Commun. Contemp. Math.
Angel, O., Friedman, J. and Hoory, S. (2015) The non-backtracking spectrum of the universal cover of a graph. Trans. Amer. Math. Soc.
Backhausz, Á. and Szegedy, B. (2014) On large girth regular graphs and random processes on trees. arXiv:1406.4420
Backhausz, Á. and Virág, B. (2015) Spectral measures of factor of i.i.d. processes on vertex-transitive graphs. Ann. Inst. Henri Poincaré Probab. Stat., to appear. arXiv:1505.07412
Backhausz, Á., Szegedy, B. and Virág, B. (2015) Ramanujan graphings and correlation decay in local algorithms. Random Struct. Alg.
Ball, K. (2005) Factors of independent and identically distributed processes with non-amenable group actions. Ergodic Theory Dyn. Syst.
Ben-Hamou, A. and Salez, J. (2017) Cutoff for non-backtracking random walks on sparse random graphs. Ann. Probab., 45, no. 3, 1752–1770.
Bordenave, C. (2015) A new proof of Friedman's second eigenvalue theorem and its extension to random lifts. arXiv:1502.04482
Bowen, L. (2010) The ergodic theory of free group actions: Entropy and the f-invariant. Groups Geom. Dyn.
Bowen, L. (2012) Sofic entropy and amenable groups. Ergodic Theory Dynam. Systems
Conley, C. T., Marks, A. S. and Tucker-Drob, R. (2016) Brooks's theorem for measurable colorings. Forum of Mathematics, Sigma, 4
e16. DOI: https://doi.org/10.1017/fms.2016.14.
Csóka, E. (2016) Independent sets and cuts in large-girth regular graphs. arXiv:1602.02747
Csóka, E. and Lippner, G. (2017) Invariant random matchings in Cayley graphs. Groups, Geometry and Dynamics, 11
Csóka, E., Gerencsér, B., Harangi, V. and Virág, B. (2015) Invariant Gaussian processes and independent sets on regular graphs of large girth. Random Struct. Alg.
Friedman, J. (2008) A Proof of Alon's Second Eigenvalue Conjecture and Related Problems, Vol. 195, no. 910 of Memoirs of the American Mathematical Society, AMS.
Gaboriau, D. and Lyons, R. (2009) A measurable-group-theoretic solution to von Neumann's problem. Invent. Math.
Gamarnik, D. and Sudan, M. (2014) Limits of local algorithms over sparse random graphs. In ITCS 2014: Proc. 5th Conference on Innovations in Theoretical Computer Science, ACM, pp. 369–376.
Harangi, V. and Virág, B. (2015) Independence ratio and random eigenvectors in transitive graphs. Ann. Probab.
Hoppen, C. and Wormald, N. Local algorithms, regular graphs of large girth, and random regular graphs. Combinatorica, to appear. arXiv:1308.0266
Kechris, A. S. and Tsankov, T. (2008) Amenable actions and almost invariant sets. Proc. Amer. Math. Soc.
Kempton, M. (2016) Non-backtracking random walks and a weighted Ihara's theorem. Open J. Discrete Math.
Kerr, D. and Li, H. (2013) Soficity, amenability, and dynamical entropy. Amer. J. Math.
Kun, G. (2013) Expanders have a spanning Lipschitz subgraph with large girth. arXiv:1303.4982
Lyons, R. (2017) Factors of IID on trees. Combin. Probab. Comput.
Lyons, R. and Nazarov, F. (2011) Perfect matchings as IID factors on non-amenable groups. European J. Combin.
Ornstein, D. S. and Weiss, B. (1987) Entropy and isomorphism theorems for actions of amenable groups. J. Analyse Math.
Pemantle, R. (1992) Automorphism invariant measures on trees. Ann. Probab.
Puder, D. (2015) Expansion of random graphs: New proofs, new results. Invent. Math.
Rahman, M. (2016) Factor of iid percolation on trees. SIAM J. Discrete Math.
Rahman, M. and Virág, B. (2017) Local algorithms for independent sets are half-optimal. Ann. Probab., 45, no. 3, 1543–1577.
Rokhlin, V. A. and Sinai, Y. G. (1961) Construction and properties of invariant measurable divisions. Doklady Akademii Nauk SSSR
Seward, B. (2016) Weak containment and Rokhlin entropy. arXiv:1602.06680