Random graphs.
The book is devoted to random graphs, random permutations, systems of random linear equations in finite fields, and equations involving a permutation as an unknown variable. These topics are presented under an unified approach based on the generalized placement scheme where many combinatorial problems are reduced to some estimations of the sums of independent random variables. The book consists of five chapters. The first chapter entitled ``Generalized placement scheme and components of random graphs is devoted to the introduction to the computational combinatorial methods. These methods are applied to computing the size of the components in a random forest and to some problems on graphs with components of special type. The second chapter ``Random graph evolution contains various results on precritical and critical graphs and graphs with independent edges. The third chapter ``Systems of random linear equations in \(\mathrm{GF}(2)\) is devoted to the problems related to the rank of a random matrix, consistency of systems of random linear equations and their applications to cycles and hypercycles in related graphs. The last two chapters study various aspects of random permutations and equations involving random permutations.
- Random graphs.
- scientific article; zbMATH DE number 18978
- scientific article; zbMATH DE number 1231233
- scientific article; zbMATH DE number 1540669
- Random Graphs
- scientific article; zbMATH DE number 863475
- scientific article; zbMATH DE number 5610906
- scientific article; zbMATH DE number 3875330
- scientific article; zbMATH DE number 3904630
- scientific article; zbMATH DE number 857026
- Gigantic component in random distance graphs of special form
- On threshold probability for the stability of independent sets in distance graphs
- New upper bound for the chromatic number of a random subgraph of a distance graph
- On the number of components of fixed size in a random \(A\)-mapping
- Colorings of partial Steiner systems and their applications
- A probabilistic scheme of independent random elements distributed over a finite lattice. II: The method of lattice moments
- Systems of random equations over finite algebraic structures
- Independence numbers of random subgraphs of a distance graph
- Universal zero-one k-law
- Independence numbers of random subgraphs of distance graphs
- scientific article; zbMATH DE number 1231233 (Why is no real title available?)
- Small subgraphs and their extensions in a random distance graph
- Conditional configuration graphs with discrete power-law distribution of vertex degrees
- Properties of random systems of discrete equations with nonuniform sampling of unknowns
- Satisfiability of random systems of equations with nonuniform sampling of two-valued unknowns
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
- Characterization of the Poisson distribution via its first two moments
- On the number of \(A\)-mappings
This page was built for publication: Random graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723297)
