Random graphs
By: V.F. Kolchin.
Series: Encyclopedia of mathematics and its applications ;; v. 53
Publisher: Cambridge University Press
Published: 1999
Place of publication: Cambridge, UK; New York
Language: eng
Number of pages: 252
Subjects: Random graphs.
Description: This 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 concentrates on research by Russian mathematicians, including a discussion of equations containing an unknown permutation and a presentation of techniques for solving systems of random linear equations in finite fields. These results will interest specialists in combinatorics and probability theory and will also be useful in applied areas of probabilistic combinatorics such as communication theory, cryptology, and mathematical genetics.
Notes: Includes bibliographical references (p. [241]-249) and index.