<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>On Clusters in Open Source Ecosystems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Shaheen Syed</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Slinger Jansen</string-name>
          <email>slingerjanseng@uu.nlg</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Information and Computer Sciences, Utrecht University Princetonplein 5</institution>
          ,
          <addr-line>3508 TB Utrecht</addr-line>
          ,
          <country country="NL">the Netherlands</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper seeks to nd characteristics of relationships between developers within various clusters of FLOSS ecosystems. We have mined the repository of the open source programming language Ruby, and linked developers and projects on the basis of collaboration. We used Social Network Analysis, and more speci cally, the concept of modularity to expose underlying clusters or sub-communities. A survey was constructed to aid in the qualitative part of this research. The data shows that Ruby's ecosystem consist mostly of single developers who work independently. Developers within clusters of a few developers often have personal relationships formed through friendship, work and the open source community. Personal relationships formed through the open source community grow as clusters consist of more developers. Developers in clusters with large number of developers are often unaware of friend-of-friend relationships. Project administrators, however, fail to list developers that contribute through pull/request issues as authors, making data on Ruby's repository incomplete.</p>
      </abstract>
      <kwd-group>
        <kwd>Software Ecosystems</kwd>
        <kwd>Clusters</kwd>
        <kwd>Ruby</kwd>
        <kwd>FLOSS</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Free/Libre Open Source Software (FLOSS) developers have to work
