By Chris Zachor.  Introduction  Background  Changes  Methodology  Data Collection  Network Topologies  Measures  Tools  Conclusion  Questions.

Slides:



Advertisements
Similar presentations
Complex Networks: Complex Networks: Structures and Dynamics Changsong Zhou AGNLD, Institute für Physik Universität Potsdam.
Advertisements

Complex Networks Advanced Computer Networks: Part1.
Collective Dynamics of ‘Small World’ Networks C+ Elegans: Ilhan Savut, Spencer Telford, Melody Lim 29/10/13.
Analysis and Modeling of Social Networks Foudalis Ilias.
LYRIC-BASED ARTIST NETWORK METHODOLOGY Derek Gossi CS 765 Fall 2014.
Advanced Topics in Data Mining Special focus: Social Networks.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
UNDERSTANDING VISIBLE AND LATENT INTERACTIONS IN ONLINE SOCIAL NETWORK Presented by: Nisha Ranga Under guidance of : Prof. Augustin Chaintreau.
By Chris Zachor.  Introduction  Background  Open Source Software  The SourceForge community and network  Previous Work  What can be done different?
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Small Worlds and the Security of Ubiquitous Computing From : IEEE CNF Author : Harald Vogt Presented by Chen Shih Yu.
Search in a Small World JIN Xiaolong Based on [1].
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
A Model of Communities Multi-Layered Networks John Stevens Introduction This poster describes a multi-layered model of a community. This model builds on.
San Francisco Bay Area News Ecology Daniel Ramos CS790G Fall 2010.
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
Shortest path algorithm. Introduction 4 The graphs we have seen so far have edges that are unweighted. 4 Many graph situations involve weighted edges.
1 Drafting Behind Akamai (Travelocity-Based Detouring) AoJan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante Department of Electrical.
CS 765 – Fall 2014 Paulo Alexandre Regis Reddit analysis.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.
Presented By Tony Morelli. Outline  Intro/Problem Description Summary  Visual Network Representations  Numerical Network Representations  Questions/Comments.
1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.
Department of Computer Science, University of California, Irvine Site Visit for UC Irvine KD-D Project, April 21 st 2004 The Java Universal Network/Graph.
Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.
Analysis and Modeling of the Open Source Software Community Yongqin Gao, Greg Madey Computer Science & Engineering University of Notre Dame Vincent Freeh.
The United States air transportation network analysis Dorothy Cheung.
University of California at Santa Barbara Christo Wilson, Bryce Boe, Alessandra Sala, Krishna P. N. Puttaswamy, and Ben Zhao.
ON DESIGING END-USER MULTICAST FOR MULTIPLE VIDEO SOURCES Y.Nakamura, H.Yamaguchi, A.Hiromori, K.Yasumoto †, T.Higashino and K.Taniguchi Osaka University.
Programming with Alice Computing Institute for K-12 Teachers Summer 2011 Workshop.
Section 8 – Ec1818 Jeremy Barofsky March 31 st and April 1 st, 2010.
LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.
Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.
CS 765 – Fall 2014 Paulo Alexandre Regis Reddit analysis.
1 presentation of article: Small-World File-Sharing Communities Article: Adriana Iamnitchi, Matei Ripeanu, Ian Foster Presentation: Periklis Akritidis.
COM1721: Freshman Honors Seminar A Random Walk Through Computing Lecture 2: Structure of the Web October 1, 2002.
Science: Graph theory and networks Dr Andy Evans.
Topology and Evolution of the Open Source Software Community Advisors: Dr. Vincent W. Freeh Dr. Kevin Bowyer Supported in part by the National Science.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
3. SMALL WORLDS The Watts-Strogatz model. Watts-Strogatz, Nature 1998 Small world: the average shortest path length in a real network is small Six degrees.
Algorithms for Biological Networks Prof. Tijana Milenković Computer Science and Engineering University of Notre Dame Fall 2010.
ITEC 2620A Introduction to Data Structures Instructor: Prof. Z. Yang Course Website: 2620a.htm Office: TEL 3049.
Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Complex Network Theory – An Introduction Niloy Ganguly.
Topics Paths and Circuits (11.2) A B C D E F G.
Complex Network Theory – An Introduction Niloy Ganguly.
Tagging Systems and Their Effect on Resource Popularity Austin Wester.
1 Finding Spread Blockers in Dynamic Networks (SNAKDD08)Habiba, Yintao Yu, Tanya Y., Berger-Wolf, Jared Saia Speaker: Hsu, Yu-wen Advisor: Dr. Koh, Jia-Ling.
Informatics tools in network science
Transportation Networks September 9, 2014 Michael Lin Alex Farrell Ziqi Zhu Sanjeev Ramachadra.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,
GUILLOU Frederic. Outline Introduction Motivations The basic recommendation system First phase : semantic similarities Second phase : communities Application.
Randolph’s Community Health Network RANDOLPH HEALTH SERVICE AREA JULY 2015.
Analysis of University Researcher Collaboration Network Using Co-authorship Jiadi Yao School of Electronic and Computer Science,
Uncovering the Mystery of Trust in An Online Social Network
Network biology : protein – protein interactions
Comparison of Social Networks by Likhitha Ravi
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Gephi Gephi is a tool for exploring and understanding graphs. Like Photoshop (but for graphs), the user interacts with the representation, manipulate the.
Network Science: A Short Introduction i3 Workshop
The Watts-Strogatz model
Methodology & Current Results
Peer-to-Peer and Social Networks Fall 2017
Department of Computer Science University of York
Network Science: A Short Introduction i3 Workshop
Mining Collaboration Patterns
Topology and Dynamics of Complex Networks
Digital humanities Filtering.
Presentation transcript:

By Chris Zachor

 Introduction  Background  Changes  Methodology  Data Collection  Network Topologies  Measures  Tools  Conclusion  Questions

 Use network analysis to better understand the SourceForge and Github community developers  Identify key differences (if any) within the two communities  Examine the diversity of collaborations within these two communities

 The addition of Github to the study  Contains some of the same attributes to allow for a comparison  Other communities were looked at, but they either were not large enough or did not provide enough public data.

 Crawling the websites using a simple Perl script and regular expressions  Collect a project list from Sourceforge   No specified request limit  Check for duplicates

 Using the Github API provides our data  Limited to 60 API calls per minute  Use multiple computers to collect all 1.5 million projects

 Degree  Clustering Coeficient  Modularity  Power Law  Small World Phenomenon

 Average number of projects worked on by a developer  Average number of collaborations  Average number of developers on a project

 Examine how likely developers are to stick together in groups  Examine both average clustering coefficient for the entire network and the local clustering coefficient for nodes of interest

 Provide us with a measure of how diverse developer collaborations are.  Range -1 < Q < 1  Ranges closer to one show less diversity in collaboration choices  Ranges closer to negative one show more diversity in collaboration choices

 Previous studies have found that the Sourceforge community does follow the power law  No such study has been done on the Github community  Fewer developers should be apart of many project while many developers should be involved with only one project

 Previous studies have shown the Sourceforge community does exhibit small world properties  Once again, no study has been done on the Github community  Using Pajek, I will create a random network of the same nodes and edges  Then, compare the clustering coefficient and the average shortest path

 Perl  Pajek  cURL  wget  GUESS

 Through the use of network analysis, we hope to gain a better understanding of the developers of Sourceforge and Github communities.

Suggestions? Comments?