Vánoce stíháte! Vyzvedněte v Praze i 23. 12.

Knihobot
Knihu momentálně nemáme skladem

Traversals of Infinite Graphs with Random Local Orientations

Autoři

84 stránek

Více o knize

Focusing on graph exploration by autonomous agents, this monograph delves into various algorithms and introduces randomized versions, including randomized rotor routers and the random basic walk. It addresses the critical question of recurrence versus transience for the random basic walk on locally finite, bounded degree graphs. The work offers insights into exploratory behavior on finite graphs like lattices and complete graphs, supplemented by applications, examples, and open problems, making it a comprehensive resource for researchers in mathematics and computer science.

Parametry

ISBN
9783659776878

Kategorie

Varianta knihy

2015, měkká

Nákup knihy

Jakmile ji vyčmucháme, pošleme vám e-mail.