A strong zero-one law for connectivity in one-dimensional geometric random graphs with non-vanishing densities

Simple item page
dc.contributor.advisorMakowski, Armand M.en_US
dc.contributor.authorHan, Guangen_US
dc.contributor.authorMakowski, Armand M.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T10:19:14Z
dc.date.available2007-05-23T10:19:14Z
dc.date.issued2007en_US
dc.description.abstractWe consider the geometric random graph where n points are distributed independently on the unit interval [0,1] according to some probability distribution function F. Two nodes communicate with each other if their distance is less than some transmission range. When F admits a continuous density f which is strictly positive on [0,1], we show that the property of graph connectivity exhibits a strong critical threshold and we identify it. This is achieved by generalizing a limit result on maximal spacings due to Levy for the uniform distribution.en_US
dc.format.extent167819 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6624
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2007-8en_US
dc.titleA strong zero-one law for connectivity in one-dimensional geometric random graphs with non-vanishing densitiesen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2007-8.pdf
Size:
163.89 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports