The Structure of Scientific Collaboration Networks by M. E. J. Newman CMSC 601 Paper Summary Marie desJardins January 27, 2009.

Slides:



Advertisements
Similar presentations
Network analysis Sushmita Roy BMI/CS 576
Advertisements

Scale Free Networks.
Analysis and Modeling of Social Networks Foudalis Ilias.
Information Networks Small World Networks Lecture 5.
Advanced Topics in Data Mining Special focus: Social Networks.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
T HE S TRUCTURE OF S CIENTIFIC C OLLABORATION N ETWORKS & R ESEARCH F UNDING N ETWORKS CS790g Complex Networks Jigar Patel November 30 th 2009.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
Network Statistics Gesine Reinert. Yeast protein interactions.
CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.
Web as Graph – Empirical Studies The Structure and Dynamics of Networks.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Common Properties of Real Networks. Erdős-Rényi Random Graphs.
Global topological properties of biological networks.
Advanced Topics in Data Mining Special focus: Social Networks.
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.
Summary from Previous Lecture Real networks: –AS-level N= 12709, M=27384 (Jan 02 data) route-views.oregon-ix.net, hhtp://abroude.ripe.net/ris/rawdata –
CS8803-NS Network Science Fall 2013
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.
Information Networks Power Laws and Network Models Lecture 3.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Analysis and Modeling of the Open Source Software Community Yongqin Gao, Greg Madey Computer Science & Engineering University of Notre Dame Vincent Freeh.
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.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
COLOR TEST COLOR TEST. Social Networks: Structure and Impact N ICOLE I MMORLICA, N ORTHWESTERN U.
Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
Social Network Basics CS315 – Web Search and Data Mining.
Jure Leskovec Computer Science Department Cornell University / Stanford University Joint work with: Jon Kleinberg (Cornell), Christos.
Structural Properties of Networks: Introduction Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Shi Zhou University College London Second-order mixing in networks Shi Zhou University College London.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
"Social Networks, Cohesion and Epidemic Potential" James Moody Department of Sociology Department of Mathematics Undergraduate Recognition Ceremony May.
BotGraph: Large Scale Spamming Botnet Detection Yao Zhao, Yinglian Xie, Fang Yu, Qifa Ke, Yuan Yu, Yan Chen, and Eliot Gillum Speaker: 林佳宜.
Complex Networks Measures and deterministic models Philippe Giabbanelli.
Complex Network Theory – An Introduction Niloy Ganguly.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Social Network Analysis Aerospace Data Mining Center
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
Complex Dynamical Networks: Modeling, Control
How Do “Real” Networks Look?
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
Class 2: Graph Theory IST402. Can one walk across the seven bridges and never cross the same bridge twice? Network Science: Graph Theory THE BRIDGES OF.
Class 2: Graph Theory IST402.
Information Retrieval Search Engine Technology (10) Prof. Dragomir R. Radev.
Lecture II Introduction to complex networks Santo Fortunato.
The simultaneous evolution of author and paper networks
Lecture 23: Structure of Networks
Structural Properties of Networks: Introduction
Structural Properties of Networks: Introduction
How Do “Real” Networks Look?
Lecture 23: Structure of Networks
Structural Properties of Networks: Introduction
Network Science: A Short Introduction i3 Workshop
How Do “Real” Networks Look?
How Do “Real” Networks Look?
Peer-to-Peer and Social Networks Fall 2017
How Do “Real” Networks Look?
Department of Computer Science University of York
Network Science: A Short Introduction i3 Workshop
Science Chapter 1.
Lecture 23: Structure of Networks
Lecture 9: Network models CS 765: Complex Networks
Presentation transcript:

The Structure of Scientific Collaboration Networks by M. E. J. Newman CMSC 601 Paper Summary Marie desJardins January 27, 2009

Outline Overview Social networks Scientific collaboration networks  Properties  Data sets Results Conclusions

Overview Computationally analyze scientific collaboration networks Uses actual data sets from online archives Findings:  small-world property  presence of “clustering”  power law distribution of #collaborators, #papers  different patterns in different fields

Social Networks Idea: Represent acquaintanceship relationships between individuals  Measure graph-theoretic properties Widely studied in social science Penny Peter Sergei Lise David Marie

Degree (# edges)  z(Marie) = 4  z = 3 Degree distribution = [2, 2, 3, 3, 4, 4] Clustering  C = probability (ij | ik, jk) = 12/20 =.6 Degree of separation (path length)  average = 1.47  random graph  log N / log z (typically 6) Properties of Social Networks Penny Peter Sergei Lise David Marie

Scientific Collaboration Networks Represent co-authorship relationships Data sets:  Biomedical research (MEDLINE)  Theoretical physics (Los Alamos e-Print Archive (arxiv))  High-energy physics (SPIRES)  Computer science (NCSTRL) Papers from  13K – 2M papers

Erdös Number Paul Erdös  Famous Hungarian mathematician  Published over 1400 papers!  Erdös Number = co-authorship distance to Erdös  Marie’s Erdös Number = ??

Counting Authors Ambiguity in names (first name vs. first initial vs. all initials)  Two counts: all initials vs. 1 st initial   Upper/lower bounds on number of authors

General Properties Average number of papers per author: 4 Average number of authors per paper: 3  Max: 1681!! (SPIRES) Average number of collaborators:  Ranges from 4 (high-energy theory) to 173 (SPIRES) Size of largest connected component:  Ranges from 60% (CS) to 90% (astrophysics) Amount of clustering:  Ranges from 7% (MEDLINE) to 73% (SPIRES)

Degree Distribution Earlier work showed power law distribution of degree (would be straight line) Here we see a power law distribution with an exponential cutoff  Conjecture: result of limited time window, and limited publication life of scientists

Degrees of Separation Average degree of separation  6  “Small world” property – comparable to distance in random graph Diameter (max distance) typically around 20  (for largest connected component)

Summary Scientific collaboration networks  Social networks exhibiting interesting structure  Lots of available data Key characteristics  High clustering  Small-world property  Power-law distribution of #authors, #papers  Properties vary across fields