Double Clustering and Graph Navigability

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to meet strict criteria. Since such graphs nevertheless seem to appear in nature, it is of interest to understand why these criteria should be fulfilled. In this paper we present a simple method for constructing graphs based on a model where nodes vertices are ``similar'' in two different ways, and tend to connect to those most similar to them - or cluster - with respect to both. We prove that this leads to navigable networks for several cases, and hypothesize that it also holds in great generality. Enough generality, perhaps, to explain the occurrence of navigable networks in nature.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Double Clustering and Graph Navigability 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 Double Clustering and Graph Navigability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Double Clustering and Graph Navigability will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-415106

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.