Description
This dissertation studies routing in small-world networks such as grids plus long-range edges and real networks. Kleinberg showed that geography-based greedy routing in a grid-based network takes an expected number of steps polylogarithmic in the network size, thus justifying empirical efficiency observed beginning with Milgram.
Copyright Statement
Download count: 0
Details
Contributors
- Bakun, Oleg (Author)
- Konjevod, Goran (Thesis advisor)
- Richa, Andrea (Thesis advisor)
- Syrotiuk, Violet R. (Committee member)
- Czygrinow, Andrzej (Committee member)
- Arizona State University (Publisher)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2011
Subjects
Resource Type
Collections this item is in
Note
- Partial requirement for: Ph.D., Arizona State University, 2011Note typethesis
- Includes bibliographical references (p. 125-129)Note typebibliography
- Field of study: Computer science
Citation and reuse
Statement of Responsibility
Oleg Bakun