Open Source Software [8] (OSS) development is a classic example and prototype of collaborative social networks [4, 6, 19]. Based on the empirical data we collected from SourceForge over the last two years, we are able to investigate the structure and the dynamical mechanisms that determine the topology and govern the evolution of such systems. SourceForge is the largest online collaboratory for open source software development projects, hosting over 50 thousand projects and over 80 thousand developers. We used data on projects and developers that were collected monthly start in January 2001 [2, 3]. In this paper, we analyze the empirical data we collected from SourceForge to obtain statistics and topological information of the OSS developer collaboration network. We extract the parameters of the evolution by inspecting the network over time. We generate a model that depicts the evolution of this collaboration network. Degree distribution, diameter and clustering coefficient are frequent attributes used to describe a network [13, 14, 15] and have been used ever since the foundation of random network theory. We also used these attributes to characterize the empirical data we collected from SourceForge. Existing research tends to look at the network a single snapshot in its evolution, which means they all based their observations on network without respect to time. We are able to inspect the network with consideration of time using the empirical data collected over more than two years. • For diameter, which is the maximal shortest path in distance between any pairs of nodes, the SourceForge developer collaboration network has a value between 8 and 6. This is quite small considering to the network size of over 70,000 nodes. If we define D as the diameter of network and p is the connection probability, the scale of the diameter with respect to the fraction p is not fixed. For small p, D scales linearly with the system size, while for large p the scaling is logarithmic. • For clustering coefficient, which is the fraction of the number of present links over the number of potential links among the nodes in its neighborhood, the value of SourceForge developer collaboration network is over 0.7 and is much bigger than that of a random network (the clustering coefficient of a random network of similar size is around 0.2 [9, 18]). • For degree distribution P (k), which is the distribution of the degree k throughout the networks, we find that it follows power law instead of normal distribution as shown in Figure 1. The left figure is the project distribution in normal coor0 20 40 60 0 1 2 3 4 5 6 x 10 4 Paticipated projects D ev el op er s Normal coordinates 0 0.5 1 1.5 0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 Paticipated projects(LOG10) D ev el op er s( LO G 10 ) Log−log coordinates Real data Slope:−3.4798;NOR:1.5531 Figure 1: Degree distribution of SourceForge developer collaboration network. dinates, and the right figure is the project distribution in log-log coordinates, where we can observe that the distribution fits a straight line well. The previous attributes are all related to the topology of a collaboration network, which is studied by many researcheres [5, 12, 16, 20]. We also have some evolution related discoveries from these statistics we obtained from SourceForge. • Cluster distribution. For a large complex network, it is normally composed of clusters, which are connected components of a network. Research about these clusters can help us to understand the mechanisms of complex network evolution. In our study, we find the cluster distribution of the SourceForge collaboration network also follows power law, and the size of major cluster of the network, which is the largest cluster in the network, increases toward fixed percentage (35%) of the overall network size and this percentage may be used to characterize the evolution of the network. • Average degree. The average degree of the SourceForge network is also increasing. We cannot yet tell from the data is the average degree is approaching a limit, but it is increasing. • Diameter. The diameter of the SourceForge developer collaboration network is used to measure the capability of the network to spread information. The smaller the diameter of a network, the faster information can spread through the network. We find the diameter of SourceForge is decreasing from 8 to 6 over two years, but the rate of decrease is diminishing. • Fitness. Fitness is a new idea proposed by A.L. Barabási [7] to characterize the phenomenon that a new project can sometimes outrun the old one. We can find this kind of “fitness” effect in our SourceForge network. And also we observed in the empirical data on SourceForge that the average monthly growth of individual project is diminishing with time. This phenomenon can not be explained by the fitness proposed by A.L. Barabási, which is a constant value throughout time for each project. In a scale-free network with constant fitness, the node with higher degree will always have higher preference, which is based on fitness and link counts, and thus make its degree constantly increasing, which should often be decreasing based on the SourceForge empirical data. Constant fitness can not explain this phenomenon. We proposed a dynamic fitness factor to explain this phenomenon. • Life cycle pattern. We find a life cycle like pattern in the SourceForge empirical data (the development patterns of individual developer and project). This can not be explained by the simple fitness. Mathematical methods are not always able to capture all the features of a complex social network like SourceForge, especially the behaviors of heterogeneous individuals in the network. This is why we use agent-based simulation to help us understand and investigate such a complex network. We propose a model to describe the evolution of the SourceForge developer collaboration network, so that we can build simulations based on this model [1]. Since the collaboration network can be clearly described by a bipartite graph, we build our model based on a bipartite network. In order to remove the ambiguity of the model, we made several assumptions about the collaboration network. This assumption is based on the statistics we obtained from the empirical data. The model contains two parts: • Procedure definition: This is the description of the steps that the simulation should follow to reproduce the evolution of the SourceForge developer collaboration network. • Simulation parameters: These are the parameters we use to control the simulation to reproduce the evolution of SourceForge developer collaboration network. After defining the model, we use simulation to verify the topological and evolution related properties of SourceForge developer collaboration network we obtained by statistical study of the empirical data.
[1]
M. Newman.
Clustering and preferential attachment in growing networks.
,
2001,
Physical review. E, Statistical, nonlinear, and soft matter physics.
[2]
H E Stanley,et al.
Classes of small-world networks.
,
2000,
Proceedings of the National Academy of Sciences of the United States of America.
[3]
Philip J. Kiviat.
Simulation, technology, and the decision process
,
1991,
TOMC.
[4]
A. Barabasi,et al.
Evolution of the social network of scientific collaborations
,
2001,
cond-mat/0104162.
[5]
Greg Madey,et al.
THE OPEN SOURCE SOFTWARE DEVELOPMENT PHENOMENON: AN ANALYSIS BASED ON SOCIAL NETWORK THEORY
,
2002
.
[6]
Yongqin Gao,et al.
Conceptual Framework for Agent-based Modeling and Simulation
,
2003
.
[7]
M E Newman,et al.
Scientific collaboration networks. I. Network construction and fundamental results.
,
2001,
Physical review. E, Statistical, nonlinear, and soft matter physics.
[8]
Paul Erdös,et al.
On random graphs, I
,
1959
.
[9]
S H Strogatz,et al.
Random graph models of social networks
,
2002,
Proceedings of the National Academy of Sciences of the United States of America.
[10]
M. Newman,et al.
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality.
,
2001,
Physical review. E, Statistical, nonlinear, and soft matter physics.
[11]
Albert,et al.
Dynamics of complex systems: scaling laws for the period of boolean networks
,
2000,
Physical review letters.
[12]
Gregory R. Madey,et al.
AGENT-BASED MODELING OF OPEN SOURCEUSING SWARM
,
2002
.
[13]
David E. Hiebeler,et al.
The Swarm Simulation System and Individual-Based Modeling
,
1994
.
[14]
Linyuan Lu,et al.
Random evolution in massive graphs
,
2001
.
[15]
Duncan J. Watts,et al.
Collective dynamics of ‘small-world’ networks
,
1998,
Nature.
[16]
Albert,et al.
Emergence of scaling in random networks
,
1999,
Science.