Mathematics – Probability
Scientific paper
2006-04-27
Mathematics
Probability
Communicated to 'Stochastic Processes and Their Applications'. Sep. 11, 2006: replaced paper uploaded on Apr. 27, 2006 by a co
Scientific paper
Let n points be placed independently in d-dimensional space according to the densities $f(x) = A_d e^{-\lambda \|x\|^{\alpha}}, \lambda > 0, x \in \Re^d, d \geq 2.$ Let $d_n$ be the longest edge length for the nearest neighbor graph on these points. We show that $(\log(n))^{1-1/\alpha}d_n -b_n$ converges weakly to the Gumbel distribution where $b_n \sim \log \log n.$ We also show that the strong law result, % \lim_{n \to \infty} \frac{(\lambda^{-1}\log(n))^{1-1/\alpha}d_n}{\sqrt{\log \log n}} \to \frac{d}{\alpha \lambda}, a.s. % Thus, the exponential rate of decay i.e. $\alpha = 1$ is critical, in the sense that for $\alpha > 1, d_n \to 0,$ where as $\alpha < 1, d_n \to \infty$ a.s. as $n \to \infty.$
Gupta Bhupendra
Iyer Srikanth K.
No associations
LandOfFree
Criticality of the Exponential Rate of Decay for the Largest Nearest Neighbor Link in Random Geometric Graph has received 1 rating(s) and 1 review(s), resulting in an average rating of 5.00 on a scale from 1 to 5. The overall rating for this scientific paper is superior.
If you have personal experience with Criticality of the Exponential Rate of Decay for the Largest Nearest Neighbor Link in Random Geometric Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Criticality of the Exponential Rate of Decay for the Largest Nearest Neighbor Link in Random Geometric Graph will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-21030