<s>
The	O
webgraph	B-Application
describes	O
the	O
directed	O
links	O
between	O
pages	O
of	O
the	O
World	O
Wide	O
Web	O
.	O
</s>
<s>
The	O
webgraph	B-Application
is	O
a	O
directed	O
graph	O
,	O
whose	O
vertices	O
correspond	O
to	O
the	O
pages	O
of	O
the	O
WWW	O
,	O
and	O
a	O
directed	O
edge	O
connects	O
page	O
X	O
to	O
page	O
Y	O
if	O
there	O
exists	O
a	O
hyperlink	O
on	O
page	O
X	O
,	O
referring	O
to	O
page	O
Y	O
.	O
</s>
<s>
The	O
degree	O
distribution	O
of	O
the	O
webgraph	B-Application
strongly	O
differs	O
from	O
the	O
degree	O
distribution	O
of	O
the	O
classical	O
random	O
graph	O
model	O
,	O
the	O
Erdős	O
–	O
Rényi	O
model	O
:	O
in	O
the	O
Erdős	O
–	O
Rényi	O
model	O
,	O
there	O
are	O
very	O
few	O
large	O
degree	O
nodes	O
,	O
relative	O
to	O
the	O
webgraph	B-Application
's	O
degree	O
distribution	O
.	O
</s>
<s>
The	O
webgraph	B-Application
is	O
an	O
example	O
of	O
a	O
scale-free	O
network	O
.	O
</s>
<s>
The	O
webgraph	B-Application
is	O
used	O
for	O
:	O
</s>
<s>
computing	O
the	O
PageRank	B-Algorithm
of	O
the	O
WWW-pages	O
;	O
</s>
<s>
computing	O
the	O
personalized	O
PageRank	B-Algorithm
;	O
</s>
<s>
and	O
identifying	O
hubs	B-Application
and	I-Application
authorities	I-Application
in	O
the	O
web	O
for	O
HITS	B-Application
algorithm	I-Application
.	O
</s>
