Very sharp transitions in one-dimensional MANETs

@article{Han2006VeryST,
  title={Very sharp transitions in one-dimensional MANETs},
  author={Guang Han and Armand M. Makowski},
  journal={2006 IEEE International Conference on Communications},
  year={2006},
  volume={1},
  pages={217-222}
}
We investigate how quickly phase transitions can occur in one-dimensional geometric random graph models of MANETs. In the case of graph connectivity and the absence of isolated nodes, we show that the transition width behaves like n-1 (when the number n of nodes is large), a significant improvement over asymptotic bounds given recently by Goel et al. for arbitrary monotone graph properties. We also outline how the approach used here could be applied in higher dimensions and for other graph… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Order Statistics (Third Edition), Wiley Series in Probability and Statistics

  • H. A. David, H. N. Nagaraja
  • 2003

The connectivity of a graph on uniform points on [0, 1]d

  • M.J.B. Appel, R. P. Russo
  • Statisitcs & Probability Letters 60 (2002), pp…
  • 2002
1 Excerpt

Random Graphs, Wiley- Interscience Series in Discrete Mathematics and Optimization

  • S. Janson, T. Luczak, A. Rucinski
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…