RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2011 Volume 47, Issue 3, Pages 39–58 (Mi ppi2053)

This article is cited in 6 papers

Large Systems

On a sequence of random distance graphs subject to the zero-one law

M. E. Zhukovskii

Probability Theory Chair, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University

Abstract: It is known that an Erdős–Rényi random graph obeys a zero-one law for first-order properties. The study of these laws started in 1969 with the work of Yu. V. Glebskii, D. I. Kogan, M. I. Liogon'kii, and V. A. Talanov. We proved in our previous works that a random distance graph does not obey the zero-one law. In this paper a sequence of random distance graphs obeying the zero-one law is obtained.

UDC: 621.391.1+519.1

Received: 07.12.2010
Revised: 10.05.2011


 English version:
Problems of Information Transmission, 2011, 47:3, 251–268

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025