A Growing Model for Scale–Free Networks Embedded in Hyperbolic Metric Spaces
Some results by Krioukov et al. show how real world networks are produced by hidden metric spaces. Specifically, scale-free networks can be obtained from hyperbolic metric spaces. While the model proposed by Krioukov can produce a static scale-free network, all nodes are created at one time and none can be later added. In this work we propose a growing model which leverages the same concepts and allows to gradually add nodes to a scale-free network, obtained from a discretised hyperbolic model. We also show how nodes are correctly positioned relying on local information and how greedy routing builds optimal paths in the network.
KeywordsDegree Distribution Hyperbolic Space Ideal Point Overlay Network Average Path Length
Unable to display preview. Download preview PDF.
- 5.Kleinberg, J.M.: Navigation in a small world. Nature 406(6798) (August 2000)Google Scholar
- 6.Kleinberg, J.M.: Complex networks and decentralized search algorithms. In: ICM (2006)Google Scholar
- 7.Krioukov, D., Papadopoulos, F., Boguñá, M., Vahdat, A.: Efficient navigation in scale-free networks. Embedded in Hyperbolic Metric Spaces (2008) arXiv:0805.1266v1 [cond-mat.stat-mech]Google Scholar
- 10.Papadopoulos, F., Krioukov, D., Boguñá, M., Vahdat, A.: Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. In: Proceedings of INFOCOM 2010. IEEE Press, USA (2010)Google Scholar