Sprache: Englisch
Verlag: Cambridge University Press, 2017
ISBN 10: 1107160154 ISBN 13: 9781107160156
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 82,56
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2017
ISBN 10: 1107160154 ISBN 13: 9781107160156
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 118,83
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. Consolidating over sixty years of research, this authoritative account of probability on networks is indispensable to anyone in the field. Series: Cambridge Series in Statistical and Probabilistic Mathematics. Num Pages: 600 pages, 78 b/w illus. 13 colour illus. 4 tables 864 exercises. BIC Classification: PBT. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 253 x 177 x 44. Weight in Grams: 1383. . 2017. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 133,75
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 699 pages. 11.00x8.00x1.75 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2017
ISBN 10: 1107160154 ISBN 13: 9781107160156
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.