Graph Searching Games and Probabilistic Methods - Anthony Bonato, Pawel Pralat

Graph Searching Games and Probabilistic Methods

Buch | Softcover
402 Seiten
2023
Chapman & Hall/CRC (Verlag)
978-1-032-47641-4 (ISBN)
54,85 inkl. MwSt
This is the first book that focuses on the intersection of graph searching games and probabilistic methods. The book explores various applications of these powerful mathematical tools to games and processes. It also provides results, techniques, and directions in graph searching games from the point of view of probabilistic methods.
Graph Searching Games and Probabilistic Methods is the first book that focuses on the intersection of graph searching games and probabilistic methods. The book explores various applications of these powerful mathematical tools to games and processes such as Cops and Robbers, Zombie and Survivors, and Firefighting.



Written in an engaging style, the book is accessible to a wide audience including mathematicians and computer scientists. Readers will find that the book provides state-of-the-art results, techniques, and directions in graph searching games, especially from the point of view of probabilistic methods.



The authors describe three directions while providing numerous examples, which include:



• Playing a deterministic game on a random board.



• Players making random moves.



• Probabilistic methods used to analyze a deterministic game.

Dr. Anthony Bonato is a professor of Mathematics at Ryerson University, whose main research interests are in graph theory and complex networks. He is co-Editor-in-Chief of Internet Mathematics, editor for Contributions to Discrete Mathematics, and Chair of the Pure Mathematics group within the NSERC Discovery Grants Mathematics and Statistics Evaluation Group. Dr. Pawel Prałat is an associate professor at Ryerson University whose main research interests are in graph theory and complex networks. He is the Assistant Director of Industry Liaison at The Fields Institute for Research in Mathematical Sciences, and has pursued collaborations with various industry partners as well as the Government of Canada.

Preface; Chapter 1: Introduction; 2: The Game of Cops and Robbers; 3. Variations of Cops and Robbers; 4. Large Cop Number and Meyniel’s Conjecture; 5. Graph Cleaning; 6. Acquaintance Time; 7. Random Geometric Graphs; 8. Firefighting and Seepage; 9. Miscellaneous Topics; Bibliography; Index

Erscheinungsdatum
Reihe/Serie Discrete Mathematics and Its Applications
Zusatzinfo 53 Illustrations, black and white
Sprache englisch
Maße 156 x 234 mm
Gewicht 548 g
Themenwelt Mathematik / Informatik Informatik Betriebssysteme / Server
Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 1-032-47641-9 / 1032476419
ISBN-13 978-1-032-47641-4 / 9781032476414
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich