Analysis of SIGMOD's co-authorship graph

ABSTRACT

In this paper we investigate the co-authorship graph obtained from all papers published at SIGMOD between 1975 and 2002. We find some interesting facts, for instance, the identity of the authors who, on average, are "closest" to all other authors at a given time. We also show that SIGMOD's co-authorship graph is yet another example of a small world---a graph topology which has received a lot of attention recently. A companion web site for this paper can be found at http://db.cs.ualberta.ca/coauthorship.

REFERENCES

• 1: Alan F. Smeaton , Gary Keogh , Cathal Gurrin , Kieran McDonald , Tom Sødring, Analysis of papers from twenty-five years of SIGIR conferences: what have we been doing for the last quarter of a century?, ACM SIGIR Forum, v.36 n.2, Fall 2002 [doi>10.1145/792550.792556]
• 2: Duncan J. Watts, Small worlds: the dynamics of networks between order and randomness, Princeton University Press, Princeton, NJ, 1999