Criticality of the exponential rate of decay for the largest nearest neighbor link in random geometric graphs
Material type:
TextPublication details: Bangalore: Department of Mathematics, Indian Institute of Science: 2006Description: Let n points be placed independently in d−dimensional space according to the density f(x) = Ade−λxα ,λ> 0, x ∈ d, d ≥ 2. Let dn be the longest edge length for the nearest neighbor graph on these points. We show that (log n)1−1/αdn − bn converges weakly toISBN: - NULL
| Item type | Current library | Home library | Collection | Call number | Status | Barcode | |
|---|---|---|---|---|---|---|---|
Pre-Prints
|
MATH-LiB General Stack | MATH-LiB | NFIC | MathPP19 (Browse shelf(Opens below)) | Not for loan | MathPP19 |
Total holds: 0
There are no comments on this title.
Log in to your account to post a comment.