Self-interaction on trees

Orenshtein Tal, Università di Milano-Bicocca

Rotor walks are discrete-time self-interacting processes on graphs in space -- local-time environments. Given the environment and the initial position the process is deterministic: if the walk is in vertex v at time n, it jumps to a neighbor w of v defined by w = r(v, k), where r is the environment and k is the local time in v at time n. We shall discuss several problems and results on this model.

Area: CS10 - Random walks and branching processes (Fabio Zucca)

Keywords: Rotor walk, rotor-router, self-interacting random processes, multi-type branching processes, local time, excursions

Please Login in order to download this file