The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Lifting Markov chains to speed up mixing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
| Hi-index | 0.00 |
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.