Infinite Excursions of Rotor Walks on Regular Trees

[摘要] A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a deterministic process: 

[学科分类] 离散数学和组合数学

[关键词] Rotor walk;Self interacting walk;Regular tree;Recurrence;Transience;Multi-type branching process