Analysis of University Researcher Collaboration Network Using Co-authorship Jiadi Yao (jy2e08@ecs.soton.ac.uk) School of Electronic and Computer Science,

Slides:



Advertisements
Similar presentations
‘Small World’ Networks (An Introduction) Presenter : Vishal Asthana
Advertisements

Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Network biology Wang Jie Shanghai Institutes of Biological Sciences.
Fundamentals of Computer Networks ECE 478/578 Lecture #13: Packet Switching (2) Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Analysis and Modeling of Social Networks Foudalis Ilias.
Junction Trees And Belief Propagation. Junction Trees: Motivation What if we want to compute all marginals, not just one? Doing variable elimination for.
 Copyright 2011 Digital Enterprise Research Institute. All rights reserved. Digital Enterprise Research Institute Enabling Networked Knowledge.
HCS Clustering Algorithm
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.
Semantic text features from small world graphs Jure Leskovec, IJS + CMU John Shawe-Taylor, Southampton.
A Model of Communities Multi-Layered Networks John Stevens Introduction This poster describes a multi-layered model of a community. This model builds on.
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
Assessing the Effect of Deceptive Data in the Web of Trust Yi Hu, Brajendra Panda, and Yanjun Zuo Computer Science and Computer Engineering Department.
Introduction to Computer Networks 09/23 Presenter: Fatemah Panahi.
CS8803-NS Network Science Fall 2013
Towards Modeling Legitimate and Unsolicited Traffic Using Social Network Properties 1 Towards Modeling Legitimate and Unsolicited Traffic Using.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
Social Network Analysis: A Non- Technical Introduction José Luis Molina Universitat Autònoma de Barcelona
LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.
Attila Kovács PhD candidate Corvinus University of Budapest Political networks in the European Parliament Network analysis of the 2013 CAP reform ‚MAKE’
Introduction Of Tree. Introduction A tree is a non-linear data structure in which items are arranged in sequence. It is used to represent hierarchical.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Social Network Basics CS315 – Web Search and Data Mining.
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.
InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.
Chapter 10 Graph Theory Eulerian Cycle and the property of graph theory 10.3 The important property of graph theory and its representation 10.4.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
CCR = Connectivity Residue Ratio = Pr. [ node pair connected by an edge are together in a common page on computer disk drive.] “U of M Scientists were.
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
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
Tree - in “math speak” An ________ graph is a set of vertices/nodes and a set of edges, each edge connects two vertices. Any undirected graph in which.
Bennington’s Community Health Network. Study Objective Objective Describe the network of organizations that has emerged in each Blueprint HSA to support.
A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,
Graph clustering to detect network modules
Connectivity and the Small World
Finding Dense and Connected Subgraphs in Dual Networks
Link-Level Internet Structures
Uncovering the Mystery of Trust in An Online Social Network
16장. Networking and Internetworking Devices
Chapter 4 Data Link Layer Switching
Network analysis.
Community detection in graphs
Venn Diagram large Graphs
Network Science: A Short Introduction i3 Workshop
Peer-to-Peer and Social Networks
The Watts-Strogatz model
Can you draw this picture without lifting up your pen/pencil?
Michael L. Nelson CS 495/595 Old Dominion University
Centralities (4) Ralucca Gera,
Graphs Chapter 11 Objectives Upon completion you will be able to:
Peer-to-Peer and Social Networks Fall 2017
Indexing and Hashing Basic Concepts Ordered Indices
Small World Networks Scotty Smith February 7, 2007.
Department of Computer Science University of York
Network Science: A Short Introduction i3 Workshop
Area of Rectangles and Parallelograms
Minimum Spanning Tree Optimizations
Linking Memories across Time via Neuronal and Dendritic Overlaps in Model Neurons with Active Dendrites  George Kastellakis, Alcino J. Silva, Panayiota.
ECE 753: FAULT-TOLERANT COMPUTING
Figure 11-1.
COMPUTER NETWORKS CS610 Lecture-18 Hammad Khalid Khan.
Figure Overview.
Figure Overview.
Warm Up – Tuesday Find the critical times for each vertex.
Important Problem Types and Fundamental Data Structures
Virtual LAN (VLAN).
Graphs G = (V,E) V is the vertex set.
Presentation transcript:

Analysis of University Researcher Collaboration Network Using Co-authorship Jiadi Yao (jy2e08@ecs.soton.ac.uk) School of Electronic and Computer Science, University of Southampton, Southampton, SO17 1BJ 1 Introduction Social network analysis gives evidence for the connections between groups of individuals. It is these connections that channel flow of information and the sharing of knowledge. As universities move towards more interdisciplinary modes of research and funding, an effective network that links its entire cohort of active researchers is vital. 3 Author Analysis & Path Length Analysis Researcher Oriented Analysis Figure 2 Visualisation of the collaboration network of chosen authors (Red nodes) in the ECS. Authors are grouped in their own research group, and only the authors that have direct collaboration with the red author is shown. This gives a direct sense of how collaborative is the author in analysis and the research groups he has worked with. Using the size of an author’s collaboration, we can find out the set of people that were most collaborative. We call them the ‘core’ of the network. Table 1 Comparisons between different dataset in ECS and large databases. APL: Average path length, the average of the shortest path between any pair in the network. This measures the effectiveness of the information flow in a network, the smaller the better. Network Properties Comparison Figure 1 Overview of co-authorship structure between researchers in the School of Electronic and Computer Science in the University of Southampton. 2 1 2 Co-authorship Graph Analysis 3 5 1 Sparse fan shaped group. Information has to flow through the root node to reach the leaf nodes. In ECS, these generally represents a supervisor with a group of students 4 Disconnected groups and individuals 3 Node bridging multiple groups 2 Dense fan shaped group. Multiple root nodes and leaf nodes tend to interconnected. In ECS, these generally represents head of group with researchers 5 Dense group 4 Figure 3 Comparison of the path length distribution when removing the core and dangling authors. For a network that has a smaller core (Left), the result of removing the core authors from the network is devastating – the longest path length extended from 4 to 17; while removing the dangling authors from the network(PhD students) did not shorten the path length. For a network that has a larger core (Right), removing the core nodes did not extended the path length as much – from 13 extended to 16; while removing the dangling authors did not shorten the path length 4 Conclusion The ECS community is a small-world network with similar knowledge sharing to those communities formed by an entire discipline. The collaboration between ECS is a small network with average distance 4 – four degrees of separation The flow of information is closely related to: The collaboration circle of the ‘Core’ authors Not so with dangling authors (PhD students)