A. A. Mironov Sov. J. Comput. Syst. Sci. , vol.29 No.3 , 01.1991 , p. 51-59, language: английский ISSN 0882-4002  Аннотация The concept of a random graph from a class with a given set of degrees of the vertices is introduced, and the probabilities of adjacency are determined for arbitrary vertices. A system of linear equations and inequalities is derived that estimates the probabilities of adjacency for any two vertices of a random graph. Necessary and sufficient conditions are derived for the probability of adjacency of certain of the pairs to be equal to zero or unity for the set of degrees of vertices. An algorithm based on conditional probabilities is constructed enabling more precise determination of the probabilities of adjacency of the vertices.  Ключевые слова random graph; probabilities of adjacency; degrees of vertices