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

Kolchin, V. F.

ISBN 10: 0521440815 / ISBN 13: 9780521440813

Published by Cambridge University Press, 1998

About this Item

Random Graphs by V. F. Kolchin is a fascinating exploration of classical combinatorial structures. Let s delve into the key aspects covered in this book: Generalized Allocation Scheme and Random Graph Components: The study of random graphs involves examining their properties, connectivity, and various structural aspects. These graphs are generated randomly, leading to intriguing patterns and characteristics. Evolution of Random Graphs Systems of Random Linear Equations in GF(2) The study of such systems involves understanding how solutions are distributed and how they relate to combinatorial structures. Permutations play a crucial role in various mathematical contexts, and their study has practical applications in fields like cryptography and data compression. In summary, Random Graphs provides a rich exploration of classical combinatorial structures, making it a valuable resource for mathematicians, researchers, and anyone intrigued by the fascinating world of randomness and connectivity.".

Seller Inventory # 45

Bibliographic Details

• Title: Random Graphs (Encyclopedia of Mathematics and its Applications, Series Number 53)
• Publisher: Cambridge University Press
• Publication Date: 1998
• Language: English
• ISBN 10: 0521440815
• ISBN 13: 9780521440813
• Binding: Hardcover
• Edition: 1st Edition.
• Condition: As New
• Dust Jacket Condition: As New
• Seller catalogs:
  • Science

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.