46 citations · 319 across the 26 of their papers we have counts for
4 papers · 2 filters
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…
Threshold Functions in Random s-Intersection Graphs
Jun Zhao, Osman Yağan, Virgil Gligor
Random -intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in s…