Some analyses of Erdos collaboration graph

被引:73
作者
Batagelj, V [1 ]
Mrvar, A [1 ]
机构
[1] Univ Ljubljana, Dept Math, FMF, Ljubljana 1000, Slovenia
关键词
D O I
10.1016/S0378-8733(00)00023-X
中图分类号
Q98 [人类学];
学科分类号
030303 ;
摘要
Patrick Ion (Mathematical Reviews) and Jerry Grossman (Oakland University) maintain a collection of data on Paul Erdos, his co-authors and their co-authors. These data can be represented by a graph, also called the Erdos collaboration graph. In this paper, some techniques for analysis of large networks (different approaches to identify 'interesting' individuals and groups, analysis of internal structure of the main core using pre-specified blockmodeling and hierarchical clustering) and visualizations of their parts, are presented on the case of Erdos collaboration graph, using the program Pajek. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:173 / 186
页数:14
相关论文
共 9 条
  • [1] Batagelj V, 1999, LECT NOTES COMPUT SC, V1731, P90
  • [2] COMPARING RESEMBLANCE MEASURES
    BATAGELJ, V
    BREN, M
    [J]. JOURNAL OF CLASSIFICATION, 1995, 12 (01) : 73 - 90
  • [3] Notes on blockmodeling
    Batagelj, V
    [J]. SOCIAL NETWORKS, 1997, 19 (02) : 143 - 155
  • [4] Batagelj V, 1998, CONNECTIONS, V21, P47, DOI DOI 10.1017/CB09780511996368
  • [5] Batagelj V, 1998, DATA SCI CLASSIFICAT, P199
  • [6] GORDON AD, 1981, CLASSIFICATION
  • [7] Grossman J.W, 1996, ERDOS NUMBER PROJECT
  • [8] Grossman J.W., 1995, Congressus Numerantium, V108, P129
  • [9] NETWORK STRUCTURE AND MINIMUM DEGREE
    SEIDMAN, SB
    [J]. SOCIAL NETWORKS, 1983, 5 (03) : 269 - 287