Abstract
It is known that random 2-lifts of graphs give rise to expander graphs. We present a new conjectured derandomization of this construction based on certain Mealy automata. We verify that these graphs have polylogarithmic diameter, and present a class of automata for which the same is true. However, we also show that some automata in this class do not give rise to expander graphs.
Similar content being viewed by others
References
V. Aleshin: A free group of finite automata (in Russian), Vestnik Moskov. Univ. Ser. I Mat. Mekh. 4 (1983), 12–14.
D. D’Angeli and E. Rodaro: A geometric approach to (semi)-groups defined by automata via dual transducers, Geom. Dedicata 174 (2015), 375–400.
L. Bartholdi, R. Grigorchuk and Z. Šunić: Branch groups, in: Handbook of algebra, Vol. 3, North-Holland, Amsterdam, 2003, 989–1112.
L. Bartholdi and Z. Šunić: Some solvable automaton groups, Contemp. Math. 394, AMS, Providence, RI, 2006.
Y. Bilu and N. Linial: Lifts, discrepancy and nearly optimal spectral gap, Combinatorica 26 (2006), 495–519.
I. Bondarenko: Groups generated by bounded automata and their Schreier graphs, Ph.D. Thesis, Texas A&M, 2007.
I. Bondarenko, N. Bondarenko, S. Sidki and F. Zapata: On the conjugacy problem for finite-state automorphisms of regular rooted trees, Groups Geom. Dyn. 7 (2013), 323–355.
I. Bondarenko, R. Grigorchuk, R. Kravchenko, Y. Muntyan, V. Nekrashevych, D. Savchuk and Z. Šunić: On classification of groups generated by 3-state automata over a 2-letter alphabet, Algebra Discrete Math. 1 (2008), 1–163.
D. D’Angeli and E. Rodaro: A geometric approach to (semi)-groups defined by automata via dual transducers, Geom. Dedicata 174 (2014), 375–400.
P. Gawron, V. Nekrashevych and V. Sushchansky: Conjugation in tree automorphism groups. Internat. J. Algebra Comput. 11 (2001), 529–547.
Y. Glasner and S. Mozes: Automata and square complexes, Geom. Dedicata 111 (2005), 43–64.
R. I. Grigorchuk: Solved and unsolved problems around one group, in Infinite Groups: Geometric, Combinatorial and Dynamical Aspects, Birkhäuser, Basel, 2005, 117–218.
R. I. Grigorchuk: Some problems of the dynamics of group actions on rooted trees, Proc. Steklov Inst. Math. 273 (2011), 64–175.
R. Grigorchuk, V. Nekrashevich and V. Sushchanskiĭ: Automata, dynamical systems, and groups, Proc. Steklov Inst. Math. 231 (2000), 128–203.
R. I. Grigorchuk and I. Pak: Groups of intermediate growth, an introduction, Enseign. Math. 54 (2008), 251–272.
S. Hoory, N. Linial and A. Wigderson: Expander graphs and their applications, Bull. AMS 43 (2006), 439–561.
A. Lubotzky: Discrete Groups, Expanding Graphs, and Invariant Measures, Birkhäuser, Basel, 1994.
G. Margulis: Explicit constructions of expanders, Problemy Peredači Informacii 9 (1973), 71–80.
A. Marcus, D. Spielman and N. Srivastava: Interlacing families I: bipartite Ramanujan graphs of all degrees, IEEE FOCS 54 (2013), 529–537.
V. Nekrashevych: Self-similar Groups, AMS, Providence, RI, 2005.
D. Savchuk and Y. Vorobets: Automata generating free products of groups of order 2, J. Algebra 366 (2011), 53–66.
B. Steinberg: Testing spherical transitivity in iterated wreath products of cyclic groups, arXiv: 0607563.
T. Tao: Basic theory of expander graphs, 2 December 2011 blog entry; available electronically at http://tinyurl.com/d6hhlge
S. Vadhan: Pseudorandomness, monograph draft; available electronically at http://tinyurl.com/o9e7qa8
M. Vorobets and Y. Vorobets: On a free group of transformations defined by an automaton, Geom. Dedicata 124 (2007), 237–249.
M. Vorobets and Y. Vorobets: On a series of finite automata defining free transformation groups. Groups Geom. Dyn. 4 (2010), 377–405.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Malyshev, A., Pak, I. Lifts, derandomization, and diameters of Schreier graphs of Mealy automata. Combinatorica 37, 733–765 (2017). https://doi.org/10.1007/s00493-016-3306-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-016-3306-0