The spectrum of a random geometric graph is concentrated

Details The spectrum of a random geometric graph is concentrated The spectrum of a random geometric graph is concentrated

2004-08-09

arxiv.org/abs/math/0408103v2

Mathematics

Probability

Scientific paper

Consider $n$ points distributed uniformly in $[0,1]^d$. Form a graph by connecting two points if their mutual distance is no greater than $r(n)$. This gives a random geometric graph, $\gnrn$, which is connected for appropriate $r(n)$. We show that the spectral measure of the transition matrix of the simple random walk (\abbr{srw}) on $\gnrn$ is concentrated, and in fact converges to that of the graph on the deterministic grid.

Affiliated with

Also associated with

No associations

Rating

The spectrum of a random geometric graph is concentrated does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The spectrum of a random geometric graph is concentrated, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The spectrum of a random geometric graph is concentrated will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358631