Can a Christian escape from a lion? How quickly can a rumour spread? This collection of problems is designed to be sipped from, rather than consumed in one sitting. Whether you are an expert, a beginner or an amateur, this book will delight for a lifetime.
In this book, first published in 2006, the authors' main aims are first to present classical results in a way that's accessible to non-specialists. Second, to describe results of Smirnov in conformal invariance. It is essential reading for all working in this exciting area.
In this second edition of the now classic text, the already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents a comprehensive account of random graph theory. The theory (founded by Erdos and Renyi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.
Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.
Genom att registrera dig accepterar du vår personuppgiftspolicy.
