Shortest path distance in random k-nearest neighbor graphs

Morteza Alamgir, Ulrike von Luxburg. Shortest path distance in random k-nearest neighbor graphs. In Proceedings of the 29th International Conference on Machine Learning, ICML 2012, Edinburgh, Scotland, UK, June 26 - July 1, 2012. icml.cc / Omnipress, 2012. [doi]

@inproceedings{AlamgirL12,
  title = {Shortest path distance in random k-nearest neighbor graphs},
  author = {Morteza Alamgir and Ulrike von Luxburg},
  year = {2012},
  url = {http://icml.cc/discuss/2012/545.html},
  researchr = {https://researchr.org/publication/AlamgirL12},
  cites = {0},
  citedby = {0},
  booktitle = {Proceedings of the 29th International Conference on Machine Learning, ICML 2012, Edinburgh, Scotland, UK, June 26 - July 1, 2012},
  publisher = {icml.cc / Omnipress},
}