56:: in the Erdős–Rényi model, there are very few large degree nodes, relative to the webgraph's degree distribution. The precise distribution is unclear, however: it is relatively well described by a
35:, edges are directed lines or arcs. The webgraph is a directed graph, whose vertices correspond to the pages of the WWW, and a directed edge connects page X to page Y if there exists a
321:
Glen Jeh and
Jennifer Widom. 2003. Scaling personalized web search. In Proceedings of the 12th international conference on World Wide Web (WWW '03). ACM, New York, NY, USA, 271–279.
234:
338:
Kumar, Ravi; Raghavan, Prabhakar; Rajagopalan, Sridhar; Tomkins, Andrew (1999). "Trawling the Web for emerging cyber-communities".
426:
421:
28:
137:
61:
53:
52:
of the webgraph strongly differs from the degree distribution of the classical random graph model, the
352:
180:
Clauset, A.; Shalizi, C. R.; Newman, M. E. J. (2009). "Power-law distributions in empirical data".
98:
detecting webpages of similar topics, through graph-theoretical properties only, like co-citation;
347:
386:
259:
199:
8:
49:
263:
203:
365:
283:
249:
215:
189:
72:
361:
275:
369:
357:
322:
267:
219:
207:
160:
152:
287:
271:
31:, in general, consists of several vertices, some pairs connected by edges. In a
102:
32:
24:
415:
406:
279:
138:"The Graph Structure in the Web - Analyzed on Different Aggregation Levels"
326:
301:
254:
156:
305:
165:
65:
391:
211:
57:
36:
392:
Webgraphs at
University of Milano – Laboratory for Web Algorithmics
89:
396:
194:
337:
309:
135:
401:
136:
Meusel, R.; Vigna, S.; Lehmberg, O.; Bizer, C. (2015).
233:
Barabási, Albert-László; Albert, Réka (October 1999).
179:
101:
and identifying hubs and authorities in the web for
23:describes the directed links between pages of the
413:
232:
351:
253:
235:"Emergence of scaling in random networks"
193:
164:
414:
402:Webgraph at the Erdős Webgraph Server
95:computing the personalized PageRank;
13:
407:Web Data Commons - Hyperlink Graph
124:Publ. Math. Inst. Hung. Acad. Sci.
14:
438:
380:
71:The webgraph is an example of a
39:on page X, referring to page Y.
79:
331:
315:
295:
226:
173:
129:
116:
1:
362:10.1016/S1389-1286(99)00040-7
109:
60:distribution, as well as the
42:
397:Webgraphs at Stanford – SNAP
272:10.1126/science.286.5439.509
16:Graph of connected web pages
7:
427:Application-specific graphs
10:
443:
422:Internet search algorithms
387:Webgraphs in Yahoo Sandbox
84:The webgraph is used for:
308:, Computer Networks and
312:Systems 30, 107 (1998)
145:Journal of Web Science
327:10.1145/775152.775191
62:Barabási–Albert model
346:(11–16): 1481–1493.
157:10.1561/106.00000003
122:P. Erdős, A. Renyi,
264:1999Sci...286..509B
204:2009SIAMR..51..661C
50:degree distribution
73:scale-free network
340:Computer Networks
248:(5439): 509–512.
212:10.1137/070710111
92:of the WWW-pages;
54:Erdős–Rényi model
434:
374:
373:
355:
335:
329:
319:
313:
299:
293:
291:
257:
255:cond-mat/9910332
239:
230:
224:
223:
197:
177:
171:
170:
168:
142:
133:
127:
120:
442:
441:
437:
436:
435:
433:
432:
431:
412:
411:
383:
378:
377:
336:
332:
320:
316:
300:
296:
237:
231:
227:
178:
174:
140:
134:
130:
121:
117:
112:
82:
45:
17:
12:
11:
5:
440:
430:
429:
424:
410:
409:
404:
399:
394:
389:
382:
381:External links
379:
376:
375:
353:10.1.1.89.4025
330:
314:
294:
225:
188:(4): 661–703.
172:
128:
114:
113:
111:
108:
107:
106:
103:HITS algorithm
99:
96:
93:
88:computing the
81:
78:
77:
76:
69:
44:
41:
33:directed graph
25:World Wide Web
15:
9:
6:
4:
3:
2:
439:
428:
425:
423:
420:
419:
417:
408:
405:
403:
400:
398:
395:
393:
390:
388:
385:
384:
371:
367:
363:
359:
354:
349:
345:
341:
334:
328:
324:
318:
311:
307:
303:
298:
289:
285:
281:
277:
273:
269:
265:
261:
256:
251:
247:
243:
236:
229:
221:
217:
213:
209:
205:
201:
196:
191:
187:
183:
176:
167:
162:
158:
154:
150:
146:
139:
132:
125:
119:
115:
104:
100:
97:
94:
91:
87:
86:
85:
74:
70:
67:
63:
59:
55:
51:
47:
46:
40:
38:
34:
30:
26:
22:
343:
339:
333:
317:
297:
245:
241:
228:
185:
181:
175:
151:(1): 33–47.
148:
144:
131:
123:
118:
83:
80:Applications
20:
18:
166:2434/372411
416:Categories
110:References
66:power laws
43:Properties
348:CiteSeerX
195:0706.1062
58:lognormal
37:hyperlink
280:10521342
182:SIAM Rev
126:5 (1960)
90:PageRank
21:webgraph
370:7069190
306:L. Page
302:S. Brin
260:Bibcode
242:Science
220:9155618
200:Bibcode
368:
350:
288:524106
286:
278:
218:
366:S2CID
284:S2CID
250:arXiv
238:(PDF)
216:S2CID
190:arXiv
141:(PDF)
29:graph
310:ISDN
276:PMID
64:for
48:The
27:. A
19:The
358:doi
323:doi
268:doi
246:286
208:doi
161:hdl
153:doi
418::
364:.
356:.
344:31
342:.
304:,
282:.
274:.
266:.
258:.
244:.
240:.
214:.
206:.
198:.
186:51
184:.
159:.
147:.
143:.
372:.
360::
325::
292:.
290:.
270::
262::
252::
222:.
210::
202::
192::
169:.
163::
155::
149:1
105:.
75:.
68:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.