Random Graphs

by V. F. Kolchin

Overview

The book is devoted to the study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields. The author shows how the application of the generalized scheme of allocation in the study of random graphs and permutations reduces the combinatorial problems to classical problems of probability theory on the summation of independent random variables. He offers recent research by Russian mathematicians, including a discussion of equations containing an unknown permutation, and the first English-language presentation of techniques for solving systems of random linear equations in finite fields. These new results will interest specialists in combinatorics and probability theory and will also be useful to researchers in applied areas of probabilistic combinatorics such as communication theory, cryptology, and mathematical genetics.

Product Details

ISBN-13:	9780521440813
Publisher:	Cambridge University Press
Publication date:	11/13/1998
Series:	Encyclopedia of Mathematics and its Applications , #53
Pages:	268
Product dimensions:	6.38(w) x 9.57(h) x 0.87(d)

Table of Contents

Preface; 1. The generalized scheme of allocation and the components of random graphs; 2. Evolution of random graphs; 3. Systems of random linear equations in GF(2); 4. Random permutations; 5. Equations containing an unknown permutation; Bibliography; Index.

Editorial Reviews

"...those designing and anlyzing such algorithms will find [this book] essential." Computing Reviews

From the Publisher