@article{Bourgain1998, author = {Jean Bourgain and Gil Kalai}, title = {Threshold Intervals under Group Symmetries}, journal = {Convex Geometric Analysis MSRI Publications Volume 34}, pages = {59--63}, year = {1998} } @article{Bollobas1987, author = {B{\'{e}}la Bollob{\'{a}}s and Andrew Thomason}, title = {Threshold functions}, journal = {Combinatorica}, volume = {7}, number = {1}, pages = {35--38}, year = {1987} } @inproceedings{Bradonjic2014, author = {Milan Bradonji\'{c} and Will Perkins}, title = {On Sharp Thresholds in Random Geometric Graphs}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM}}, pages = {500--514}, year = {2014} } @article{Godehardt1996, author = {Erhard Godehardt and Jerzy Jaworski}, title = {On the connectivity of a random interval graph}, journal = {Random Struct. Algorithms}, volume = {9}, number = {1-2}, pages = {137--161}, year = {1996} } @Article{Appel2002, author={Appel, Martin J. B. and Russo, Ralph P.}, title={{The connectivity of a graph on uniform points on $[0,1]^d$}}, journal={Statistics \& Probability Letters}, year=2002, volume={60}, number={4}, pages={351-357} } @INPROCEEDINGS{Gupta1998, author = {Piyush Gupta and P. R. Kumar}, title = {Critical Power for Asymptotic Connectivity in Wireless Networks}, booktitle = {Stochastic Analysis, Control, Optimization and Applications}, year = {1998}, pages = {547--566} } @book{penrose2003random, title={Random geometric graphs}, author={Mathew D. Penrose}, volume={5}, year={2003}, publisher={Oxford University Press Oxford} } @article{penrose1997longest, title={The longest edge of the random minimal spanning tree}, author={Mathew D. Penrose}, journal={The annals of applied probability}, pages={340--361}, year={1997}, publisher={JSTOR} } @article{gilbert1959random, title={Random graphs}, author={Gilbert, E.}, journal={The Annals of Mathematical Statistics}, pages={1141--1144}, year={1959}, publisher={JSTOR} } @article{gilbert1961random, title={Random plane networks}, author={Gilbert, E.}, journal={Journal of the Society for Industrial \& Applied Mathematics}, volume={9}, number={4}, pages={533--543}, year={1961}, publisher={SIAM} } @article{hall1985coverage, title={On the coverage of $ k $-dimensional space by $ k $-dimensional spheres}, author={Hall, P.}, journal={The Annals of Probability}, volume={13}, number={3}, pages={991--1002}, year={1985}, publisher={Institute of Mathematical Statistics} } @article{janson1986random, title={Random coverings in several dimensions}, author={Janson, S.}, journal={Acta Mathematica}, volume={156}, number={1}, pages={83--118}, year={1986}, publisher={Springer} } @incollection{balister2008percolation, title={Percolation, connectivity, coverage and colouring of random geometric graphs}, author={Balister, P. and Sarkar, A. and Bollob{\'a}s, B.}, booktitle={Handbook of Large-Scale Random Networks}, pages={117--142}, year={2008}, publisher={Springer} } @ARTICLE{Mccolm2001, author = {Gregory L. Mccolm}, title = {Threshold Functions for Random Graphs on a Line Segment}, journal = {Combinatorics, Probability and Computing}, year = {2001}, volume = {13}, pages = {373--387} } @INPROCEEDINGS{Krishnamachari2002, author = {Bhaskar Krishnamachari and Stephen B. Wicker and R\'{a}mon B\'{e}jar and Marc Pearlman}, title = {Critical Density Thresholds in Distributed Wireless Networks}, booktitle = {Communications, information and network security}, year = {2002} } @article{Penrose1999, author = {Mathew D. Penrose}, title = {On $k$-connectivity for a geometric random graph}, journal = {Random Struct. Algorithms}, volume = {15}, number = {2}, pages = {145--164}, year = {1999} } @inproceedings{Panchapakesan2001, title={On the transmission range in dense ad hoc radio networks}, author={Padma Panchapakesan and D Manjunath}, booktitle={Proceedings of IEEE Signal Processing Communication (SPCOM)}, year={2001} } @inproceedings{Lloyd1992, title={On the complexity of link scheduling in multi-hop radio networks}, author={Errol L. Lloyd and S. Ramanathan}, booktitle={Proceedings of 26th Conference on Information Science and Systems}, pages={491--495}, year={1992} } @article{Abu-Affash2015, author = {A. Karim Abu-Affash and Ahmad Biniaz and Paz Carmi and Anil Maheshwari and Michiel Smid}, title = {Approximating the Bottleneck Plane Perfect Matching of a Point Set}, journal = {Comput. Geom.}, year = {to appear} } @article{Abu-Affash2014, author = {A. Karim Abu{-}Affash and Paz Carmi and Matthew J. Katz and Yohai Trabelsi}, title = {Bottleneck non-crossing matching in the plane}, journal = {Comput. Geom.}, volume = {47}, number = {3}, pages = {447--457}, year = {2014} } @book{lin2010probability, title={Probability inequalities}, author={Lin, Z. and Bai, Z.}, year={2010}, publisher={Springer} } @book{spencer1987ten, title={Ten lectures on the probabilistic method}, author={Spencer, J. H.}, volume={52}, year={1987}, publisher={SIAM} } @inproceedings{goel2004sharp, title={Sharp thresholds for monotone properties in random geometric graphs}, author={Goel, A. and Rai, S. and Krishnamachari, B.}, booktitle={Proceedings of STOC}, pages={580--586}, year={2004}, organization={ACM} } @article{friedgut1996every, title={Every monotone graph property has a sharp threshold}, author={Friedgut, E. and Kalai, G.}, journal={Proceedings of the American Mathematical Society}, volume={124}, number={10}, pages={2993--3002}, year={1996} } @article{erd6s1960evolution, title={On the evolution of random graphs}, author={Erd\"{o}s, P. and R{\'e}nyi, A.}, journal={Publ. Math. Inst. Hungar. Acad. Sci}, volume={5}, pages={17--61}, year={1960}, publisher={Citeseer} } @book{alon2004probabilistic, title={The probabilistic method}, author={Alon, N. and Spencer, J. H.}, year={2007}, edition = {3rd}, publisher={John Wiley \& Sons} } @book{bollobas2001random, title={Random graphs}, author={Bollob{\'a}s, B.}, year={2001}, publisher={Cambridge University Press} }