The Weak Zero-One Law for the Random Distance Graphs
Maksim Evgen'evich Zhukovskii · Theory of Probability and Its Applications · 2011
The paper proves a new version of the zero-one law for a wide class of random distance graphs arising in many problems of combinatorial geometry. It is shown that the classical zero-one law is not fulfilled for graphs under consideration. However, the weakened version of this law holds.