0% found this document useful (0 votes)
3 views44 pages

Page Rank

The document discusses the Web Graph, highlighting its significance as the largest human-made artifact and its applications in various fields such as search strategies, spam detection, and community discovery. It also delves into mathematical models and sociological insights related to the structure of the web. Additionally, it presents concepts related to PageRank and probability distributions within the context of web navigation.

Uploaded by

safdar Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views44 pages

Page Rank

The document discusses the Web Graph, highlighting its significance as the largest human-made artifact and its applications in various fields such as search strategies, spam detection, and community discovery. It also delves into mathematical models and sociological insights related to the structure of the web. Additionally, it presents concepts related to PageRank and probability distributions within the context of web navigation.

Uploaded by

safdar Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

PageRank

The Web Graph

w2
w1

w3

w5
w4
Why is it interesting to study the Web
Graph?
 It is the largest artifact ever conceived by the human
 Exploit its structure of the Web for

 Crawl strategies
 Search
 Spam detection
 Discovering communities on the web
 Classification/organization
 Predict the evolution of the Web
 Mathematical models
 Sociological understanding



w2
 w1


w3

w5
w4

w2=4
w1=4
1. Red Page
2. Yellow Page
3. Blue Page
4. Purple Page
w3=3
5. Green Page

w5=3 w4=4


w2=3
w1=2
1. Red Page
2. Yellow Page
3. Blue Page
4. Purple Page
w3=2
5. Green Page

w5=1 w4=1



1. Red Page
2. Purple Page
3. Yellow Page

4. Blue Page
5. Green Page

1/3
 1/3
1/3


??



 α

 1. Red Page
2. Purple Page
 3. Yellow Page
4. Blue Page
5. Green Page

S = {s1, s2, … sn}


si sj
Pij
P = {Pij}




0 1 1 0 0
1 0 1 0 0 
 1
A  1 1 0 1 0 3
 
0 0 1 0 1
0 0 0 1 0 
5 4

0 1 1 0 0
1 0 0 0 0 

A  0 1 0 1 0 1
  3
0 0 0 0 1
0 0 0 0 0 
5 4
v2
0 1 1 0 0 v1
0 0 0 0 1 

A  0 1 0 0 0 v3
 
1 1 1 0 0
1 0 0 0 1 

0 12 12 0 0
0 0 0 0 1

PRW  0 1 0 0 0 v5 v4
 
1 3 1 3 1 3 0 0
1 2 0 0 1/2 0
n

 
j 1
Pij  1.


v2
v1
v3
0 1 1 0 0
0 0 0 0 1

A  0 1 0 0 0
 
1 1 1 0 0
1 0 0 1 0
v5 v4

v2
v1
v3
0 1 1 0 0
0 0 0 0 0

A  0 1 0 0 0
 
1 1 1 0 0
1 0 0 1 0
v5 v4

0 12 12 0 0
0 1 0 0 0

PRW  0 1 0 0 0
 
1 3 1 3 1 3 0 0
1 2 0 0 12 0

0 12 12 0 0
1 5 1 5 1 5 1 5 1 5
 
PRW  0 1 0 0 0
 
 1 3 1 3 1 3 0 0 
1 2 0 0 1 2 0 

0 12 12 0 0 1 5 1 5 15 15 1 5
1 5 1 5 1 5 1 5 1 5 1 5 1 5 15 15 1 5
  
PPR  (1   )  0 1 0 0 0    1 5 1 5 15 15 1 5
   
 1 3 1 3 1 3 0 0  1 5 1 5 15 15 1 5
1 2 0 0 1/2 0  1 5 1 5 15 15 1 5

 ij


1 i n

More generally, the vector q = (q1, … qn) means the


walk is in state i with probability qi.
n

q
i 1
i  1.


v2
v1
0 12 12 0 0
0 0 0 0 1 

P 0 1 0 0 0 v3
 
1 3 1 3 1 3 0 0
1 2 0 0 12 0

qt+11 = 1/3 qt4 + 1/2 qt5


qt+12 = 1/2 qt1 + qt3 + 1/3 qt4 v5 v4
qt+13 = 1/2 qt1 + 1/3 qt4
qt+14 = 1/2 qt5
qt+15 = qt2



Not
ergodic
(even/odd)

.


3/4
1/4 1 2 3/4
1/4

For this example, π1=1/4 and π2=3/4.







You might also like