From the author of The Quest for the Original Horse Whisperers (1 84282 020 6) Russell Lyon has written his memoirs as a country vet. From his first day in the job, practising lassoing animals on an oil drum, to his thoughts on current veterinary trends, animal rights and farming this is an entertaining and absorbing read. Full of anecdotes, incidents and characterful patients and customers.

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.

The book tells the story of the Secret Society of Horsemen who were the Original Horse Whisperers. The Societies were formed originally in Scotland about two hundred years ago but spread throughout Britain and then across to Canada, United States and Australia. The roots of the Society are obscure but many of the customs and oaths go back to pagan times. The horsemen who formed these groups exploited their membership much like a primitive trade union and tried to use their membership to improve conditions on the farm for themselves and their horses.

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.