Backhausz, Ágnes; Virág, Bálint Spectral measures of factor of i.i.d. processes on vertex-transitive graphs. (English. French summary) Zbl 1387.60063 Ann. Inst. Henri Poincaré, Probab. Stat. 53, No. 4, 2260-2278 (2017). Summary: We prove that a measure on \([-d,d]\) is the spectral measure of a factor of i.i.d. process on a vertex-transitive infinite graph if and only if it is absolutely continuous with respect to the spectral measure of the graph. Moreover, we show that the set of spectral measures of factor of i.i.d. processes and that of \(\bar{d}_{2}\)-limits of factor of i.i.d. processes are the same. Cited in 9 Documents MSC: 60G15 Gaussian processes Keywords:factor of i.i.d.; Gaussian process; spectral measure × Cite Format Result Cite Review PDF Full Text: DOI arXiv Euclid References: [1] M. Abért, A. Thom and B. Virág. Benjamini-Schramm convergence and pointwise convergence of the spectral measure. Preprint, 2014. Available athttp://www.renyi.hu/ abert/luckapprox.pdf. [2] N. Alon, I. Benjamini, E. Lubetzky and S. Sodin. Non-backtracking random walks mix faster.Commun. Contemp. Math.9(2007) 585-603. · Zbl 1140.60301 · doi:10.1142/S0219199707002551 [3] J.-P. Arnaud. Fonctions sphériques et fonctions définies positives sur l’arbre homogène.C. R. Acad. Sci. Paris Sér. A-B290(1980) A99-A101. · Zbl 0427.60012 [4] J.-P. Arnaud. Stationary processes indexed by a homogeneous tree.Ann. Probab.22(1994) 195-218. · Zbl 0793.60039 · doi:10.1214/aop/1176988856 [5] J.-P. Arnaud and G. Letac. La formule de représentation spectrale d’un processus gaussien stationnaire sur un arbre homogène.Publ. Lab. Stat. Probab., Toulouse01-85(1984) 1-12. [6] Á. Backhausz and B. Szegedy. On large girth regular graphs and random processes on trees. Preprint, 2014. Available atarXiv:1406.4420[math.PR] · Zbl 1401.05267 [7] Á. Backhausz, B. Szegedy and B. Virág. Ramanujan graphings and correlation decay in local algorithms.Random Structures Algorithms47(2015) 424-435. · Zbl 1325.05159 · doi:10.1002/rsa.20562 [8] B. Bekka, P. de la Harpe and A. Valette.Kazhdan’s Property (T). New Mathematical Monographs11. Cambridge University Press, Cambridge, 2008. · Zbl 1146.22009 [9] C. Bordenave, A. Sen and B. Virág. Mean quantum percolation.J. Eur. Math. Soc.To appear. · Zbl 1385.60057 [10] L. Bowen. The ergodic theory of free group actions: Entropy and the \(f\)-invariant.Groups Geom. Dyn.4(2010) 419-432. · Zbl 1201.37006 [11] P. Cartier Harmonic analysis on trees. InHarmonic Analysis on Homogeneous Spaces (Proc. Sympos. Pure Math., Vol. XXVI, Williams Coll., Williamstown, Mass., 1972)419-424. Amer. Math. Soc., Providence, R.I., 1973. · Zbl 0309.22009 [12] E. Csóka, B. Gerencsér, V. Harangi and B. Virág. Invariant Gaussian processes and independent sets on regular graphs of large girth.Random Structures Algorithms47(2015) 284-303. · Zbl 1322.05106 [13] E. Csóka and G. Lippner. Invariant random matchings in Cayley graphs. Preprint, 2012. Available atarXiv:1211.2374[math.CO] · Zbl 1369.05102 [14] G. Elek and G. Lippner. Borel oracles. An analytical approach to constant-time algorithms.Proc. Amer. Math. Soc.138(2010) 2939-2947. · Zbl 1200.68283 · doi:10.1090/S0002-9939-10-10291-3 [15] W. Evans, C. Kenyon, Y. Peres and L. J. Schulman. Broadcasting on trees and the Ising model.Ann. Appl. Probab.10(2000) 410-433. · Zbl 1052.60076 · doi:10.1214/aoap/1019487349 [16] A. Figà-Talamanca and C. Nebbia.Harmonic Analysis and Representation Theory for Groups Acting on Homogeneous Trees. London Mathematical Society Lecture Note Series162. Cambridge University Press, Cambridge, 1991. · Zbl 1154.22301 [17] A. Figà-Talamanca and M. A. Picardello. Spherical functions and harmonic analysis on free groups.J. Funct. Anal.47(1982) 281-304. · Zbl 0489.43008 · doi:10.1016/0022-1236(82)90108-2 [18] D. Gaboriau and R. Lyons. A measurable-group-theoretic solution to von Neumann’s problem.Invent. Math.177(2009) 533-540. · Zbl 1182.43002 · doi:10.1007/s00222-009-0187-5 [19] D. Gamarnik and M. Sudan. Limits of local algorithms over sparse random graphs. InProceedings of the 5th Innovations in Theoretical Computer Science Conference. ACM Special Interest Group on Algorithms and Computation Theory, 2014. · Zbl 1365.05277 [20] V. Harangi and B. Virág. Independence ratio and random eigenvectors in transitive graphs.Ann. Probab.43(2015) 2810-2840. · Zbl 1323.05101 · doi:10.1214/14-AOP952 [21] P. Harsha. Communication complexity. Lecture notes, 2011. Available athttp://www.tcs.tifr.res.in/ prahladh/teaching/2011-12/comm/lectures/l12.pdf. [22] H. Hatami, L. Lovász and B. Szegedy. Limits of locally-globally convergent graph sequences.Geom. Funct. Anal.24(2014) 269-296. · Zbl 1294.05109 · doi:10.1007/s00039-014-0258-7 [23] C. Hoppen and N. Wormald. Local algorithms, regular graphs of large girth, and random regular graphs. Preprint, 2013. Available atarXiv:1308.0266[math.CO] · Zbl 1348.05191 · doi:10.1016/j.jctb.2016.07.009 [24] O. Kallenberg.Foundations of Modern Probability, 2nd edition.Probability and Its Applications (New York). Springer-Verlag, New York, 2002. · Zbl 0996.60001 [25] G. Kun. Expanders have a spanning Lipschitz subgraph with large girth. Preprint, 2013. Available atarXiv:1303.4982[math.GR] [26] R. Lasser and M. Leitner. On the estimation of the mean of weakly stationary and polynomial weakly stationary sequences.J. Multivariate Anal.35(1990) 31-47. · Zbl 0717.62077 · doi:10.1016/0047-259X(90)90014-9 [27] R. Lyons. Factors of IID on trees.Combin. Probab. Comput.26(2017) 285-300. · Zbl 1371.05129 · doi:10.1017/S096354831600033X [28] R. Lyons and F. Nazarov. Perfect matchings as IID factors on non-amenable groups.European J. Combin.32(2011) 1115-1125. · Zbl 1229.05115 · doi:10.1016/j.ejc.2011.03.008 [29] R. Lyons and Y. Peres. Probability on trees and networks, 2014. In preparation. · Zbl 1376.05002 [30] M. Rahman and B. Virág. Local algorithms for independent sets are half-optimal. Preprint, 2014. Available atarXiv:1402.0485[math.PR] · Zbl 1377.60049 [31] A. Sly. Reconstruction for the Potts model.Ann. Probab.39(2011) 1365-1406. · Zbl 1234.60095 · doi:10.1214/10-AOP584 [32] W. Woess.Random Walks on Infinite Graphs and Groups. Cambridge Tracts in Mathematics138. Cambridge University Press, Cambridge, 2000. This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.