|
DRUM >
Institute for Systems Research >
Institute for Systems Research Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1903/9403
|
| Title: | On the existence of triangles in random key graphs |
| Authors: | Yagan, Osman
Makowski, Armand M. |
| Type: | Article |
| Keywords: | Wireless sensor networks
Zero-one laws
Key predistribution
Random key graphs
Graph containment
Existence of triangles |
| Issue Date: | 4-Jul-2009 |
| Series/Report no.: | TR_2009-10 |
| Abstract: | The 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. |
| URI: | http://hdl.handle.net/1903/9403 |
| Appears in Collections: | Institute for Systems Research Technical Reports
|
All items in DRUM are protected by copyright, with all rights reserved.
|
