社会网络分析论坛 social network analysis forum

标题: Geom Collaboration network in computational geometry [打印本页]

作者: snachina 时间: 2017-7-18 21:37
标题: Geom Collaboration network in computational geometry
Geom
Collaboration network in computational geometry

Dataset Geom

Description

Geom.net valued undirected network with 7343 vertices and 11898 edges; author X wrote a joint work with author Y; value is the number of joint works.

Download

Geom.net (ZIP, 139K)

Background

The network Geom.net is based on the file geombib.bib that contains Computational Geometry Database, version February 2002.

The authors collaboration network in computational geometry was produced from the BibTeX bibliography [Beebe, 2002] obtained from the Computational Geometry Database geombib, version February 2002 [Jones, 2002].

Two authors are linked with an edge, iff they wrote a common work (paper, book, ...). The value of an edge is the number of common works. Using a simple program written in programming language Python, the BibTeX data were transformed into the corresponding network, and output to the file in Pajek format.

The obtained network has 9072 vertices (authors) and 22577 edges (common papers or books) / 13567 edges as a simple network - multiple edges between a pair of authors are replaced with a single edge.

The problem with the obtained network is that, because of non standardized writing of the author's name, it contains several vertices corresponding to the same author. For example:

R.S. Drysdale, Robert L. Drysdale, Robert L. Scot Drysdale, R.L. Drysdale, S. Drysdale, R. Drysdale, and R.L.S. Drysdale;

or:

Pankaj K. Agarwal, P. Agarwal, Pankaj Agarwal, and P.K. Agarwal

that are easy to guess; but an 'insider' information is needed to know that Otfried Schwarzkopf and Otfried Cheong are the same person. Also, no provision is made in the database to discern two persons with the same name. We manually produced the name equivalence partition and then shrank (in Pajek) the network according to it.

The reduced simple network contains 7343 vertices and 11898 edges. It is a sparse network - its average degree is 2m/n = 3.24.

History

Computational Geometry Database started in 1986 by merging two lists of references - one compiled by Edelsbrunner and van Leeuwen and the other by Guibas and Stolfi;
Computational Geometry Database, February 2002 Edition;
March-April 2002: Geom.bib transformed in Pajek format and 'cleaned' by V. Batagelj and M. Zaveršnik.

References

Beebe, N.H.F. (2002): Nelson H.F. Beebe's Bibliographies Page.
Jones, B., Computational Geometry Database, February 2002; FTP / HTTP

欢迎光临社会网络分析论坛 social network analysis forum (http://www.snachina.com/)