Percolation, Connectivity, Coverage and Colouring of Random Geometric Graphs

  • Balister P
  • Sarkar A
  • Bollobás B
N/ACitations
Citations of this article
39Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this review paper, we shall discuss some recent results concerning severalmodels of random geometric graphs, including the Gilbert disc model Gr, thek-nearest neighbour model Gnn and the Voronoi model GP . Many of the results kconcern finite versions of these models. In passing, we shall mention some of the applications to engineering and biology.

Cite

CITATION STYLE

APA

Balister, P., Sarkar, A., & Bollobás, B. (2008). Percolation, Connectivity, Coverage and Colouring of Random Geometric Graphs (pp. 117–142). https://doi.org/10.1007/978-3-540-69395-6_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free