Random Graphs

Erscheinungsjahr 2007
ISBN: 978-0-521-44081-3
Verlag: Cambridge University Press

Buch, Englisch, Band 53, 268 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 570 g

Reihe: Encyclopedia of Mathematics and its Applications

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.

Autoren/Hrsg.

Kolchin, V. F.

Rota, G. -C

Doran, B.

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik Mathematik Operations Research Graphentheorie

Inhaltsverzeichnis

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.