Institute for Systems Research Technical Reports

Permanent URI for this collectionhttp://hdl.handle.net/1903/4376

This archive contains a collection of reports generated by the faculty and students of the Institute for Systems Research (ISR), a permanent, interdisciplinary research unit in the A. James Clark School of Engineering at the University of Maryland. ISR-based projects are conducted through partnerships with industry and government, bringing together faculty and students from multiple academic departments and colleges across the university.

Browse

Filters

20081

Settings

Author: search.filters.author.Han, GuangSubject: search.filters.subject.Zero-one laws

Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Connectivity in one-dimensional geometric random graphs: Poisson approximations, zero-one laws and phase transitions
    (2008-10-24) Han, Guang; Makowski, Armand M.; Makowski, Armand M.
    Consider n points (or nodes) distributed uniformly and independently on the unit interval [0,1]. Two nodes are said to be adjacent if their distance is less than some given threshold value.For the underlying random graph we derive zero-one laws for the property of graph connectivity and give the asymptotics of the transition widths for the associated phase transition. These results all flow from a single convergence statement for the probability of graph connectivity under a particular class of scalings. Given the importance of this result, we give two separate proofs; one approach relies on results concerning maximal spacings, while the other one exploits a Poisson convergence result for the number of breakpoint users.