On the existence of triangles in random key graphs

Simple item page
dc.contributor.authorYagan, Osman
dc.contributor.authorMakowski, Armand M.
dc.date.accessioned2009-07-06T15:39:42Z
dc.date.available2009-07-06T15:39:42Z
dc.date.issued2009-07-04
dc.description.abstractThe random key graph, also known as the uniform random intersection graph, is a random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We show the existence of a zero-one law for the appearance of triangles in random key graphs by applying the method of first and second moments to the number of triangles in the graph.en
dc.description.sponsorshipNational Science Foundation,Computing and Communications - Theoretical Foundationsen
dc.format.extent430947 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/9403
dc.language.isoen_USen
dc.relation.isAvailableAtInstitute for Systems Researchen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us
dc.relation.ispartofseriesTR_2009-10en
dc.subjectWireless sensor networksen
dc.subjectZero-one lawsen
dc.subjectKey predistributionen
dc.subjectRandom key graphsen
dc.subjectGraph containmenten
dc.subjectExistence of trianglesen
dc.titleOn the existence of triangles in random key graphsen
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
YaganMakowskiTriangle_edited.pdf
Size:
420.85 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports