Every mathematician is a person with a story. Limitless Minds tells those stories in an engaging way by featuring interviews with twelve leading mathematicians. They were invited to answer some key questions such as: Who and what were the influences that pointed them towards mathematics? Why do mathematicians devote their lives to discovering new mathematics? How do they see mathematics evolving in the future? The book, written in an accessible style and enriched by dozens of images, offers a rare insight into the minds of mathematicians, provided in their own words. It will enlighten and inspire readers about the lives, passions, and discoveries of mathematicians.

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.

This book constitutes the proceedings of the 15th International Workshop on Algorithms and Models for the Web Graph, WAW 2018, held in Moscow, Russia in May 2018. The 11 full papers presented in this volume were carefully reviewed and selected from various submissions. The papers focus on topics like the information retrieval and data mining on the Web; Web as a text repository and as a graph, induced in various ways by link among pages, hosts and users; the understanding of graphs that arise from the Web and various user activities on the Web; stimulation of the development of high-performance algorithms and applications that exploit these graphs.

This book aims at promoting high-quality research by researchers and practitioners from academia and industry at the International Conference on Computational Intelligence, Cyber Security, and Computational Models ICC3 2015 organized by PSG College of Technology, Coimbatore, India during December 17 - 19, 2015. This book enriches with innovations in broad areas of research like computational modeling, computational intelligence and cyber security. These emerging inter disciplinary research areas have helped to solve multifaceted problems and gained lot of attention in recent years. This encompasses theory and applications, to provide design, analysis and modeling of the aforementioned key areas.

This book constitutes the refereed proceedings of the 11th International Workshop on Algorithms and Models for the Web Graph, WAW 2014, held in Beijing, China, in December 2014. The 12 papers presented were carefully reviewed and selected for inclusion in this volume. The aim of the workshop was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs. The workshop gathered the researchers who are working on graph-theoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, and other networks arising from the Internet.

This book contains cutting-edge research material presented by researchers, engineers, developers, and practitioners from academia and industry at the International Conference on Computational Intelligence, Cyber Security and Computational Models (ICC3) organized by PSG College of Technology, Coimbatore, India during December 19-21, 2013. The materials in the book include theory and applications to provide design, analysis, and modeling of the key areas. The book will be useful material for students, researchers, professionals, as well academicians in understanding current research trends and findings and future scope of research in computational intelligence, cyber security, and computational models.

This book constitutes the refereed proceedings of the 10th International Workshop on Algorithms and Models for the Web Graph, WAW 2013, held in Cambridge, MA, USA, in December 2013. The 17 papers presented were carefully reviewed and selected for inclusion in this volume. They address topics related to graph-theoretic and algorithmic aspects of related complex networks, including citation networks, social networks, biological networks, molecular networks and other networks arising from the Internet.

This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Models for the Web-Graph, WAW 2012, held in Halifax, Nova Scotia, Canada, in June 2012. The 13 papers presented were carefully reviewed and selected for inclusion in this volume. They address a number of topics related to the complex networks such hypergraph coloring games and voter models; algorithms for detecting nodes with large degrees; random Appolonian networks; and a sublinear algorithm for Pagerank computations.

This book constitutes the refereed proceedings of the 5th International Workshop on Algorithms and Models for the Web-Graph, WAW 2007, held in San Diego, CA, USA, in December 2007 - colocated with WINE 2007, the Third International Workshop on Internet and Network Economics.

The 13 revised full papers and 5 revised short papers presented were carefully reviewed and selected from a large pool of submissions for inclusion in the book. The papers address a wide variety of topics related to the study of the Web-graph such as random graph models for the Web-graph, PageRank analysis and computation, decentralized search, local partitioning algorithms, and traceroute sampling.

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.

This book is the first and only one of its kind on the topic of Cops and Robbers games, and more generally, on the field of vertex pursuit games on graphs. The book is written in a lively and highly readable fashion, which should appeal to both senior undergraduates and experts in the field (and everyone in between). One of the main goals of the book is to bring together the key results in the field; as such, it presents structural, probabilistic, and algorithmic results on Cops and Robbers games. Several recent and new results are discussed, along with a comprehensive set of references. The book is suitable for self-study or as a textbook, owing in part to the over 200 exercises. The reader will gain insight into all the main directions of research in the field and will be exposed to a number of open problems.

This book constitutes the proceedings of the 14th International Workshop Algorithms and Models for the Web Graph, WAW 2017, held in Toronto, ON, Canada, in June 2017. The 7 full papers presented in this volume were carefully reviewed and selected from 14 submissions. The papers are organized around topics such as graphs that arise from the Web and various user activities on the Web; the development of high Performance algorithms and applications that exploit these graphs; graph-theoretic and algorithmic aspects of related complex networks; social networks, citation networks, biological networks; molecular networks, and other networks arising from the Internet.

This book constitutes the proceedings of the 13th International Workshop on Algorithms and Models for the Web Graph, WAW 2016, held in Montreal, QC, Canada, in December 2016. The 13 full papers presented in this volume were carefully reviewed and selected from 14 submissions. The workshop gathered the researchers who are working on graph-theoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, and other networks arising from the Internet.

Graphs measure interactions between objects such as friendship links on Twitter, transactions between Bitcoin users, and the flow of energy in a food chain. While graphs statically represent interacting systems, they may also be used to model dynamic interactions. For example, imagine an invisible evader loose on a graph, leaving behind only breadcrumb clues to their whereabouts. You set out with pursuers of your own, seeking out the evader's location. Would you be able to detect their location? If so, then how many resources are needed for detection, and how fast can that happen? These basic-seeming questions point towards the broad conceptual framework of pursuit-evasion games played on graphs. Central to pursuit-evasion games on graphs is the idea of optimizing certain parameters, whether they are the cop number, burning number, or localization number, for example. This book would be excellent for a second course in graph theory at the undergraduate or graduate level. It surveys different areas in graph searching and highlights many fascinating topics intersecting classical graph theory, geometry, and combinatorial designs. Each chapter ends with approximately twenty exercises and five larger scale projects.