Show simple item record

A zero-one law for the existence of triangles in random key graphs

dc.contributor.authorYagan, Osman
dc.contributor.authorMakowski, Armand
dc.description.abstractRandom 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 graphs we show the existence of a zero-one law for the appearance of triangles, and identify the corresponding critical scaling. This is done by applying the method of first and second moments to the number of triangles in the graph.en_US
dc.description.sponsorshipThis work was supported by NSF Grant CCF-07290en_US
dc.subjectRandom key graphsen_US
dc.subjectUniform intersection graphsen_US
dc.subjectExistence of trianglesen_US
dc.subjectZero-one lawsen_US
dc.subjectCritical scalingsen_US
dc.titleA zero-one law for the existence of triangles in random key graphsen_US
dc.typeTechnical Reporten_US
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

Files in this item


This item appears in the following Collection(s)

Show simple item record