On the distribution of typical shortest-path lengths in connected random geometric graphs.
David NeuhäuserChristian HirschCatherine GloaguenVolker SchmidtPublished in: Queueing Syst. Theory Appl. (2012)
Keyphrases
- path length
- small world
- shortest path
- power law
- uniformly distributed
- degree distribution
- clustering coefficient
- heavy tailed
- social networks
- graph theoretical
- graph theory
- graph matching
- scale free
- directed graph
- real world
- random graphs
- uniform random
- geometric structure
- weighted graph
- network structure
- random variables
- probability distribution
- graph theoretic
- np complete
- heavy tails