Probability on Trees and Networks

Probability on Trees and Networks
Author: Russell Lyons
Publisher: Cambridge University Press
Total Pages: 1023
Release: 2017-01-20
Genre: Mathematics
ISBN: 1316785335

Starting around the late 1950s, several research communities began relating the geometry of graphs to stochastic processes on these graphs. This book, twenty years in the making, ties together research in the field, encompassing work on percolation, isoperimetric inequalities, eigenvalues, transition probabilities, and random walks. Written by two leading researchers, the text emphasizes intuition, while giving complete proofs and more than 850 exercises. Many recent developments, in which the authors have played a leading role, are discussed, including percolation on trees and Cayley graphs, uniform spanning forests, the mass-transport technique, and connections on random walks on graphs to embedding in Hilbert space. This state-of-the-art account of probability on networks will be indispensable for graduate students and researchers alike.

Probability on Graphs

Probability on Graphs
Author: Geoffrey Grimmett
Publisher: Cambridge University Press
Total Pages: 279
Release: 2018-01-25
Genre: Mathematics
ISBN: 1108542999

This introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. This new edition features accounts of major recent progress, including the exact value of the connective constant of the hexagonal lattice, and the critical point of the random-cluster model on the square lattice. The choice of topics is strongly motivated by modern applications, and focuses on areas that merit further research. Accessible to a wide audience of mathematicians and physicists, this book can be used as a graduate course text. Each chapter ends with a range of exercises.

Probability and Real Trees

Probability and Real Trees
Author: Steven N. Evans
Publisher: Springer
Total Pages: 205
Release: 2007-09-26
Genre: Mathematics
ISBN: 3540747982

Random trees and tree-valued stochastic processes are of particular importance in many fields. Using the framework of abstract "tree-like" metric spaces and ideas from metric geometry, Evans and his collaborators have recently pioneered an approach to studying the asymptotic behavior of such objects when the number of vertices goes to infinity. This publication surveys the relevant mathematical background and present some selected applications of the theory.

Planar Maps, Random Walks and Circle Packing

Planar Maps, Random Walks and Circle Packing
Author: Asaf Nachmias
Publisher: Springer Nature
Total Pages: 126
Release: 2019-10-04
Genre: Mathematics
ISBN: 3030279685

This open access 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 these limits. One of its main goals is to present a self-contained proof that the uniform infinite planar triangulation (UIPT) is almost surely recurrent. Full proofs of all statements are provided. A planar map is a graph that can be drawn in the plane without crossing edges, together with a specification of the cyclic ordering of the edges incident to each vertex. One widely applicable method of drawing planar graphs is given by Koebe’s circle packing theorem (1936). Various geometric properties of these drawings, such as existence of accumulation points and bounds on the radii, encode important probabilistic information, such as the recurrence/transience of simple random walks and connectivity of the uniform spanning forest. This deep connection is especially fruitful to the study of random planar maps. The book is aimed at researchers and graduate students in mathematics and is suitable for a single-semester course; only a basic knowledge of graduate level probability theory is assumed.

Random Graphs and Complex Networks

Random Graphs and Complex Networks
Author: Remco van der Hofstad
Publisher: Cambridge University Press
Total Pages: 341
Release: 2017
Genre: Computers
ISBN: 110717287X

This classroom-tested text is the definitive introduction to the mathematics of network science, featuring examples and numerous exercises.

Random Walks and Electric Networks

Random Walks and Electric Networks
Author: Peter G. Doyle
Publisher: American Mathematical Soc.
Total Pages: 174
Release: 1984-12-31
Genre: Electric network topology
ISBN: 1614440220

Probability theory, like much of mathematics, is indebted to physics as a source of problems and intuition for solving these problems. Unfortunately, the level of abstraction of current mathematics often makes it difficult for anyone but an expert to appreciate this fact. Random Walks and electric networks looks at the interplay of physics and mathematics in terms of an example—the relation between elementary electric network theory and random walks —where the mathematics involved is at the college level.

Bayesian Networks and Decision Graphs

Bayesian Networks and Decision Graphs
Author: Thomas Dyhre Nielsen
Publisher: Springer Science & Business Media
Total Pages: 457
Release: 2009-03-17
Genre: Science
ISBN: 0387682821

This is a brand new edition of an essential work on Bayesian networks and decision graphs. It is an introduction to probabilistic graphical models including Bayesian networks and influence diagrams. The reader is guided through the two types of frameworks with examples and exercises, which also give instruction on how to build these models. Structured in two parts, the first section focuses on probabilistic graphical models, while the second part deals with decision graphs, and in addition to the frameworks described in the previous edition, it also introduces Markov decision process and partially ordered decision problems.

Random Walks on Infinite Graphs and Groups

Random Walks on Infinite Graphs and Groups
Author: Wolfgang Woess
Publisher: Cambridge University Press
Total Pages: 350
Release: 2000-02-13
Genre: Mathematics
ISBN: 0521552923

The main theme of this book is the interplay between the behaviour of a class of stochastic processes (random walks) and discrete structure theory. The author considers Markov chains whose state space is equipped with the structure of an infinite, locally finite graph, or as a particular case, of a finitely generated group. The transition probabilities are assumed to be adapted to the underlying structure in some way that must be specified precisely in each case. From the probabilistic viewpoint, the question is what impact the particular type of structure has on various aspects of the behaviour of the random walk. Vice-versa, random walks may also be seen as useful tools for classifying, or at least describing the structure of graphs and groups. Links with spectral theory and discrete potential theory are also discussed. This book will be essential reading for all researchers working in stochastic process and related topics.

Random Trees

Random Trees
Author: Michael Drmota
Publisher: Springer Science & Business Media
Total Pages: 466
Release: 2009-04-16
Genre: Mathematics
ISBN: 3211753575

The aim of this book is to provide a thorough introduction to various aspects of trees in random settings and a systematic treatment of the mathematical analysis techniques involved. It should serve as a reference book as well as a basis for future research.

Probabilistic Reasoning in Intelligent Systems

Probabilistic Reasoning in Intelligent Systems
Author: Judea Pearl
Publisher: Elsevier
Total Pages: 573
Release: 2014-06-28
Genre: Computers
ISBN: 0080514898

Probabilistic Reasoning in Intelligent Systems is a complete and accessible account of the theoretical foundations and computational methods that underlie plausible reasoning under uncertainty. The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic. The author distinguishes syntactic and semantic approaches to uncertainty--and offers techniques, based on belief networks, that provide a mechanism for making semantics-based systems operational. Specifically, network-propagation techniques serve as a mechanism for combining the theoretical coherence of probability theory with modern demands of reasoning-systems technology: modular declarative inputs, conceptually meaningful inferences, and parallel distributed computation. Application areas include diagnosis, forecasting, image interpretation, multi-sensor fusion, decision support systems, plan recognition, planning, speech recognition--in short, almost every task requiring that conclusions be drawn from uncertain clues and incomplete information. Probabilistic Reasoning in Intelligent Systems will be of special interest to scholars and researchers in AI, decision theory, statistics, logic, philosophy, cognitive psychology, and the management sciences. Professionals in the areas of knowledge-based systems, operations research, engineering, and statistics will find theoretical and computational tools of immediate practical use. The book can also be used as an excellent text for graduate-level courses in AI, operations research, or applied probability.