期刊论文详细信息
| Electronic Journal Of Combinatorics | |
| Infinite Excursions of Rotor Walks on Regular Trees | |
| Sebastian Müller1 | |
| 关键词: Rotor walk; Self interacting walk; Regular tree; Recurrence; Transience; Multi-type branching process; | |
| DOI : | |
| 学科分类：离散数学和组合数学 | |
| 来源: Electronic Journal Of Combinatorics | |
 PDF
|
|
【 摘 要 】
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:
【 授权许可】
Others
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO201909028327629ZK.pdf | 365KB |  download |
878987797
028-85220240
