On zero-one laws for connectivity in one-dimensional geometric random graphs

Simple item page
dc.contributor.advisorMakowskien_US
dc.contributor.authorHan, Guangen_US
dc.contributor.authorMakowski, Armand M.en_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US
dc.date.accessioned2007-05-23T10:18:41Z
dc.date.available2007-05-23T10:18:41Z
dc.date.issued2006en_US
dc.description.abstractWe consider the geometric random graph where n points are distributed uniformly and independently on the unit interval [0,1]. Using the method of first and second moments, we provide a simple proof of the "zero-one" law for the property of graph connectivity under the asymptotic regime created by having n become large and the transmission range scaled appropriately with n.en_US
dc.format.extent116812 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6596
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2006-1en_US
dc.relation.ispartofseriesCSHCN; TR 2006-1en_US
dc.subjectSensor-Actuator Networksen_US
dc.titleOn zero-one laws for connectivity in one-dimensional geometric random graphsen_US
dc.typeTechnical Reporten_US

Files

Original bundle

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

Collections

Institute for Systems Research Technical Reports