Zero-one law for connectivity in superposition of random key graphs on random geometric graphs (Q1723597)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7025574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Zero-one law for connectivity in superposition of random key graphs on random geometric graphs |
scientific article; zbMATH DE number 7025574 |
Statements
Zero-one law for connectivity in superposition of random key graphs on random geometric graphs (English)
0 references
19 February 2019
0 references
Summary: We study connectivity property in the superposition of random key graph on random geometric graph. For this class of random graphs, we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here strengthen recent work by the \textit{B. S. Krishnan} et al. [``On connectivity thresholds in superposition of random key graphs on random geometric graphs'', in: Proceedings of the IEEE international symposium on information theory, ISIT '13. Piscataway, NJ: IEEE. 2389--2393 (2013; \url{doi:10.1109/ISIT.2013.6620654})].
0 references
0.7822786569595337
0 references
0.740321695804596
0 references
0.734458327293396
0 references
0.7170769572257996
0 references
0.7096996903419495
0 references
