46 citations · 319 across the 26 of their papers we have counts for
8 papers · 1 filter
On connectivity in a general random intersection graph
Jun Zhao
There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graph $\mathbb{G}(n,\overrightarrow{a}, \…
Connectivity in Secure Wireless Sensor Networks under Transmission Constraints
Jun Zhao, Osman Yağan, Virgil Gligor
In wireless sensor networks (WSNs), the Eschenauer-Gligor (EG) key pre-distribution scheme is a widely recognized way to secure communications. Although connectivity properties of…
Random intersection graphs and their applications in security, wireless communication, and social networks
Jun Zhao, Osman Yağan, Virgil Gligor
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predist…
A curious gap in one-dimensional geometric random graphs between connectivity and the absence of isolated node
Jun Zhao, Osman Yağan, Virgil Gligor
One-dimensional geometric random graphs are constructed by distributing nodes uniformly and independently on a unit interval and then assigning an undirected edge between any t…
Monotone Increasing Properties and Their Phase Transitions in Uniform Random Intersection Graphs
Jun Zhao, Osman Yağan, Virgil Gligor
Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with nodes is constructed as follows:…
k-Connectivity of Random Key Graphs
Jun Zhao, Osman Yağan, Virgil Gligor
Random key graphs represent topologies of secure wireless sensor networks that apply the seminal Eschenauer-Gligor random key predistribution scheme to secure communication between…