Knowledge

Webgraph

Source đź“ť

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

Index

Web graph
World Wide Web
graph
directed graph
hyperlink
degree distribution
Erdős–Rényi model
lognormal
Barabási–Albert model
power laws
scale-free network
PageRank
HITS algorithm
"The Graph Structure in the Web - Analyzed on Different Aggregation Levels"
doi
10.1561/106.00000003
hdl
2434/372411
arXiv
0706.1062
Bibcode
2009SIAMR..51..661C
doi
10.1137/070710111
S2CID
9155618
"Emergence of scaling in random networks"
arXiv
cond-mat/9910332
Bibcode

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