Random Graphs
Seiten
1998
Cambridge University Press (Verlag)
978-0-521-44081-3 (ISBN)
Cambridge University Press (Verlag)
978-0-521-44081-3 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Zu diesem Artikel existiert eine Nachauflage
A study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields, concentrating on research by Russian mathematicians. The book shows how to reduce combinatorial problems to classical problems of probability theory on the summation of independent random variables.
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.
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.
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.
| Erscheint lt. Verlag | 13.11.1998 |
|---|---|
| Reihe/Serie | Encyclopedia of Mathematics and its Applications |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 162 x 243 mm |
| Gewicht | 580 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| ISBN-10 | 0-521-44081-5 / 0521440815 |
| ISBN-13 | 978-0-521-44081-3 / 9780521440813 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices
Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95
