Speaker
Mrs
Tatiana Nagnibeda
(Université de Genève)
Description
Many dynamical systems admit a natural symbolic representation as subshifts over a finite alphabet. Their complexity can be studied by associating to the subshift an infinite family of finite graphs that describe the local structure of its orbits; such graphs are known as Rauzy graphs. In this talk we will be interested in convergence properties of these sequences of graphs and of their spectra, and how their limits are related to the invariant measures of the dynamical system.