𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A very strong zero-one law for connectivity in one-dimensional geometric random graphs

✍ Scribed by Han, G.; Makowski, A.M.

Book ID
117886363
Publisher
IEEE
Year
2007
Tongue
English
Weight
95 KB
Volume
11
Category
Article
ISSN
1089-7798

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Very weak zero one law for random graphs
Very weak zero one law for random graphs with order and random binary functions
✍ Saharon Shelah πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 450 KB πŸ‘ 1 views

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.

On k-connectivity for a geometric random
On k-connectivity for a geometric random graph
✍ Mathew D. Penrose πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 255 KB πŸ‘ 1 views

For n points uniformly randomly distributed on the unit cube in d dimensions, ## Ε½ . with dG 2, let respectively, denote the minimum r at which the graph, obtained by n n adding an edge between each pair of points distant at most r apart, is k-connected Ε½ . w x respectively, has minimum degree k