207 citations · 1.3k across the 53 of their papers we have counts for
4 papers · 1 filter
Connectivity of inhomogeneous random K-out graphs
Rashad Eletreby, Osman Yağan
We propose inhomogeneous random K-out graphs , where each of the nodes is assigned to one of classes independently with a probability distr…
On -connectivity and minimum vertex degree in random -intersection graphs
Jun Zhao, Osman Yağan, Virgil Gligor
Random -intersection graphs have recently received much interest in a wide range of application areas. Broadly speaking, a random -intersection graph is constructed by first…
A zero-one law for the existence of triangles in random key graphs
Osman Yagan, Armand M. Makowski
Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. For this class of random grap…
Zero-one laws for connectivity in random key graphs
Osman Yagan, Armand M. Makowski
The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of rand…