Markov Chain Process (Theory and Cases)

Computational Information System Issues

Author(s): Carlos Polanco * .

Pp: 112-117 (6)

DOI: 10.2174/9789815080476123010019

* (Excluding Mailing and Handling)

Abstract

This chapter defines a PageRank System for ranks web pages according to the transit detected in them. This simulation uses Discrete-Time and Continuous-Time Markov Chain Processes. For both approximations, numerical examples of both conditional probabilities and transition rate rates are provided. While both models are treated separately, in the end the desirability of designing a mixed network is discussed.

© 2024 Bentham Science Publishers | Privacy Policy