Chapter

Navigation and search

Sergey N. Dorogovtsev

in Lectures on Complex Networks

Published in print February 2010 | ISBN: 9780199548927
Published online May 2010 | e-ISBN: 9780191720574 | DOI: http://dx.doi.org/10.1093/acprof:oso/9780199548927.003.0011

Series: Oxford Master Series in Physics

Navigation and search

More Like This

Show all results sharing this subject:

  • Mathematical and Statistical Physics

GO

Show Summary Details

Preview

This chapter considers the specifics of walks, navigation, and search processes in networks of various architectures and geometries. It starts with discussion of random walks on complex networks, then biased random walks and in application to packet routing in the Internet. It discusses the famous Kleinberg's problem and searchability of networks with underlining metric spaces. Finally, the Google PageRank is explained.

Keywords: random walks; biased random walks; navigability; searchability; Google PageRank

Chapter.  4833 words.  Illustrated.

Subjects: Mathematical and Statistical Physics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.