Models of Random Graphs and Their Applications to the Web-Graph Analysis

被引：0

作者：

Raigorodskii, Andrei ^{[1
,2
,3
,4
]}

机构：

[1] Lomonosov Moscow State Univ, Moscow, Russia

[2] Moscow Inst Phys & Technol, Dolgoprudnyi, Russia

[3] Yandex, Moscow, Russia

[4] Buryat State Univ, Inst Math & Comp Sci, Ulan Ude, Russia

来源：

INFORMATION RETRIEVAL, (RUSSIR 2015) | 2016年 / 573卷

关键词：

Web graphs; Random graphs; NETWORKS; DIAMETER;

D O I：

10.1007/978-3-319-41718-9_5

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This course provides an overview of various models for random graphs and their applications to the Web graph. We start with the classical Erdos-Renyi model, then proceed with the most recent models describing the topology and growth of the Internet, social networks, economic network, and biological networks, and finally present several applications of these models to the problems of search and crawling.

引用

页码：101 / 118

页数：18

共 33 条

[1] Internet -: Diameter of the World-Wide Web
Albert, R
Jeong, H
Barabási, AL
[J]. NATURE, 1999, 401 (6749) : 130 - 131
[2] Error and attack tolerance of complex networks
Albert, R
Jeong, H
Barabási, AL
[J]. NATURE, 2000, 406 (6794) : 378 - 382
[3] [Anonymous], 2007, Connections: An Introduction to the Economics of Networks
[4] [Anonymous], 2010, Lectures on Complex Networks
[5] [Anonymous], 2006, PRINCETON STUDIES CO
[6] [Anonymous], 2001, Cambridge studies in advanced mathematics, DOI DOI 10.1017/CBO9780511814068
[7] [Anonymous], 2003, Internet Math., DOI [10.1080/15427951.2004.10129080, DOI 10.1080/15427951.2004.10129080]
[8] PageRank of Scale-Free Growing Networks
Avrachenkov, Konstantin
Lebedev, Dmitri
[J]. INTERNET MATHEMATICS, 2006, 3 (02) : 207 - 231
[9] Scale-free characteristics of random networks:: the topology of the World-Wide Web
Barabási, AL
Albert, R
Jeong, H
[J]. PHYSICA A, 2000, 281 (1-4): : 69 - 77
[10] Emergence of scaling in random networks
Barabási, AL
Albert, R
[J]. SCIENCE, 1999, 286 (5439) : 509 - 512

← 1 2 3 4 →