Graphes dans les surfaces et ergodicité topologique

Dustin Connery-Grigg, François Lalonde, Jordan Payette

The simplest way to make a dynamical system out of a finite connected graph $G$ is to give it a polarization, that is to say a cyclic ordering of the edges incident to a vertex, fo…