The weak zero-one laws for the random distance graphs
β Scribed by M. E. Zhukovskii
- Book ID
- 111455019
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 2010
- Tongue
- English
- Weight
- 221 KB
- Volume
- 81
- Category
- Article
- ISSN
- 1064-5624
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We look at a competitor of the ErdosαRenyi models of random graphs, one ΛαΊ Ε½ .x proposed in E. Gilbert J. Soc. Indust. Appl. Math. 9:4, 533α543 1961 : given β¦ ) 0 and a metric space X of diameter ) β¦ , scatter n vertices at random on X and connect those of distance -β¦ apart: we get a random graph G
Natural languages and random structures are given for which there are sentences A with no limit probability, yet for every A the difference between the probabilities that A holds on random structures of sizes n and n + 1 approaches zero with n.
Let mlzk be a median of X,, and put S, = X,, + + X , + . . . +Xnkrt-A,, where {A,, n= 1, 2, . . .} is a sequence of constants. S, and X,, are subject to F, and F,,, respectively. The problem is the existence of a non-defective limit distribution for {Fn, n = 1, 2, . . .} in the sence of weak conver