Google Illustration:

The following WebPages (1) to (n=6) are linked in a network below:

eg.

Page (1) points to (4),

(2) & (3) points to (1)…

Let

$latex a_{ij} $ = Probability (**PageRank ***) from Page ( i ) linked to Page (j).

(*) **PageRank**: a measure of how relevant the page’s content to the topic of your query. This value is computed by the proprietary formula designed by the 2 Google Founders Larry Page & Sergey Brin, whose Stanford Math Thesis mentor was Prof Tony Chan (who knows the ‘secret ‘ to put his name always on Google 1st search list.)

The **Markov Transition Matrix** (A) is :

$latex A =

begin{pmatrix}

a_{11} & a_{12}& ldots & a_{1n}

a_{21} & a_{22} & ldots & a_{2n}

vdots & vdots & ddots & vdots

a_{n1} & a_{n2} &ldots & a_{nn}

end{pmatrix}

$

Assume we start surfing from Page…

View original post 418 more words