collaboratively in order to maintain, improve or extend their software. Especially when
their collaboration is underpinned by a common technology or market, and
operate through the exchange of information, resources and artifacts, Software
Ecosystems (SECOs) start to emerge [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Jansen et al. state that getting insights
into a SECO requires the quanti cation and measurement of speci c SECO
characteristics. Possible characteristics are the number of sub-communities, the
reciprocity of the ecosystem or the out degree of keystone actors. Moreover,
understanding SECO characteristics can aid in maximizing its pro tability, and
more concretely, SECO orchestrators can develop strategies to keep a SECO
vibrant and pro table for other organizations in the SECO.
      </p>
      <p>
        This paper addresses the characteristics of sub-communities or clusters within
the Ruby SECO. Clusters are de ned as sets of nodes which are connected
together by some path, that is, there exists a sequence of links that can be
traversed to go from one node to any other node. There exist, however, no paths
between two nodes in di erent clusters [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. As SECOs can be seen as large
social networks, where actors (developers) are connected through relationships
(collaborations) that hold them together [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], numerous clusters are present.
      </p>
      <p>
        The study of SECOs, or social networks, can be conducted by applying
Social Network Analysis (SNA). Several studies have applied SNA in the context
of open source. For example, Gao, Freeh and Madey used SNA to study core
developer networks on SourceForge.net hosted projects [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Lopez-Fernandez et
al. used SNA to analyze source code repositories of open source projects [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
Madey et al. applied SNA to model the open source network as collaborative
networks and studied the growth of these networks [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Previous studies are,
however, focused on the developer or project level, and not speci cally on the cluster
or sub-community level. Concretely put, this paper uses SNA to reveal
underlying clusters within the Ruby SECO and strives to de ne the characteristics
of relationships between developers. The ability to nd and analyze such
clusters can provide invaluable help in understanding and visualizing the structure
of networks and thus understanding the SECO. Several algorithms exist to nd
sub-communities or clusters within networks [8{10]. Popular algorithms for large
networks are based on the concept of modularity, which take the structure of a
network and decompose it into modular communities, i.e. sub-communities or
clusters. It looks for dense connections (relations) within groups, and sparse
connections between them. Furthermore, it requires less computational complexity
in contrast to other methods, e.g. graph partitioning. Our study uses the
Louvain method [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], a modularity algorithm that has successfully been applied to
nd sub-communities in large networks, such as Twitter, LinkedIn, and Flickr.
To extend our analysis, a survey is constructed to aid in the qualitative part
of relationships between developers. Hence, Ruby developers were asked
numerous questions related to other developers that were clustered together. Doing so
enabled us to classify qualitative data by cluster sizes.
      </p>
      <p>The remainder of the paper is structured as follows: Section 2 elaborates
on the research method and provides insights into the various steps undertaken
from data extraction to cluster identi cation. Furthermore, it elaborates on the
survey and how it was constructed. Section 3 discusses the rst ndings of the
data that were extracted from the Ruby repository and provides an overview of
distributions that de ne the Ruby ecosystem. Section 4 makes a rst classi
cation of survey results based on various cluster sizes. Finally, Section 5 concludes
our classi cation of results and provides improvements for future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Research Design</title>
      <p>Our study has taken as object of study the Ruby open source SECO. Ruby is
an object oriented programming language designed and developed in 1995 by
Yukihiro Matsumoto in Japan. The syntax is in uenced by Perl and Smalltalk
features and is similar in many respects. It was created to balance functional
programming with imperative programming. Ruby's most popular framework,
named Ruby on Rails, is an open source web framework that enables
developers to create web applications more easily. These applications, best described
as utilities or libraries, are called gems and are hosted on Ruby's repository
Rubygems.org. Several gems can be combined to create speci c features or
extend existing work.
2.1</p>
      <sec id="sec-2-1">
        <title>Research Question</title>
        <p>
          This paper is an extension of our previous explorative study, in which we
presented elements, characteristics, descriptives, roles, cliques and relationships of
the Ruby ecosystem [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. Our previous work was quantitative in nature and
lacked essential qualitative information. We replicated the study and focused
on relationships between developers within clusters. Thus, the main research
question answered in this paper is: What are the de ning characteristics of
relationships between developers within clusters of FLOSS ecosystems? To answer
this question, we looked at relationships between developers within the Ruby
SECO of various cluster sizes with respect to the number of developers residing
within them.
        </p>
        <p>Developers are connected by strong or weak ties. For example, developers
have strong ties if they are friends, classmates or working at the same company
(i.e. they know each other personally to some extent), and have coded together
to produce a working gem. Weak ties, by contrast, involve infrequent and limited
interaction. For example, developers are connected together through a
friend-offriend relationship, that is, developer a has worked with developer b, who in
turn has worked with developer c, developer a and c are now connected through
developer b. Our study further looks at these friend-of-friend relationships and
to what extent they constitute strong or weak ties.</p>
        <p>
          Strong ties are important because it improves the exchange of information
with other strong ties and reinforce companionship and support. The study of
strong ties can help us understand the structure and local information of a social
group [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. Weak ties bring us more new opportunities and resources which cannot
be obtained from close relations [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. The study of weak ties provides a global
view of the community as a whole.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Data Gathering</title>
        <p>We collected our data from Rubygems.org as it provided us with an API to
mine the data. Because integral collection was not possible, we developed several
scripts to extract the data one by one from the API's XML output. The data
was then stored in a relational database. The API of Rubygems.org provided us
with the following data on each gem:
1. Gem name
2. Total downloads
3. Current version
4. Downloads current version
5. Authors
6. Info
7. Project uri
8. Gem uri
9. Homepage uri
10. Wiki uri
11. Documentation uri
12. Mailing list uri
13. Source code uri
14. Bug tracker uri
15. Dependencies</p>
        <p>As our research was targeted at developers (authors), we distilled this
information from the complete dataset. Unfortunately, Rubygems.org stored
author information as a string, causing problems when multiple authors have
collaborated on a gem. Several formats for entering multiple authors were used
by project administrators, such as \Peter and John", \Peter &amp; John", \Peter,
John". This information was decoupled using several SQL statements which
ultimately resulted in database records with single entities. Each gem was given a
unique id and was linked to one or multiple authors. Data extraction was
performed on May 7th 2012, providing us with a snapshot of the Ruby ecosystem
as it was then.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Cluster Identi cation</title>
        <p>
          After data collection we visualized the data using Gephi [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], which is a free to
use application for social network analysis. Furthermore, Gephi is an interactive
visualization and exploration platform for all kinds of networks and complex
systems, dynamic and hierarchical graphs.
        </p>
        <p>
          A common property within networks is community structure. It is the
division of network nodes into groups within which the connections are dense, but
between which they are sparse [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. Newman and Girvan de ned the measure of
modularity to quantify the strengths of communities by using the denseness and
sparsity of the group's inner and outer connections. Their modularity measure is
a scalar value between -1 and 1, where 1 indicates networks with clusters that are
disconnected from each other, i.e. no nodes overlap two clusters. Their algorithm
is especially useful for undirected and unweighted graphs to reveal underlying
clusters.
        </p>
        <p>
          To identify clusters within the Ruby ecosystem we used the algorithm
proposed by Blondel, Guillaume, Lambiotte and Lefebvre [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], known as the Louvain
algorithm. Their algorithm is based on the work of Newman and Girvan but
improved in terms of computer time and modularity. We used the complete dataset
to create the graph where each node consists of a developer or gem. Developers
were connected to other developers if they both contributed to the same gem.
The above mentioned algorithm was then performed on the graph.
2.4
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Survey</title>
        <p>To get insights in the qualitative aspects of clusters, we constructed an online
survey that was personalized for Ruby developers registered on Rubygems.org.
The online survey1 was able to retrieve information on the respondent's cluster
from the database that contained information on developers and gems. For
example, if developer a was clustered in cluster k, all other gems and developers
in cluster k were shown to developer a when answering the survey.
1 http://www.ruby-research.com</p>
        <p>Data was collected between November 23rd 2012 and February 16th 2013.
Invitations to the survey were posted on forums, message boards, and developers
were invited to participate by contacting them via email. Email addresses were
obtained from public pro les on Rubygems.org.</p>
        <p>The variables measured in the survey fall into two categories. The rst
category measured relationships (ties) towards other developers and other gems
residing in the respondent's cluster, and if they had collaborated in producing
gems. Furthermore, it measured to what extent they had personal relationships
to other developers and, if any, how they were established. The second category
measured motivations for creating new gems and the various contributions/roles
developers have when creating gems with other developers.</p>
        <p>To measure characteristics of relationships (e.g. tie strength), answers could
be given on an ordinal scale (e.g. I know no - few - half - almost all - all
developers in my cluster). Because our research was explorative of nature, we were
not concerned about interval or ratio data to perform statistical analysis. The
ordinal scale was su cient in the sense that it enabled us to make some sort of
classi cation based on the a priori grouping of cluster sizes based on the number
of developers. Other questions were measured on a nominal scale, such as the
various types of relationships or motivations. Moreover, several checkboxes could
be selected that were processed with multiple answer analysis.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Data</title>
      <p>At the time of analysis, the Ruby ecosystem consists of 37,551 gems and 15,679
developers. On average, each gem is created by 2.39 developers. The gems vary in
their total downloads from just 48 downloads (\Whitelabel" by Peter Schroder)
to a number as high as 12,623,891 downloads (\Rack" by Christian Neukirchen),
with a mean value of 16,477.58 and a standard deviation of 238,668.06. Only 113
gems have total downloads exceeding one million, which constitute for 0.3% of
the total ecosystem. In contrast, 18,783 gems have equal or less than 1,000 total
downloads, representing 50% of the total ecosystem. Out of all the gems, 3.8%
had an additional uri to a wiki of their gem, 7.9% provided an uri to additional
documentation and only 1.5% provided the option to subscribe to their mailing
list.
3.1</p>
      <sec id="sec-3-1">
        <title>Clusters</title>
        <p>
          We have identi ed 10,586 valid clusters by performing the modularity algorithm
proposed by Blondel et al. [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. The modularity achieved by performing
modularity optimization (optimizing the modularity to nd distinct clusters) was
0.985, an indication that nearly all clusters are unique, i.e. no developers
exist in more than one cluster. These clusters are derived from all 37,551 gems
and 15,679 developers. During data analysis, a total of 328 clusters contained
a single node, which constituted a gem. These clusters were excluded from our
study as, apparently, project administrators failed to register its corresponding
developer(s). A manual search showed that the majority of these clusters are
registered as version 0.1, had just a few downloads and provided no additional
information. This can be caused by the free nature of its repository, where
registering a gem requires no strict rules or formats. An illustration of a random
cluster with 7 developers and 13 gems is shown in Fig. 1
        </p>
        <p>Number of Nodes Most clusters encompass just two nodes (5,819 clusters
that constitute 55% of the total ecosystem), that is, one developer that is linked
to its own gem. A smaller, but still relatively large part, consists of three nodes
(2,035 clusters, 19.2%), being a single developer who created two gems, or two
developers that have worked on the same gem. The distribution of nodes across
clusters shows that a small portion of just 0.5% are clusters with over 100 nodes.
In addition, the largest cluster consist of 600 nodes: 136 developers who created
464 gems, which account for less than 0.01% of the total ecosystem.
Interestingly, none of Ruby's top 10 most downloaded gems were part of the top 6 largest
clusters. \Activesupport", \Activerecord", \Actionpack", \Actionmailer",
\Activeresource" and \Rails", created by David Heinemeier Hansson, were part of
the 7th largest cluster (107 developers and 370 gems).</p>
        <p>Number of Developers/Gems Figures 2(a), 2(b), 2(c), 2(d) show the highly
skewed developer and gem distribution across clusters. The skewed distributions
further show that the vast majority of clusters consist of just one or two
developers. We identi ed 9,341 clusters with 1 developer (88.2%), 786 clusters with 2
developers (7.4%), and 206 clusters with 3 developers (1.9%). This shows that
Ruby's ecosystem, when looking at the number of developers within a cluster,
consists of 97.6% of clusters that are not larger than 3 developers. Moreover,
similar numbers are found when focusing on the number of gems. Approximately
90% of all clusters have not produced more than 4 gems.</p>
        <p>The ample part of the Ruby ecosystem consists of single developers working
on one or multiple gems. A smaller, but still relatively large part, consists of
two or three developers working together to produce gems. There are few
clusters that encompass tens or even +100 developers that are connected through
collaboration.</p>
        <p>100
s
r
e
p
o
l
e
v
e
d
f
o 10
r
e
b
m
u
N
1
ems 100
g
f
o
r
e
b
m
u
N 10</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Survey</title>
      <p>A total of 782 respondents lled in the survey, being approximately 5% of all
registered Ruby developers on Rubygems.org. To classify the responses, we grouped
clusters by the number of developers within them. As the distribution of
developers within a cluster is highly skewed, we created groups with minor increments
up to 10 developers. The remainder of clusters, being that with 10+ developers
are grouped together. This enabled us to classify survey data on cluster sizes
with respect to the number of developers. We excluded clusters of a single
developer for questions related to ties, as none were present. The classi cation of
responses are as follows: Clusters with one developer 403 responses, clusters with
2-3 developers 95 responses, clusters with 4-5 developers 35 responses, clusters
with 6-7 developers 13 responses, clusters with 8-9 developers 4 responses, and
nally, all clusters that have 10 or more developers 232 responses.
4.1</p>
      <sec id="sec-4-1">
        <title>Ties through Collaboration</title>
        <p>Tables 1 and 2 show survey data with respect to relationships with other
developers that are clustered together. The data of Table 1 provides an overview
of ties to other developers. These ties are a mixture of strong and weak ties,
for example, developers who have collaborated, have emailed, used each other's
gems etc. In addition, Table 2 shows the presence of strong ties, i.e. personal
relationships, classi ed into various cluster sizes.</p>
        <p>Two-third of the respondents in clusters with 2-3 developers know all other
developers with more than 50% of them having a personal relationship. When
looking at large clusters with over 10 developers, the vast majority (84.5%)
of developers know just a few other developers, 61.6% of these are personal of
nature. Comparing both tables reveals that the relations of strong ties in contrast
to ties in general do not drop considerable.</p>
        <p>Additionally, we asked, if personal relationships were present, how they were
established. The results are shown in Table 3. The large part of these personal
relationships are formed through friendships, work mates and through the open
source community. In all cluster groupings, they constitute the majority of the
responses. Personal relationships that are formed through the open source
community seem to grow from 16.5% in clusters with 2-3 developers, to 33.7% in
clusters with over 10 developers. In contrast, the percentage of personal
relationships that are formed through work associates (work at the same company)
seems to diminish from 41% in clusters with 2-3 developers to 25.4% in
clusters with 10+ developers. Furthermore, the Ruby ecosystem consists of very few
personal relationships that are bounded by family or schoolmates. The
respondents that answered "other" were given the option to write out an alternative.
More than half of them answered \conference" as a mean to establish personal
relationships.</p>
        <p>The relationships between developers and gems are based on the author eld
of the Rubygems.org repository. The algorithm, therefore, seeks for connections
based solely on this information. We asked developers if they would have
expected other developers or gems to be clustered within their cluster. From all
responses, 36.8% had expected other gems, and 30.8% had expected other
developers to be residing in their cluster. The gems that were expected were mostly
related to the Ruby on Rails framework, for example, Active Support, Rack,
Rails. Additionally, developers seem to have expected other gems on which they
have worked through pull requests. Pull requests are a common way of
collaborating with others, examples are adding updates or
xing bugs, that are then
sent to the project administrators. This does not imply that they list them as
an author. Several developers seem to have committed changes to various other
projects in which they were not mentioned as an author. Similarly, they would
have expected developers that have contributed via pull requests and that were
accepted in the codebase.
We asked developers what motivates them when creating new gems (projects).
The results are shown in Table 4 with the percentage of responses (adjusted for
multiple answers). In each grouping of cluster sizes, the majority of developers
are motivated by personal needs, i.e. they need to create a certain gem for their
own goals. This does not seem to increase or decrease when clusters consist of
more developers. Two other motivations that contribute for a some what smaller
part are \helping others" and \improving programming skills". The percentage
of responses for \helping others" seems to increase as clusters are getting larger.
Furthermore, 'fun' was a frequently given answer in the open text box.
Lastly, we asked developers about their contribution when creating gems with
other developers. Results are shown in Table 5 together with the percentage of
cases, as roles vary among di erent projects. Sixty percent of the cases create
gems solely by themselves, an indicator that large parts of the Ruby ecosystem
consist of single developers. This was also noticed from the skewed distribution
as discussed in Section 3. The remainder of roles are diverse and make up an
almost equal part of the cases. Project leaders are, however, in minority. Possibly
an indicator that Ruby projects are small in nature and do not consist of a clear
hierarchy of developers that are led by a project leader.
In this paper, we have mined data on relationships between developers and gems
from Ruby's repository Rubygems.org. We have used Social Network Analysis to
uncover underlying sub-communities, or clusters as we have labeled them. Based
on this data, we performed qualitative analysis by means of a survey to make a
rst attempt to nd characteristics of various cluster sizes. These clusters were
grouped together by the number of developers residing within them. The survey
was aimed at nding characteristics of connections or ties between developers
and gems. We analyzed if these connections were personal and how they were
established. Furthermore, we made an attempt to classify motivations amongst
various cluster sizes and the contributions or roles Ruby developers have when
collaborating with other developers.</p>
        <p>Clusters with few developers make up a large part of the Ruby Ecosystem.
Within these small clusters, developers often have personal relationships that
are mainly formed through friendship, work and through the open source
community. As clusters are increasing in developer size, the relationships (ties) to
other developers, personal and non-personal, seem to decline. It seems that Ruby
developers collaborate with other developers, but are not aware of
collaborations of friend-of-friend relationships. Additionally, conferences are important to
stimulate collaborations between developers, as developers have stated that it
facilitated in new collaborations. Personal relationships that are formed through
the Open Source community seem to grow as clusters are getting larger.
Furthermore, the ample part of the Ruby ecosystem consist of single developers who
create gems for personal use and do not engage in interaction.</p>
        <p>Our explorative study made a rst attempt into the classi cation of FLOSS
data in cluster sizes, but it is however far from complete. As developers have
stated, relationships can not solely be modeled by looking at information given
by project administrators, as this information lacks detailed information on the
actual number of developer contributions. A substantial amount of developers
are motivated by altruism and like to help others. As a consequence,
developers contribute by making pull requests/issues in which they are necessarily not
listed as an author by project administrators. This data is, however, available
in other common repositories such as Github. Clustering developers and gems
by incorporating this information would yield more information and a better
representation of the actual ecosystem structure.</p>
        <p>
          Another important aspect of the Ruby ecosystem is the existence of
dependencies between gems. These dependencies can either be runtime dependencies or
development dependencies. The rst are other gems that are essential to work in
real time for end-users, the latter are gems that are necessary for development
purposes [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. Although developers have not directly collaborated with other
developers from gem dependencies, incorporating these dependencies would
increase the complexity of the ecosystem and possibly provide a more in-depth
view of the actual structure.
        </p>
        <p>The data we collected by mining rubygems.org will be uploaded to
Flossmole.org to assist other researchers in the study of FLOSS ecosystems.
6</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgement</title>
      <p>We would like to thank all the Ruby developers who have lled in the survey
and especially Jon-Michael Deldin for his comments to this work.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Jansen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brinkkemper</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finkelstein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A sense of community: A research agenda for software ecosystems</article-title>
          .
          <source>In: 31st International Conference on Software Engineering</source>
          , New and Emerging Research Track. (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Messerschmitt</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szyperski</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Software ecosystem: understanding an indispensable technology and industry</article-title>
          . The MIT Press (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Christly</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Madey</surname>
          </string-name>
          , G.:
          <article-title>Application of social network analysis to the study of open source software</article-title>
          . In Bitzer, J.,
          <string-name>
            <surname>Schroder</surname>
          </string-name>
          , P.J.H., eds.:
          <article-title>The Economics of Open Source Development</article-title>
          .
          <source>Elsevier</source>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Haythornthwaite</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Tie strenghts and the impact of new media</article-title>
          .
          <source>In: Proceedings of the 34th Hawaii International Conference on Systems Science</source>
          , Maui, Hawaii (
          <year>2001</year>
          )
          <fpage>1019</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Freeh</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Madey</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Analysis and modeling of the open source software community</article-title>
          .
          <source>In: Proceedings of North American Association for Computational Social and Organizational Science Conference (NAACSOS</source>
          <year>2003</year>
          ).
          <article-title>(</article-title>
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Lopez-Fernandez</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Robles</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gonzalez-Barahona</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          , et al.:
          <article-title>Applying social network analysis to the information in cvs repositories</article-title>
          .
          <source>In: International Workshop on Mining Software Repositories</source>
          . (
          <year>2004</year>
          )
          <volume>101</volume>
          {
          <fpage>105</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Madey</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Freeh</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tynan</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>The open source software development phenomenon: An analysis based on social network theory</article-title>
          .
          <source>In: Americas conference on Information Systems (AMCIS2002)</source>
          . (
          <year>2002</year>
          )
          <year>1806</year>
          {
          <fpage>1813</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Radicchi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Castellano</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cecconi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Loreto</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parisi</surname>
          </string-name>
          , D., eds.:
          <article-title>De ning and identifying communities in networks</article-title>
          .
          <source>Number 101</source>
          , USA,
          <source>Proc. Natl. Acad. Sci. USA</source>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Newman</surname>
            ,
            <given-names>M.E.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Girvan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Finding and evaluating community structure in networks</article-title>
          .
          <source>Physical Review E</source>
          <volume>69</volume>
          (
          <issue>2</issue>
          ) (
          <year>2004</year>
          )
          <fpage>26113</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huberman</surname>
            ,
            <given-names>B.A.</given-names>
          </string-name>
          :
          <article-title>Finding communities in linear time: A physics approach</article-title>
          .
          <source>Eur. Phys. J</source>
          .
          <volume>38</volume>
          (
          <year>2004</year>
          )
          <volume>331</volume>
          {
          <fpage>338</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Blondel</surname>
            ,
            <given-names>V.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guillaume</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lambiotte</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lefebvre</surname>
          </string-name>
          , E.:
          <article-title>Fast unfolding of communities in large networks</article-title>
          .
          <source>Journal of Statistical Mechanics: Theory and Experiment</source>
          <volume>10</volume>
          (
          <year>October 2008</year>
          ) P10008
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Kabbedijk</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jansen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Steering insight: An exploration of the ruby software ecosystem</article-title>
          .
          <source>In: Proceedings of the Second International Conference on Software Business</source>
          . (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Granovetter</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The strength of weak ties</article-title>
          .
          <source>American Journal of Sociology</source>
          <volume>78</volume>
          (
          <issue>6</issue>
          ) (
          <year>1973</year>
          )
          <volume>1360</volume>
          {
          <fpage>1380</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Bastian</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heymann</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jacomy</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Gephi: An open source software for exploring and manipulating networks</article-title>
          .
          <source>In: International AAAI Conference on Weblogs and Social Media</source>
          . (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>