Gleb Nenashev: Chip-firing game, Sandpile module and rotor-router models

Will be defined all these concepts, and will be told about their connections with each other. All of them are defined for graphs (for usual and for directed), and some recursive processes correspond to them. For example, we have chips in vertices of usual graph, and have follow process: we chose any vertex with number of chips on it more than its degree, and then we send one chip to each of its neighbours, sometimes it is finite, and sometimes not.