Curvature of co-links uncovers hidden thematic layers in the World Wide Web

被引:194
作者
Eckmann, JP
Moses, E
机构
[1] Univ Geneva, Dept Phys Theor, CH-1211 Geneva 4, Switzerland
[2] Univ Geneva, Sect Math, CH-1211 Geneva 4, Switzerland
[3] Weizmann Inst Sci, Dept Phys Complex Syst, IL-76100 Rehovot, Israel
关键词
D O I
10.1073/pnas.032093399
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Beyond the information stored in pages of the World Wide Web, novel types of "meta-information" are created when pages connect to each other. Such meta-information is a collective effect of independent agents writing and linking pages, hidden from the casual user. Accessing it and understanding the interrelation between connectivity and content in the World Wide Web is a challenging problem [Botafogo, R. A. & Shneiderman, B. (1991) in Proceedings of Hypertext (Assoc. Comput. Mach., New York), pp. 63-77 and Albert, R. & Barabasi, A.-L. (2002) Rev. Mod. Phys. 74, 47-97]. We demonstrate here how thematic relationships can be located precisely by looking only at the graph of hyperlinks, gleaning content and context from the Web without having to read what is in the pages. We begin by noting that reciprocal links (co-links) between pages signal a mutual recognition of authors and then focus on triangles containing such links, because triangles indicate a transitive relation. The importance of triangles is quantified by the clustering coefficient [Watts, D. J. & Strogatz, S. H. (1999) Nature (London) 393, 440-442], which we interpret as a curvature [Bridson, M. R. & Haefliger, A. (1999) Metric Spaces of Non-Positive Curvature (Springer, Berlin)]. This curvature defines a World Wide Web landscape whose connected regions of high curvature characterize a common topic. We show experimentally that reciprocity and curvature, when combined, accurately capture this meta-information for a wide variety of topics. As an example of future directions we analyze the neural network of Caenorhabditis elegans, using the same methods.
引用
收藏
页码:5825 / 5829
页数:5
相关论文
共 22 条
  • [1] Error and attack tolerance of complex networks
    Albert, R
    Jeong, H
    Barabási, AL
    [J]. NATURE, 2000, 406 (6794) : 378 - 382
  • [2] [Anonymous], 1998, Proceedings of the 7th international conference on World Wide Web (WWW), DOI [10.1016/S0169-7552(98)00110-X, DOI 10.1016/S0169-7552(98)00110-X]
  • [3] [Anonymous], P HUM FACT COMP SYST
  • [4] [Anonymous], 1988, NEMATODE CAENORHABDI
  • [5] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [6] Bollobas B, 1985, RANDOM GRAPHS
  • [7] BOTAFOGO RA, 1991, P 3 ACM C HYP, P63
  • [8] Bridson M.R., 1999, METRIC SPACES NONPOS
  • [9] Graph structure in the Web
    Broder, A
    Kumar, R
    Maghoul, F
    Raghavan, P
    Rajagopalan, S
    Stata, R
    Tomkins, A
    Wiener, J
    [J]. COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6): : 309 - 320
  • [10] Cajal RS., 1928, DEGENERATION REGENER