@article {IOPORT.05706693,
    author       = {Devroye, Luc and Gudmundsson, Joachim and Morin, Pat},
    title        = {On the expected maximum degree of Gabriel and Yao graphs.},
    year         = {2009},
    journal      = {Advances in Applied Probability},
    volume       = {41},
    number       = {4},
    issn         = {0001-8678},
    pages        = {1123-1140},
    publisher    = {Applied Probability Trust, Sheffield},
    doi          = {10.1239/aap/1261669589},
    abstract     = {Summary: Motivated by applications of Gabriel graphs and Yao graphs in wireless ad-hoc networks, we show that the maximum degree of a random Gabriel graph or Yao graph defined on $n$ points drawn uniformly at random from a unit square grows as $\Theta ( \log n / \log \log n)$ in probability.},
    identifier   = {05706693},
}