+612 9045 4394
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Probabilistic Combinatorics and Its Applications : Proceedings of Symposia in Applied Mathematics - Bela Bollobas

Probabilistic Combinatorics and Its Applications

Proceedings of Symposia in Applied Mathematics

By: Bela Bollobas (Editor)

Hardcover Published: January 1992
ISBN: 9780821855003
Number Of Pages: 212

Share This Book:


RRP $92.40
or 4 easy payments of $21.31 with Learn more
Ships in 5 to 6 business days

Earn 171 Qantas Points
on this Book

Probabilistic methods have become a vital tool in the arsenal of every combinatorialist. The theory of random graphs is still a prime area for the use of probabilistic methods, and, over the years, these methods have also proved of paramount importance in many associated areas such as the design and analysis of computer algorithms. In recent years, probabilistic combinatorics has undergone revolutionary changes as the result of the appearance of some exciting new techniques such as martingale inequalities, discrete isoperimetric inequalities, Fourier analysis on groups, eigenvalue techniques, branching processes, and rapidly mixing Markov chains. The aim of this volume is to review briefly the classical results in the theory of random graphs and to present several of the important recent developments in probabilistic combinatorics, together with some applications. The first paper contains a brief introduction to the theory of random graphs. The second paper reviews explicit constructions of random-like graphs and discusses graphs having a variety of useful properties. Isoperimetric inequalities, of paramount importance in probabilistic combinatorics, are covered in the third paper. The chromatic number of random graphs is presented in the fourth paper, together with a beautiful inequality due to Janson and the important and powerful Stein-Chen method for Poisson approximation. The aim of the fifth paper is to present a number of powerful new methods for proving that a Markov chain is "rapidly mixing" and to survey various related questions, while the sixth paper looks at the same topic in a very different context. For the random walk on the cube, the convergence to the stable distribution is best analysed through Fourier analysis; the final paper examines this topic and proceeds to several more sophisticated applications. Open problems can be found throughout each paper.

Random graphs
Constructing random-like graphs
Discrete isoperimetric inequalities
Random graphs revisited
Rapidly mixing Markov chains
Computing the volume of convex bodies: A case where randomness provably helps
Finite Fourier methods: Access to tools
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780821855003
ISBN-10: 082185500X
Series: Proceedings of Symposia in Applied Mathematics
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 212
Published: January 1992
Publisher: American Mathematical Society
Country of Publication: US
Dimensions (cm): 26.67 x 18.42  x 1.91
Weight (kg): 0.61

Earn 171 Qantas Points
on this Book