Vertex degree of random geometric graph on exponentially distributed points

摘要

In this article, we consider exponential random geometric graph, in d-dimensional space (d >= 2). The main results are almost-sure asymptotic rates of convergence/divergence for the maximum and minimum vertex degrees of graph, when edge distance varies with the number of vertices.