On Clusters in Markov Chains

  • Nir Ailon
  • Steve Chien
  • Cynthia Dwork
Conference paper

DOI: 10.1007/11682462_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3887)
Cite this paper as:
Ailon N., Chien S., Dwork C. (2006) On Clusters in Markov Chains. In: Correa J.R., Hevia A., Kiwi M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg

Abstract

Motivated by the computational difficulty of analyzing very large Markov chains, we define a notion of clusters in (not necessarily reversible) Markov chains, and explore the possibility of analyzing a cluster “in vitro,” without regard to the remainder of the chain. We estimate the stationary probabilities of the states in the cluster using only transition information for these states, and bound the error of the estimate in terms of parameters measuring the quality of the cluster. Finally, we relate our results to searching in a hyperlinked environment, and provide supporting experimental results.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Nir Ailon
    • 1
  • Steve Chien
    • 2
  • Cynthia Dwork
    • 2
  1. 1.Princeton UniversityPrinceton
  2. 2.Microsoft ResearchMountain View

Personalised recommendations