Consolidation of Gephi Stats

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Social Network Analysis (in 10 minutes) Nick Crossley.
Network analysis Sushmita Roy BMI/CS 576
Social network partition Presenter: Xiaofei Cao Partick Berg.
Network Matrix and Graph. Network Size Network size – a number of actors (nodes) in a network, usually denoted as k or n Size is critical for the structure.
DIJKSTRA’s Algorithm. Definition fwd search Find the shortest paths from a given SOURCE node to ALL other nodes, by developing the paths in order of increasing.
Analysis and Modeling of Social Networks Foudalis Ilias.
Relationship Mining Network Analysis Week 5 Video 5.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
 Copyright 2011 Digital Enterprise Research Institute. All rights reserved. Digital Enterprise Research Institute Enabling Networked Knowledge.
CONNECTIVITY “The connectivity of a network may be defined as the degree of completeness of the links between nodes” (Robinson and Bamford, 1978).
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Common Properties of Real Networks. Erdős-Rényi Random Graphs.
Centrality Measures These measure a nodes importance or prominence in the network. The more central a node is in a network the more significant it is to.
1 Routing Algorithms. 2 Outline zBellaman-Ford Algorithm zDijkstra Algorithm.
Degree A F H G B E D C. Adjacent A F H G B E D C.
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
Social Networks Corina Ciubuc.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Biological Networks Lectures 6-7 : February 02, 2010 Graph Algorithms Review Global Network Properties Local Network Properties 1.
Social Network Analysis: A Non- Technical Introduction José Luis Molina Universitat Autònoma de Barcelona
GRNmap Testing Analysis Grace Johnson and Natalie Williams June 10, 2015.
Social Network Analysis (1) LING 575 Fei Xia 01/04/2011.
Science: Graph theory and networks Dr Andy Evans.
Vertices and Edges Introduction to Graphs and Networks Mills College Spring 2012.
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 April 25, 2012.
SURP 2015 Presentation draft 15 minutes. Wt, initial weight 1 run.
Special Topics in Educational Data Mining HUDK5199 Spring 2013 March 25, 2012.
Lecture 13: Network centrality Slides are modified from Lada Adamic.
Slides are modified from Lada Adamic
Lecture 3 1.Different centrality measures of nodes 2.Hierarchical Clustering 3.Line graphs.
341- INTRODUCTION TO BIOINFORMATICS Overview of the Course Material 1.
Informatics tools in network science
Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :
Within Strain ANOVA WTdHAP4 p < (38.4%)2387 (38.6%) p < (24.7%)1489 (24.1 %) p < (13.8%)679 (11.0%) p < (7.25%)240.
Individual Gene Analysis, Categorized on Validity of Inputs.
About taking measurements, The meaning of ‘variation’, ‘range’ and ‘mean (average)’, The meaning of ‘accuracy’ and ‘precision’. Learning Objectives You.
Understanding Your Data Set Statistics are used to describe data sets Gives us a metric in place of a graph What are some types of statistics used to describe.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Importance Measures on Nodes Lecture 2 Srinivasan Parthasarathy 1.
SHORTEST ROUTE PROBLEM A Networking Model Report for DPA 702 QUANTITATIVE METHODS OF RESEARCH By: ALONA M. SALVA Cebu Technological University.
Systems modeling and statistical analysis allows comparison in the response to cold shock in Saccharomyces cerevisiae between Δhap4-derived and randomly.
Shortest Path from G to C Using Dijkstra’s Algorithm
Departments of Biology and Mathematics
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Network analysis.
Week 14 Assignment Kara Dismuke.
Party-by-Night Problem
Multi-Core Parallel Routing
Deletion of ZAP1 as a transcriptional factor has minor effects on S
Week 14 Assignment Kara Dismuke.
Figure Results from First Run
Closeness Centrality.
Why Social Graphs Are Different Communities Finding Triangles
Week 14 Output Figures Kristen Horstmann.
How Science works: Taking measurements.
Department of Computer Science University of York
Arcs of a Circle.
GRNmap Testing and Results
Closeness Centrality.
Bikalp Chamola (VAF) Shyam Singh (IRMA)
Graph Theory By Amy C. and John M..
A graphing calculator is required for some problems or parts of problems 2000.
How Science works: Taking measurements.
Network Graph Chuck Alice Vertices Nodes Edges Links Bob.
Loyola Marymount Unviersity
Week 14 – Network Modeling
Consolidation of Gephi Stats
GLN3.
There are 16 Different Combinations for the Test Inputs
Presentation transcript:

Consolidation of Gephi Stats Kristen Horstmann 3.2.17

Closeness centrality Measure of centrality in a network, calculated as average length of the shortest path between the node and all other nodes. Smaller closeness score: closer to many other nodes in the graph, smaller diameter and distance

