Vertex degree of random geometric graph on exponentially distributed points (Q731943)

Let \(X_1,X_2,\dots\) be independent \(d-\)dimensional random vectors, where the components of \(X_i,i=1,2,\dots,\) are i.i.d. exponentially distributed with parameter \(\lambda\). For each \(y\) and \(n \geq 1\), define \(G_n(y)\) as the random graph having \(V_n=\{X_1,\dots,X_n\}\) as the vertex set, and with an edge connecting each pair of vertices \(X_i\) and \(X_j\) in \(V_n\) at distance \(\| X_i-X_j\| \leq y\), where \(\|\cdot \|\) is the \(l_{\infty}\) norm. Let \[ \deg X_{n,i}(y)=\sum_{1 \leq j \not= i \leq n} 1_{\{ \| X_i-X_j\| \leq y\}}, \] \(1 \leq i \leq n\), be the degree of vertex \(X_i\) in the random graph \(G_n(y)\). The author obtains almost-sure asymptotic rates of convergence/divergence for the maximum and minimum vertex degrees of graph, when edge distance \(y=y_n\) varies with the number \(n\) of vertices.