A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Transitional Behavior of q-Composite Random Key Graphs with Applications to Networked Control
[article]

2017
*
arXiv
*
pre-print

Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate a q-composite random key graph, whose construction on n nodes is as follows: each node independently selects a set of K_n different keys uniformly at random from the same pool of P_n distinct keys, and two nodes establish an undirected edge in between if and

arXiv:1708.08313v1
fatcat:5hxmiewadzeafia4vna7mpwkay