id HAP4 1 2 3 4 5 6 7 8 9 10 11 ACE2 0.5 0.243902 0.419355 0.309524 0.297872 0.333333 0.184211 0.434783 0.255319 0.285714 ASH1 0.666667 0.384615 0.411765 0.375 0.388889 0.22807 0.344828 CIN5 0.636364 0.357143 0.351351 0.259259 0.36 0.215385 0.230769 GCR2 0.458333 0.371429 0.6 0.433333 0.269231 0.190476 GLN3 0.361111 0.218182 0.521739 0.44 0.324324 0.40625 0.244898 0.358974 0.428571 0.166667 0.529412 0.25 HMO1 0.55 0.277778 0.288889 0.315789 0.205882 0.318182 0.272727 0.323529 MSN2 0.769231 0.482759 0.245614 0.444444 0.292683 0.393939 SFP1 0.4 0.342105 0.341463 0.407407 STB5 0.37037 0.3 0.473684 0.352941 SWI4 0.8 0.28 0.27451 0.413793 0.368421 0.28125 0.171429 SWI5 0.322581 0.481481 0.264151 0.35 0.307692 YHP1 0.3125 0.378378 0.461538 0.196721 0.392857 YOX1 0.217391 0.325581 0.206897 ZAP1 0.363636

Harmonic Centrality Reverses the sum and reciprocal operations in the definition of closeness centrality Higher number indicates greater centrality

id HAP4 1 2 3 4 5 6 7 8 9 10 11 ACE2 0.611111 0.326667 0.525641 0.367949 0.355952 0.456667 0.27894 0.566667 0.395933 0.361667 ASH1 0.75 0.495 0.411538 0.424405 0.511905 0.475 0.540476 0.326587 0.42 CIN5 0.761905 0.428333 0.444872 0.361538 0.360714 0.498148 0.284609 0.654762 0.381581 0.6 GCR2 0.5 0.536667 0.496154 0.722222 0.346429 0.680556 0.538462 0.338095 0.288525 GLN3 0.478333 0.457692 0.412831 0.625 0.553704 0.560606 0.493849 0.487179 0.391171 0.44881 0.506944 0.461667 0.258648 0.62963 0.382143 HMO1 0.651515 0.351667 0.366667 0.377778 0.440476 0.490741 0.325879 0.409524 0.420933 0.4 MSN2 0.85 0.578333 0.589286 0.332823 0.552083 0.411111 0.515385 SFP1 0.520833 0.447436 0.302778 0.40119 0.514286 0.464286 STB5 0.547222 0.486667 0.398718 0.431349 0.601852 0.421429 0.595238 0.454167 SWI4 0.875 0.388095 0.340476 0.493056 0.460714 0.608333 0.383333 0.379167 0.27249 SWI5 0.395 0.596154 0.465278 0.322619 0.429762 0.445238 0.433333 YHP1 0.458333 0.5625 0.628788 0.285152 0.484848 YOX1 0.310238 0.456944 0.574074 0.495238 0.378571 0.298247 ZAP1 0.397222 0.435185 0.312585 0.4375

Betweenness Centrality centrality measure that indicates how often a node is found on a shortest path between two nodes, s and t. Nodes with high betweenness are higher connected with regulating other genes

id HAP4 1 2 3 4 5 6 7 8 9 10 11 ACE2 14 63.5 13.5 15.5 27 34.66667 ASH1 40 4.5 17 17.5 22 15 CIN5 31.5 29 35 34 78 19.5 GCR2 27.5 66.5 56.5 22.5 8.5 31 23.5 GLN3 30.5 7.5 23 74 37 11.5 25 48 HMO1 36 53 25.5 52 70 MSN2 66 73.33333 SFP1 12 21 13 99 STB5 20 84 30 55.16667 SWI4 41 13.83333 26 SWI5 43 65 3.5 44 YHP1 33.5 38 YOX1 18.5 39 24 ZAP1 19 1.5 5.5 33 48.5

Eccentricity Centrality shows how easily accessible a node is from other nodes, calculates max distance between other nodes Only takes out degree into account High value means it has a higher impact on other nodes

id HAP4 1 2 3 4 5 6 7 8 9 10 11 ACE2 0.5 0.243902 0.419355 0.309524 0.297872 0.333333 0.184211 0.434783 0.255319 0.285714 ASH1 0.666667 0.384615 0.411765 0.375 0.388889 0.22807 0.344828 CIN5 0.636364 0.357143 0.351351 0.259259 0.36 0.215385 0.230769 GCR2 0.458333 0.371429 0.6 0.433333 0.269231 0.190476 GLN3 0.361111 0.218182 0.521739 0.44 0.324324 0.40625 0.244898 0.358974 0.428571 0.166667 0.529412 0.25 HMO1 0.55 0.277778 0.288889 0.315789 0.205882 0.318182 0.272727 0.323529 MSN2 0.769231 0.482759 0.245614 0.444444 0.292683 0.393939 SFP1 0.4 0.342105 0.341463 0.407407 STB5 0.37037 0.3 0.473684 0.352941 SWI4 0.8 0.28 0.27451 0.413793 0.368421 0.28125 0.171429 SWI5 0.322581 0.481481 0.264151 0.35 0.307692 YHP1 0.3125 0.378378 0.461538 0.196721 0.392857 YOX1 0.217391 0.325581 0.206897 ZAP1 0.363636