This free book focuses on the interplay between random walks on planar maps and Koebe's circle packing theorem. Further topics covered include electric networks, the He–Schramm theorem on infinite circle packings, uniform spanning trees of planar maps, local limits of finite planar maps and the almost sure recurrence of simple random walks on the...

This is one of the first books on a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics. The authors take a closer look at discre...

Rethinking the Internet of Things was a 2014 Jolt Award Finalist, the highest honor for a programming book. And the amazing part is that there is no code in the book.
Over the next decade, most devices connected to the Internet will not be used by people in the familiar way that personal computers, tablets and smart phones are. Billions of inter...

Complexity science uses computation to explore the physical and social sciences. In Think Complexity, you'll use graphs, cellular automata, and agent-based models to study topics in physics, biology, and economics.
Whether you're an intermediate-level Python programmer or a student of computational modeling, you'll delve into examples of complex...

This book has brought together leading investigators who work in the new arena of brain connectomics. This includes 'macro-connectome' efforts to comprehensively chart long-distance pathways and functional networks; 'micro-connectome' efforts to identify every neuron, axon, dendrite, synapse, and glial process within restricted brain regions; and '...

Applied Combinatorics is an open-source book for a course covering the fundamental enumeration techniques (permutations, combinations, subsets, pigeon hole principle), recursion and mathematical induction, more advanced enumeration techniques (inclusion-exclusion, generating functions, recurrence relations, Polyá theory), discrete structures (grap...

Algorithms are the lifeblood of computer science. They are the machines that proofs build and the music that programs play. Their history is as old as mathematics itself. This book is a wide-ranging, idiosyncratic treatise on the design and analysis of algorithms, covering several fundamental techniques, with an emphasis on intuition and the proble...

The Algorithms Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow....

This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software....

The goals of this textbook are to help students acquire the technical skills of using software and managing a database, and develop research skills of collecting data, analyzing information and presenting results. We emphasize that the need to investigate the potential and practicality of GIS technologies in a typical planning setting and evaluate ...

A unified treatment of the most important results in the study of fractional graph concepts, this volume explores the various ways in which integer-valued concepts can be modified to derive nonintegral values. It begins with the general fractional theory of hypergraphs and presents in-depth coverage of fundamental and advanced topics. Subjects incl...