Location of Repository

Kemeny's constant and the random surfer

By Mark Levene and George Loizou

Abstract

We revisit Kemeny's constant in the context of Web navigation, also known as "surfing." We generalize the constant, derive upper and lower bounds on it, and give it a novel interpretation in terms of the number of links a random surfer will follow to reach his final destination

Topics: csis
Publisher: The Mathematical Association of America
Year: 2002
OAI identifier: oai:eprints.bbk.ac.uk.oai2:209

Suggested articles

Preview

Citations

  1. (1999). A probabilistic approach to navigation in hypertext. doi
  2. (1999). Accessibility of information on the web. doi
  3. (1960). Finite Markov Chains. doi
  4. (1981). Generalization of a fundamental matrix. Linear Algebra and its Applications, doi
  5. (1991). Geometric bounds for eigenvalues of Markov chains. doi
  6. (2000). Graph structure in the web. doi
  7. (1997). Introduction to Probability.
  8. (1985). Matrix Analysis. doi
  9. (1999). Navigation in hypertext is easy only sometimes. doi
  10. (2001). Reorganizing large web sites. doi
  11. (1996). Stochastic Processes. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.