Random Graphs: 53 (Encyclopedia of Mathematics and its Applications, Series Number 53)

Kolchin, V. F.

ISBN 10: 0521440815 / ISBN 13: 9780521440813

Published by Cambridge University Press, 1999

About this Item

Results of research on classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields. Series Editor(s): Rota, Gian-Carlo; Doran, B.; Ismail, M.; Lam, T. Y.; Wutwak, E.; Flajolet, Philippe; Lutwak, E. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 268 pages, 4 line figures. BIC Classification: PBT; PBV. Category: (P) Professional & Vocational. Dimension: 241 x 160 x 23. Weight in Grams: 560. . 1999. Illustrated. hardcover. . . . .

Seller Inventory # V9780521440813

Bibliographic Details

• Title: Random Graphs: 53 (Encyclopedia of Mathematics and its Applications, Series Number 53)
• Publisher: Cambridge University Press
• Publication Date: 1999
• Language: English
• ISBN 10: 0521440815
• ISBN 13: 9780521440813
• Binding: Hardcover
• Condition: New

About this title

Synopsis

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.

Book Description

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 to reduce combinatorial problems to classical problems of probability theory on the summation of independent random variables. He concentrates on recent research by Russian mathematicians, including 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 in applied areas of probabilistic combinatorics such as communication theory, cryptology, and mathematical genetics.