Jump to ContentJump to Main Navigation
Lectures on Complex Networks$
Users without a subscription are not able to see the full content.

Sergey Dorogovtsev

Print publication date: 2010

Print ISBN-13: 9780199548927

Published to Oxford Scholarship Online: May 2010

DOI: 10.1093/acprof:oso/9780199548927.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 14 October 2019

Navigation and search

Navigation and search

Chapter:
(p.83) 11 Navigation and search
Source:
Lectures on Complex Networks
Author(s):

Sergey N. Dorogovtsev

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199548927.003.0011

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

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .