You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
<p>Imagine there are only 100 people and three cities (New York, Boston, and Houston) in this world. Currently, 50 people live in New York, 30 people live in Boston, and 20 people live in Houston. Every year, a certain proportion of the population moves from one city to another, causing the population of each city to change constantly. Below is a diagram that shows the proportions:</p>
<code>\begin{bmatrix} 0.72 & 0.05 & 0.1 \\\\ 0.1 & 0.75 & 0.15 \\\\ 0.18 & 0.2 & 0.75 \end{bmatrix} ^ 3 \cdot </code>\begin{bmatrix}
<p>Here we use initial population vector <code>\([50, 30, 20]\)</code>, and we calculate the population after 20 years:</p>
144
171
<p>$$
145
-
<code>\begin{bmatrix} 0.72 & 0.05 & 0.1 \\\\ 0.1 & 0.75 & 0.15 \\\\ 0.18 & 0.2 & 0.75 \end{bmatrix} ^ {20} \cdot </code>\begin{bmatrix}
<code>\begin{bmatrix} 0.72 & 0.05 & 0.1 \\\\ 0.1 & 0.75 & 0.15 \\\\ 0.18 & 0.2 & 0.75 \end{bmatrix} ^ {50} \cdot </code>\begin{bmatrix}
<p>In a parallel universe, at year-0, we have 100 people in NY, 0 people in Boston, and 0 people in Houston. However, after 20 years, we achieve the same population across these three cities:</p>
162
211
<p>$$
163
-
<code>\begin{bmatrix} 0.72 & 0.05 & 0.1 \\\\ 0.1 & 0.75 & 0.15 \\\\ 0.18 & 0.2 & 0.75 \end{bmatrix} ^ {20} \cdot </code>\begin{bmatrix}
@@ -191,18 +251,38 @@ <h2 id="a-trillion-dollar-model">A trillion dollar model</h2>
191
251
<p>Intuitively, pageA and pageC look like good pages, since a lot of other websites referred these two pages. A user will typically follow the hyperlinks to browse the website. For example, if a user is currently browsing pageC, the next moment, this user will have 50% of the chance to go to pageD, and 50% of the chance to go to pageA. Based on this graph, we can specify the transition matrix</p>
192
252
<p>(note row/column order from pageA - pageE):</p>
193
253
<p>$$
194
-
<code>\begin{bmatrix} 0 & 1 & 0.5 & 0 & 0.5\\\\ 0 & 0 & 0 & 0 & 0 \\\\ 1 & 0 & 0 & 1 & 0 \\\\ 0 & 0 & 0.5 & 0 & 0 \\\\ 0 & 0 & 0 & 0 & 0.5 \end{bmatrix}</code>
195
-
$$</p>
196
-
<p>Now assume we have 100 random users, with 20 users in each page. Using the same technique we have discussed above, we can calculate the stationary distribution (a.k.a, how many random users in each page eventually).</p>
254
+
\begin{bmatrix}
255
+
0 & 1 & 0.5 & 0 & 0.5\\
256
+
0 & 0 & 0 & 0 & 0 \\
257
+
1 & 0 & 0 & 1 & 0 \\
258
+
0 & 0 & 0.5 & 0 & 0 \\
259
+
0 & 0 & 0 & 0 & 0.5
260
+
\end{bmatrix}
261
+
$$
262
+
Now assume we have 100 random users, with 20 users in each page. Using the same technique we have discussed above, we can calculate the stationary distribution (a.k.a, how many random users in each page eventually).</p>
197
263
<p>$$
198
-
<code>\begin{bmatrix} 0 & 1 & 0.5 & 0 & 0.5\\\\ 0 & 0 & 0 & 0 & 0 \\\\ 1 & 0 & 0 & 1 & 0 \\\\ 0 & 0 & 0.5 & 0 & 0 \\\\ 0 & 0 & 0 & 0 & 0.5 \end{bmatrix}^{50} \cdot </code>\begin{bmatrix}
<p>According to the PageRank algorithm, eventually we will have 53.4 users landing on pageC, and therefore pageC has the highest quality and should be recommended as the top page to the users.</p>
0 commit comments