Random Graphs by V F Kolchin
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.-
The Theory of Partitions
-
The Banach-Tarski Paradox
-
Special Functions
-
Equivalents of the Riemann Hypothesis: Volume 1, Arithmetic Equivalents
-
Non-Associative Normed Algebras
-
Finite Precision Number Systems and Arithmetic
-
The Classical Fields
-
Handbook of Constructive Mathematics
-
Aperiodic Order: Volume 2, Crystallography and Almost Periodicity
-
Polynomials with Special Regard to Reducibility
-
Boolean Functions
-
Categorical Foundations
-
Introduction to the Network Approximation Method for Materials Modeling
-
Proof Complexity
-
Asymptotic Analysis of Random Walks
-
Contact Geometry and Nonlinear Differential Equations
-
Lie's Structural Approach to PDE Systems
-
Sub-Riemannian Geometry
-
Combinatorics, Automata and Number Theory
-
Variational Methods for Nonlocal Fractional Problems
-
Ergodic Control of Diffusion Processes
-
Algorithmic Aspects of Graph Connectivity
-
Topics in Algorithmic Graph Theory
-
Exact and Approximate Controllability for Distributed Parameter Systems
-
Mathematics of the Bond Market
-
Orthogonal Polynomials in the Spectral Analysis of Markov Processes
-
Real Analysis through Modern Infinitesimals
-
Introduction to Radon Transforms
-
Lattice Sums Then and Now
-
The Racah-Wigner Algebra in Quantum Theory
-
Boolean Models and Methods in Mathematics, Computer Science, and Engineering
-
Exact Constants in Approximation Theory
-
An Algebraic Introduction to K-Theory
-
Solving Polynomial Equation Systems IV: Volume 4, Buchberger Theory and Beyond
-
Infinite Dimensional Optimization and Control Theory
-
Banach Algebras and the General Theory of *-Algebras: Volume 1, Algebras and Banach Algebras
-
Geometry of Sporadic Groups: Volume 2, Representations and Amalgams
-
Ultrametric Pseudodifferential Equations and Applications
-
Compound Renewal Processes
-
General Orthogonal Polynomials
-
The Theory of Information and Coding
-
Convex Polytopes and Polyhedra
-
Stopping Times and Directed Processes
-
Nonnegative Matrices and Applications
Review of the hardback: 'Many of the results appear here for the first time in an English translationThe book is therefore to be welcomed for bringing this material to a wider audience.' W. T. Gowers, Bulletin of the London Mathematical Society
| SKU | Unavailable |
| ISBN 13 | 9780521119689 |
| ISBN 10 | 0521119685 |
| Title | Random Graphs |
| Author | V F Kolchin |
| Series | Encyclopedia Of Mathematics And Its Applications |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Cambridge University Press |
| Year published | 2009-09-17 |
| Number of pages | 268 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |