MHB Book Recommendation for Nearest Neighbor Graphs

Bingk1
Messages
16
Reaction score
0
Hello,

I'm trying to read a paper titled "Cluster Identification in Nearest Neighbor Graphs". It's a mixture of probability, graph theory, and topology. I'm having difficulty interpreting some of the ideas, specially when it comes to k nearest neighbor graphs.
I've been trying to look for a book that is a sort of "introduction" to these types of graphs, but haven't been able to find any. Most are either too basic, or too advanced. Could someone recommend some literature on this subject?

Thanks!

P.S. I have been looking for graph theory books that cover this topic, but it just occurred to me that this topic (which is about graphs) might be better covered by another area of math (maybe statistics/probability), if so, could someone recommend what area of math I should be searching under. Thanks!
 
Physics news on Phys.org
Bingk said:
Hello,

I'm trying to read a paper titled "Cluster Identification in Nearest Neighbor Graphs". It's a mixture of probability, graph theory, and topology. I'm having difficulty interpreting some of the ideas, specially when it comes to k nearest neighbor graphs.
I've been trying to look for a book that is a sort of "introduction" to these types of graphs, but haven't been able to find any. Most are either too basic, or too advanced. Could someone recommend some literature on this subject?

Thanks!

P.S. I have been looking for graph theory books that cover this topic, but it just occurred to me that this topic (which is about graphs) might be better covered by another area of math (maybe statistics/probability), if so, could someone recommend what area of math I should be searching under. Thanks!

Hi Bingk, :)

Maybe you will find the following books useful.

Computational Geometry: An Introduction (Monographs in Computer Science): Franco P. Preparata,Michael Ian Shamos: 9780387961316: Amazon.com: Books

Algorithms in Combinatorial Geometry (Eatcs Monographs on Theoretical Computer Science): H. Edelsbrunner,Herbert Edelsbrunner: 9780387137223: Amazon.com: Books

Kind Regards,
Sudharaka.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
2
Views
2K
Replies
1
Views
3K
Replies
4
Views
2K
Replies
6
Views
2K
Replies
5
Views
4K
Back
Top