Random Graphs
Part of Encyclopedia of Mathematics and its Applications
- Author: V. F. Kolchin, Steklov Institute of Mathematics, Moscow
- Date Published: September 2009
- availability: Available
- format: Paperback
- isbn: 9780521119689
Paperback
Other available formats:
Hardback, eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- Presents many important Russian results in English
- Unified approach shows connections between combinatorial problems, graph theory, and classical probability theory
Reviews & endorsements
Review of the hardback: 'Many of the results appear here for the first time in an English translation. The book is therefore to be welcomed for bringing this material to a wider audience.' W. T. Gowers, Bulletin of the London Mathematical Society
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: September 2009
- format: Paperback
- isbn: 9780521119689
- length: 268 pages
- dimensions: 234 x 156 x 14 mm
- weight: 0.38kg
- availability: Available
Table of Contents
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.
Related Books
related journals
also by this author
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×