National Science Library of Georgia

Image from Google Jackets

Random graphs / V.F. Kolchin.

By: Material type: TextTextSeries: Encyclopedia of mathematics and its applications ; v. 53.Publisher: Cambridge : Cambridge University Press, 1999Description: 1 online resource (xi, 252 pages) : digital, PDF file(s)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780511721342 (ebook)
Subject(s): Additional physical formats: Print version: : No titleDDC classification:
  • 511/.5 21
LOC classification:
  • QA166.17 .K65 1999
Online resources:
Contents:
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.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

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.

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.

There are no comments on this title.

to post a comment.
Copyright © 2023 Sciencelib.ge All rights reserved.