MORO: a Cytoscape App for Relationship Analysis between Modularity and Robustness in Large-Scale Biological Networks
|
|
- Lora Fowler
- 5 years ago
- Views:
Transcription
1 MORO: a Cytoscape App for Relationship Analysis between Modularity and Robustness in Large-Scale Biological Networks Authors: Cong-Doan Truong, Tien-Dzung Tran and Yung-Keun Kwon October 8,
2 Contents l l l l Motivation Modularity and robustness definition Implementation & Results -Analysis of modularity and robustness -Module visualization -Module centrality & GO analysis -Parallel computation of robustness Conclusions 2
3 Motivation Low modularity ( ) High modularity ( ) Dynamical behaviors, particularly robustness, of biological networks can be highly affected by their modularity characteristics MORO is Cytoscape app for analyzing relationship between modularity and robustness Complex Systems Computing Lab 3
4 Modularity and robustness definition Complex Systems Computing Lab 4
5 Modularity definition Ø Given a directed graph G(V, E) B A Module V 1 M C w V in wout i Vi Module V 2 M P = ( w V i is1 w w 2 ) [0, 1] M G = max P M(P) Leicht EA, Newman MEJ: Community Structure in Directed Networks. Physical Review Letters 2008, 100(11): Noack A: Modularity clustering is force-directed layout. Physical Review E 2009, 79(2): D G E F P = {V *, V + } Module V 1 : w 89 : {A B, A C, B C} w >?@ 89 :: {C D} w BC 89 :: {G C} Module V 2 : w 8E : {D E, E F, F G, G D, D F, G E} w >?@ 8E :: {G C} w BC 8E :: {C D} M P = ^ ** * * ** + a E ** * * ** E = Complex Systems Computing Lab 5
6 Network robustness definition OR v^ OR v t Initial state original attractor s Inhibit Activate v a v u v + AND AND v u OR Initial state new attractor s vi v v0 v v w * AND OR AND Robustness: γ G = 1 n S k k I( s = s no q r C BS* p ) Complex Systems Computing Lab 6
7 In-/Out- module robustness definition Module V * Module V + In-Module robustness A G B C D E F Calculation of attractor similarity Out-Module robustness γ BC (V * ) I H J Calculation of attractor similarity γ >?@ (V * ) γ BC G = * z γ z BS* BC V B Module V^ γ >?@ G = * z γ z BS* >?@ V B Complex Systems Computing Lab 7
8 Implementation & Results 1. Case study 2. Module visualization 3. Module centrality & GO analysis 4. Parallel computation of robustness Complex Systems Computing Lab 8
9 Signaling networks STKE network: consists of 754 genes and 1,624 interactions HSN network: The human signal transduction network ( consists of 5,443 genes and 37,663 interactions The canonical cell signaling network (STKE network) Complex Systems Computing Lab 9
10 Analysis of modularity and robustness STKE network Modules: 16 Modularity: Robustness: HSN network Modules: 22 Modularity: Robustness: Complex Systems Computing Lab 10
11 Random Boolean network (RBN) model Shuffling interaction model Barabási-Albert (BA) Erdős-Rényi (ER) Erdős-Rényi variant model Scale free network (BA) Erdős-Rényi (ER) Complex Systems Computing Lab 11
12 Analysis of modularity and robustness Generate 6400 RBNs (BA model) and then examine the correlation between modularity and robustness 1 network robustness network modularity random networks HSN STKE Correlation coefficient = with p-value < 10 4 Complex Systems Computing Lab 12
13 Relationship of the network modularity to the in-/outmodule robustness - Relationship of the modularity to the inmodule robustness (R= , p- value <10-4 ). - Modularity and outmodule robustness (not significant). - Network robustness to the in-module robustness (R = , p-value <10-4 ). - Network robustness and out-module robustness (not significant). Complex Systems Computing Lab 13
14 Module visualization (1) Detailed visualization mode A brief mode with absolute relations A brief visualization with relative mode Complex Systems Computing Lab 14
15 Module visualization (2) Ø Results of the detailed visualization mode 16 modules of STKE network 22 modules of HSN network Complex Systems Computing Lab 15
16 Module visualization (3) STKE HSN Absolute mode The reduced visualization results after removing all links except about 30% of links with the highest weight values STKE HSN Complex Systems Computing Lab 16
17 Module visualization (4) STKE HSN Relative mode STKE HSN The reduced visualization results after removing all links except about 30% of links with the highest weight values Complex Systems Computing Lab 17
18 Module centrality analysis How each module is positioned in terms of relations among the modules? Five well-known centrality methods Degree (DEG) Closeness (CLO) Betweeness (BEW) Stress (STR) Eigenvector (EIG) Complex Systems Computing Lab 18
19 Module centrality result Ø The correlation between five centrality values and module sizes of STKE network The module size which is defined as the number of nodes belonging to the module showed positive relationships with all module centrality measures Complex Systems Computing Lab 19
20 GO analysis Choose largest module Select the rest of module Ø The interface of GO analysis function in MORO app g/ QuickGO/ Complex Systems Computing Lab 20
21 Parallel computation of robustness Ø Running time of MORO based on three modes such as single CPU, Multi-core CPU and GPU) with number of considered initial-states (1000) Running time (logarithimic scale based 10) Single CPU Multi-core CPU GPU Running mode Running time (logarithimic scale based 10) Single CPU Multi-core CPU GPU Running mode HSN network STKE network Complex Systems Computing Lab 21
22 Some interfaces of MORO Cytoscape app Complex Systems Computing Lab 22
23 Conclusions Summary: Analyze the relationship between network robustness and modularity Provide various module visualization modes Analyze module centrality by employing five well-known methods Analyze gene ontology of two groups of modules Implement robustness algorithms in parallel Provide a batch-mode simulation Future works: Consider various types of mutations such as a knockout and edge mutation Extend Boolean network model by using ordinary differential equations (ODEs) Complex Systems Computing Lab 23
24 Thank you for your attention! Any question?
Summary: What We Have Learned So Far
Summary: What We Have Learned So Far small-world phenomenon Real-world networks: { Short path lengths High clustering Broad degree distributions, often power laws P (k) k γ Erdös-Renyi model: Short path
More informationProperties of Biological Networks
Properties of Biological Networks presented by: Ola Hamud June 12, 2013 Supervisor: Prof. Ron Pinter Based on: NETWORK BIOLOGY: UNDERSTANDING THE CELL S FUNCTIONAL ORGANIZATION By Albert-László Barabási
More informationThe Gene Modular Detection of Random Boolean Networks by Dynamic Characteristics Analysis
Journal of Materials, Processing and Design (2017) Vol. 1, Number 1 Clausius Scientific Press, Canada The Gene Modular Detection of Random Boolean Networks by Dynamic Characteristics Analysis Xueyi Bai1,a,
More informationBasics of Network Analysis
Basics of Network Analysis Hiroki Sayama sayama@binghamton.edu Graph = Network G(V, E): graph (network) V: vertices (nodes), E: edges (links) 1 Nodes = 1, 2, 3, 4, 5 2 3 Links = 12, 13, 15, 23,
More informationWednesday, March 8, Complex Networks. Presenter: Jirakhom Ruttanavakul. CS 790R, University of Nevada, Reno
Wednesday, March 8, 2006 Complex Networks Presenter: Jirakhom Ruttanavakul CS 790R, University of Nevada, Reno Presented Papers Emergence of scaling in random networks, Barabási & Bonabeau (2003) Scale-free
More informationResponse Network Emerging from Simple Perturbation
Journal of the Korean Physical Society, Vol 44, No 3, March 2004, pp 628 632 Response Network Emerging from Simple Perturbation S-W Son, D-H Kim, Y-Y Ahn and H Jeong Department of Physics, Korea Advanced
More informationIncentive-Compatible Caching and Inter-Domain Traffic Engineering in CCN
Incentive-Compatible Caching and Inter-Domain Traffic Engineering in CCN Xun Shao, Hitoshi Asaeda 2016-05-19 Na9onal Ins9tute of Informa9on and Communica9ons Technology (NICT) 1 Outline Caching and inter-domain
More informationM.E.J. Newman: Models of the Small World
A Review Adaptive Informatics Research Centre Helsinki University of Technology November 7, 2007 Vocabulary N number of nodes of the graph l average distance between nodes D diameter of the graph d is
More informationComplex Networks. Structure and Dynamics
Complex Networks Structure and Dynamics Ying-Cheng Lai Department of Mathematics and Statistics Department of Electrical Engineering Arizona State University Collaborators! Adilson E. Motter, now at Max-Planck
More informationThe quantitative analysis of interactions takes bioinformatics to the next higher dimension: we go from 1D to 2D with graph theory.
1 The human protein-protein interaction network of aging-associated genes. A total of 261 aging-associated genes were assembled using the GenAge Human Database. Protein-protein interactions of the human
More informationCAIM: Cerca i Anàlisi d Informació Massiva
1 / 72 CAIM: Cerca i Anàlisi d Informació Massiva FIB, Grau en Enginyeria Informàtica Slides by Marta Arias, José Balcázar, Ricard Gavaldá Department of Computer Science, UPC Fall 2016 http://www.cs.upc.edu/~caim
More informationGraph-theoretic Properties of Networks
Graph-theoretic Properties of Networks Bioinformatics: Sequence Analysis COMP 571 - Spring 2015 Luay Nakhleh, Rice University Graphs A graph is a set of vertices, or nodes, and edges that connect pairs
More informationA Generating Function Approach to Analyze Random Graphs
A Generating Function Approach to Analyze Random Graphs Presented by - Vilas Veeraraghavan Advisor - Dr. Steven Weber Department of Electrical and Computer Engineering Drexel University April 8, 2005 Presentation
More informationWhen Network Embedding meets Reinforcement Learning?
When Network Embedding meets Reinforcement Learning? ---Learning Combinatorial Optimization Problems over Graphs Changjun Fan 1 1. An Introduction to (Deep) Reinforcement Learning 2. How to combine NE
More informationNick Hamilton Institute for Molecular Bioscience. Essential Graph Theory for Biologists. Image: Matt Moores, The Visible Cell
Nick Hamilton Institute for Molecular Bioscience Essential Graph Theory for Biologists Image: Matt Moores, The Visible Cell Outline Core definitions Which are the most important bits? What happens when
More informationOn Reshaping of Clustering Coefficients in Degreebased Topology Generators
On Reshaping of Clustering Coefficients in Degreebased Topology Generators Xiafeng Li, Derek Leonard, and Dmitri Loguinov Texas A&M University Presented by Derek Leonard Agenda Motivation Statement of
More information(Social) Networks Analysis III. Prof. Dr. Daning Hu Department of Informatics University of Zurich
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Outline Network Topological Analysis Network Models Random Networks Small-World Networks Scale-Free Networks
More informationAn Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization
An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization Pedro Ribeiro (DCC/FCUP & CRACS/INESC-TEC) Part 1 Motivation and emergence of Network Science
More informationCritical Phenomena in Complex Networks
Critical Phenomena in Complex Networks Term essay for Physics 563: Phase Transitions and the Renormalization Group University of Illinois at Urbana-Champaign Vikyath Deviprasad Rao 11 May 2012 Abstract
More informationPlan of the lecture I. INTRODUCTION II. DYNAMICAL PROCESSES. I. Networks: definitions, statistical characterization, examples II. Modeling frameworks
Plan of the lecture I. INTRODUCTION I. Networks: definitions, statistical characterization, examples II. Modeling frameworks II. DYNAMICAL PROCESSES I. Resilience, vulnerability II. Random walks III. Epidemic
More informationAn Introduction to Complex Systems Science
DEIS, Campus of Cesena Alma Mater Studiorum Università di Bologna andrea.roli@unibo.it Disclaimer The field of Complex systems science is wide and it involves numerous themes and disciplines. This talk
More informationSpectral Graph Multisection Through Orthogonality. Huanyang Zheng and Jie Wu CIS Department, Temple University
Spectral Graph Multisection Through Orthogonality Huanyang Zheng and Jie Wu CIS Department, Temple University Outline Motivation Preliminary Algorithm Evaluation Future work Motivation Traditional graph
More informationCABERNET: a Cytoscape app for Augmented Boolean models of gene Regulatory NETworks USER MANUAL
CABERNET: a Cytoscape app for Augmented Boolean models of gene Regulatory NETworks USER MANUAL Andrea Paroni 1, Alex Graudenzi 1, Giulio Caravagna 1, Giancarlo Mauri 1, and Marco Antoniotti 1 1 Dept. of
More informationSignal Processing for Big Data
Signal Processing for Big Data Sergio Barbarossa 1 Summary 1. Networks 2.Algebraic graph theory 3. Random graph models 4. OperaGons on graphs 2 Networks The simplest way to represent the interaction between
More informationIntroduction to Networks and Business Intelligence
Introduction to Networks and Business Intelligence Prof. Dr. Daning Hu Department of Informatics University of Zurich Sep 16th, 2014 Outline n Network Science A Random History n Network Analysis Network
More informationMCL. (and other clustering algorithms) 858L
MCL (and other clustering algorithms) 858L Comparing Clustering Algorithms Brohee and van Helden (2006) compared 4 graph clustering algorithms for the task of finding protein complexes: MCODE RNSC Restricted
More informationDynamic network generative model
Dynamic network generative model Habiba, Chayant Tantipathanananandh, Tanya Berger-Wolf University of Illinois at Chicago. In this work we present a statistical model for generating realistic dynamic networks
More informationModularity CMSC 858L
Modularity CMSC 858L Module-detection for Function Prediction Biological networks generally modular (Hartwell+, 1999) We can try to find the modules within a network. Once we find modules, we can look
More informationHeuristics for the Critical Node Detection Problem in Large Complex Networks
Heuristics for the Critical Node Detection Problem in Large Complex Networks Mahmood Edalatmanesh Department of Computer Science Submitted in partial fulfilment of the requirements for the degree of Master
More informationCourse Title : Computer Fundamentals & Programming in C. SLM Code : C-101. All questions carry equal marks. Total Marks : 20
Course Code : MCA -1 Course Title : Computer Fundamentals & Programming in C SLM Code : C-101 Assignment No. : MCA -1/ C-101/C-2018 Q.1 What is the advantages of using Hexadecimal numbers? Q.2 What do
More informationThe missing links in the BGP-based AS connectivity maps
The missing links in the BGP-based AS connectivity maps Zhou, S; Mondragon, RJ http://arxiv.org/abs/cs/0303028 For additional information about this publication click this link. http://qmro.qmul.ac.uk/xmlui/handle/123456789/13070
More informationThe Betweenness Centrality Of Biological Networks
The Betweenness Centrality Of Biological Networks Shivaram Narayanan Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements
More informationSmall World Properties Generated by a New Algorithm Under Same Degree of All Nodes
Commun. Theor. Phys. (Beijing, China) 45 (2006) pp. 950 954 c International Academic Publishers Vol. 45, No. 5, May 15, 2006 Small World Properties Generated by a New Algorithm Under Same Degree of All
More informationCS-E5740. Complex Networks. Scale-free networks
CS-E5740 Complex Networks Scale-free networks Course outline 1. Introduction (motivation, definitions, etc. ) 2. Static network models: random and small-world networks 3. Growing network models: scale-free
More informationStructure of biological networks. Presentation by Atanas Kamburov
Structure of biological networks Presentation by Atanas Kamburov Seminar Gute Ideen in der theoretischen Biologie / Systembiologie 08.05.2007 Overview Motivation Definitions Large-scale properties of cellular
More informationAdvanced Algorithms and Models for Computational Biology -- a machine learning approach
Advanced Algorithms and Models for Computational Biology -- a machine learning approach Biological Networks & Network Evolution Eric Xing Lecture 22, April 10, 2006 Reading: Molecular Networks Interaction
More informationCS224W: Analysis of Networks Jure Leskovec, Stanford University
CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 11/13/17 Jure Leskovec, Stanford CS224W: Analysis of Networks, http://cs224w.stanford.edu 2 Observations Models
More informationCase Studies in Complex Networks
Case Studies in Complex Networks Introduction to Scientific Modeling CS 365 George Bezerra 08/27/2012 The origin of graph theory Königsberg bridge problem Leonard Euler (1707-1783) The Königsberg Bridge
More informationNetwork Theory: Social, Mythological and Fictional Networks. Math 485, Spring 2018 (Midterm Report) Christina West, Taylor Martins, Yihe Hao
Network Theory: Social, Mythological and Fictional Networks Math 485, Spring 2018 (Midterm Report) Christina West, Taylor Martins, Yihe Hao Abstract: Comparative mythology is a largely qualitative and
More informationOn Complex Dynamical Networks. G. Ron Chen Centre for Chaos Control and Synchronization City University of Hong Kong
On Complex Dynamical Networks G. Ron Chen Centre for Chaos Control and Synchronization City University of Hong Kong 1 Complex Networks: Some Typical Examples 2 Complex Network Example: Internet (William
More informationExercise set #2 (29 pts)
(29 pts) The deadline for handing in your solutions is Nov 16th 2015 07:00. Return your solutions (one.pdf le and one.zip le containing Python code) via e- mail to Becs-114.4150@aalto.fi. Additionally,
More informationPersistent Homology in Complex Network Analysis
Persistent Homology Summer School - Rabat Persistent Homology in Complex Network Analysis Ulderico Fugacci Kaiserslautern University of Technology Department of Computer Science July 7, 2017 Anything has
More informationECS 234: Data Analysis: Clustering ECS 234
: Data Analysis: Clustering What is Clustering? Given n objects, assign them to groups (clusters) based on their similarity Unsupervised Machine Learning Class Discovery Difficult, and maybe ill-posed
More informationRetina Workbench Users Guide
Retina Workbench Users Guide 1. Installing Retina Workbench 2. Launching Retina Workbench a. Starting Retina Workbench b. Registering for a new account c. Connecting to database 3. Expression data window
More informationSection 7.12: Similarity. By: Ralucca Gera, NPS
Section 7.12: Similarity By: Ralucca Gera, NPS Motivation We talked about global properties Average degree, average clustering, ave path length We talked about local properties: Some node centralities
More informationSocial and Technological Network Analysis. Lecture 6: Network Robustness and Applica=ons. Dr. Cecilia Mascolo
Social and Technological Network Analysis Lecture 6: Network Robustness and Applica=ons Dr. Cecilia Mascolo In This Lecture We revisit power- law networks and define the concept of robustness We show the
More informationTutorial:OverRepresentation - OpenTutorials
Tutorial:OverRepresentation From OpenTutorials Slideshow OverRepresentation (about 12 minutes) (http://opentutorials.rbvi.ucsf.edu/index.php?title=tutorial:overrepresentation& ce_slide=true&ce_style=cytoscape)
More informationPhase Transitions in Random Graphs- Outbreak of Epidemics to Network Robustness and fragility
Phase Transitions in Random Graphs- Outbreak of Epidemics to Network Robustness and fragility Mayukh Nilay Khan May 13, 2010 Abstract Inspired by empirical studies researchers have tried to model various
More informationA Quick Guide to Using Cerebral in InnateDB
A Quick Guide to Using Cerebral in InnateDB Cerebral can be used to visualize interaction networks from a set of interactions from InnateDB. Cerebral uses subcellular localization annotations to provide
More informationUniversal Behavior of Load Distribution in Scale-free Networks
Universal Behavior of Load Distribution in Scale-free Networks K.-I. Goh, B. Kahng, and D. Kim School of Physics and Center for Theoretical Physics, Seoul National University, Seoul 151-747, Korea (February
More informationCS249: SPECIAL TOPICS MINING INFORMATION/SOCIAL NETWORKS
CS249: SPECIAL TOPICS MINING INFORMATION/SOCIAL NETWORKS Overview of Networks Instructor: Yizhou Sun yzsun@cs.ucla.edu January 10, 2017 Overview of Information Network Analysis Network Representation Network
More informationGraph Theory. Graph Theory. COURSE: Introduction to Biological Networks. Euler s Solution LECTURE 1: INTRODUCTION TO NETWORKS.
Graph Theory COURSE: Introduction to Biological Networks LECTURE 1: INTRODUCTION TO NETWORKS Arun Krishnan Koenigsberg, Russia Is it possible to walk with a route that crosses each bridge exactly once,
More informationOverlay (and P2P) Networks
Overlay (and P2P) Networks Part II Recap (Small World, Erdös Rényi model, Duncan Watts Model) Graph Properties Scale Free Networks Preferential Attachment Evolving Copying Navigation in Small World Samu
More informationUNIVERSITA DEGLI STUDI DI CATANIA FACOLTA DI INGEGNERIA
UNIVERSITA DEGLI STUDI DI CATANIA FACOLTA DI INGEGNERIA PhD course in Electronics, Automation and Complex Systems Control-XXIV Cycle DIPARTIMENTO DI INGEGNERIA ELETTRICA ELETTRONICA E DEI SISTEMI ing.
More informationIEICE TRANS. COMMUN., VOL.Exx??, NO.xx MARCH
IEICE TRANS. COMMUN., VOL.Exx??, NO.xx MARCH 2010 1 PAPER Special Section on New Generation Network towards Innovative Future Society. Self organizing topology transformation for Peer-to-Peer (P2P) networks
More informationComplex networks Phys 682 / CIS 629: Computational Methods for Nonlinear Systems
Complex networks Phys 682 / CIS 629: Computational Methods for Nonlinear Systems networks are everywhere (and always have been) - relationships (edges) among entities (nodes) explosion of interest in network
More informationAnalysis of Large-Scale Networks: NetworkX
Analysis of Large-Scale Networks NetworkX JP Onnela Department of Biostatistics Harvard School of Public Health July 17, 2014 Outline 1 Overview of NetworkX 2 Nodes and Edges 3 Node Degree and Neighbors
More informationGraph similarity. Laura Zager and George Verghese EECS, MIT. March 2005
Graph similarity Laura Zager and George Verghese EECS, MIT March 2005 Words you won t hear today impedance matching thyristor oxide layer VARs Some quick definitions GV (, E) a graph G V the set of vertices
More informationCommunity Structure and Beyond
Community Structure and Beyond Elizabeth A. Leicht MAE: 298 April 9, 2009 Why do we care about community structure? Large Networks Discussion Outline Overview of past work on community structure. How to
More informationV4 Matrix algorithms and graph partitioning
V4 Matrix algorithms and graph partitioning - Community detection - Simple modularity maximization - Spectral modularity maximization - Division into more than two groups - Other algorithms for community
More informationEFFECT OF VARYING THE DELAY DISTRIBUTION IN DIFFERENT CLASSES OF NETWORKS: RANDOM, SCALE-FREE, AND SMALL-WORLD. A Thesis BUM SOON JANG
EFFECT OF VARYING THE DELAY DISTRIBUTION IN DIFFERENT CLASSES OF NETWORKS: RANDOM, SCALE-FREE, AND SMALL-WORLD A Thesis by BUM SOON JANG Submitted to the Office of Graduate Studies of Texas A&M University
More informationAnalytical reasoning task reveals limits of social learning in networks
Electronic Supplementary Material for: Analytical reasoning task reveals limits of social learning in networks Iyad Rahwan, Dmytro Krasnoshtan, Azim Shariff, Jean-François Bonnefon A Experimental Interface
More informationInternet as a Complex Network. Guanrong Chen City University of Hong Kong
Internet as a Complex Network Guanrong Chen City University of Hong Kong 1 Complex Network: Internet (K. C. Claffy) 2 Another View of the Internet http://www.caida.org/analysis/topology/as_core_network/
More informationUniversal Properties of Mythological Networks Midterm report: Math 485
Universal Properties of Mythological Networks Midterm report: Math 485 Roopa Krishnaswamy, Jamie Fitzgerald, Manuel Villegas, Riqu Huang, and Riley Neal Department of Mathematics, University of Arizona,
More informationAttack Vulnerability of Network with Duplication-Divergence Mechanism
Commun. Theor. Phys. (Beijing, China) 48 (2007) pp. 754 758 c International Academic Publishers Vol. 48, No. 4, October 5, 2007 Attack Vulnerability of Network with Duplication-Divergence Mechanism WANG
More informationCSE 258 Lecture 12. Web Mining and Recommender Systems. Social networks
CSE 258 Lecture 12 Web Mining and Recommender Systems Social networks Social networks We ve already seen networks (a little bit) in week 3 i.e., we ve studied inference problems defined on graphs, and
More informationExamples of Complex Networks
Examples of Complex Networks Neural Network (C. Elegans) http://gephi.org/wp-content/uploads/2008/12/screenshot-celegans.png Food Web http://1.bp.blogspot.com/_vifbm3t8bou/sbhzqbchiei/aaaaaaaaaxk/rsc-
More informationGirls Talk Math Summer Camp
From Brains and Friendships to the Stock Market and the Internet -Sanjukta Krishnagopal 10 July 2018 Girls Talk Math Summer Camp Some real networks Social Networks Networks of acquaintances Collaboration
More informationWeb Resources. iphemap: An atlas of phenotype to genotype relationships of human ipsc models of neurological diseases
Web Resources iphemap: An atlas of phenotype to genotype relationships of human ipsc models of neurological diseases Ethan W. Hollingsworth 1, 2, Jacob E. Vaughn 1, 2, Josh C. Orack 1,2, Chelsea Skinner
More informationSocial Data Management Communities
Social Data Management Communities Antoine Amarilli 1, Silviu Maniu 2 January 9th, 2018 1 Télécom ParisTech 2 Université Paris-Sud 1/20 Table of contents Communities in Graphs 2/20 Graph Communities Communities
More informationStatistical analysis of the airport network of Pakistan
PRAMANA c Indian Academy of Sciences Vol. 85, No. 1 journal of July 2015 physics pp. 173 183 Statistical analysis of the airport network of Pakistan YASIR TARIQ MOHMAND, AIHU WANG and HAIBIN CHEN School
More informationCSE 158 Lecture 11. Web Mining and Recommender Systems. Social networks
CSE 158 Lecture 11 Web Mining and Recommender Systems Social networks Assignment 1 Due 5pm next Monday! (Kaggle shows UTC time, but the due date is 5pm, Monday, PST) Assignment 1 Assignment 1 Social networks
More informationUsing network analysis to assess the centrality of second-tier banks in CHAPS
Using network analysis to assess the centrality of second-tier banks in CHAPS Ana Lasaosa CPSS workshop on payment system monitoring indicators 9 October 2012 Motivation Tiering in CHAPS creates risks:
More informationComplex Networks: A Review
Complex Networks: A Review International Journal of Computer Applications (0975 8887) Kriti Sharma Student - M.tech (CSE) CSE Dept., Guru Nanak Dev University, RC Gurdaspur, India Minni Ahuja Astt. Prof.
More informationTELCOM2125: Network Science and Analysis
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2015 Figures are taken from: M.E.J. Newman, Networks: An Introduction 2
More informationDrug/Cell-line Browser (DBC) v1.0 - User Manual
Drug/Cell-line Browser (DBC) v1.0 - User Manual Written by Qiaonan Duan and Avi Ma ayan Last Updated: 6/26/2014 Table of Contents I. Abstract II. Installation and Requirements III. Instructions 1. Cell-line
More informationPeer-to-Peer Data Management
Peer-to-Peer Data Management Wolf-Tilo Balke Sascha Tönnies Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 10. Networkmodels 1. Introduction Motivation
More informationDate Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation
Name: Instructor: Engr. Date Performed: Marks Obtained: /10 Group Members (ID):. Checked By: Date: Experiment # 04 Boolean Expression Simplification and Implementation OBJECTIVES: To understand the utilization
More informationEdge Weight Method for Community Detection in Scale-Free Networks
Edge Weight Method for Community Detection in Scale-Free Networks Sorn Jarukasemratana Tsuyoshi Murata Tokyo Institute of Technology WIMS'14 June 2-4, 2014 - Thessaloniki, Greece Modularity High modularity
More informationGene selection through Switched Neural Networks
Gene selection through Switched Neural Networks Marco Muselli Istituto di Elettronica e di Ingegneria dell Informazione e delle Telecomunicazioni Consiglio Nazionale delle Ricerche Email: Marco.Muselli@ieiit.cnr.it
More informationNDIA 19th Annual System Engineering Conference, Springfield, Virginia October 24-27, 2016
NDIA 19th Annual System Engineering Conference, Springfield, Virginia October 24-27, 2016 Caesar S. Benipayo, PhD Student Under advisement of Dr. Michael Grenn and Dr. Blake Roberts Department of Engineering
More informationOn the Approximability of Modularity Clustering
On the Approximability of Modularity Clustering Newman s Community Finding Approach for Social Nets Bhaskar DasGupta Department of Computer Science University of Illinois at Chicago Chicago, IL 60607,
More informationNode Similarity. Ralucca Gera, Applied Mathematics Dept. Naval Postgraduate School Monterey, California
Node Similarity Ralucca Gera, Applied Mathematics Dept. Naval Postgraduate School Monterey, California rgera@nps.edu Motivation We talked about global properties Average degree, average clustering, ave
More informationGraphs,EDA and Computational Biology. Robert Gentleman
Graphs,EDA and Computational Biology Robert Gentleman rgentlem@hsph.harvard.edu www.bioconductor.org Outline General comments Software Biology EDA Bipartite Graphs and Affiliation Networks PPI and transcription
More informationRevisiting Botnet Models and Their Implications for Takedown Strategies
Revisiting Botnet Models and Their Implications for Takedown Strategies Ting-Fang Yen and Michael K. Reiter 2 RSA Laboratories, Cambridge, MA tingfang.yen@rsa.com 2 University of North Carolina, Chapel
More informationComparisons and validation of statistical clustering techniques for microarray gene expression data. Outline. Microarrays.
Comparisons and validation of statistical clustering techniques for microarray gene expression data Susmita Datta and Somnath Datta Presented by: Jenni Dietrich Assisted by: Jeffrey Kidd and Kristin Wheeler
More informationA NEW DCT-BASED WATERMARKING METHOD FOR COPYRIGHT PROTECTION OF DIGITAL AUDIO
International journal of computer science & information Technology (IJCSIT) Vol., No.5, October A NEW DCT-BASED WATERMARKING METHOD FOR COPYRIGHT PROTECTION OF DIGITAL AUDIO Pranab Kumar Dhar *, Mohammad
More informationCytoscape:un approccio sistematico all'analisi dei dati sperimentali
Cytoscape:un approccio sistematico all'analisi dei dati sperimentali Michele Petterlini michele@petterlini.it Università di Verona Centro di BioMedicina Computazionale The network Network: a graph representation
More informationComputing Science 300 Sample Final Examination
Computing Science 300 Sample Final Examination 1. [10 points] Generally speaking, input and output operations can be done using two different methods, busy-waiting and interrupt-driven (using DMA or single
More informationIntroduction to network metrics
Universitat Politècnica de Catalunya Version 0.5 Complex and Social Networks (2018-2019) Master in Innovation and Research in Informatics (MIRI) Instructors Argimiro Arratia, argimiro@cs.upc.edu, http://www.cs.upc.edu/~argimiro/
More informationAn Evolving Network Model With Local-World Structure
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 47 423 An Evolving Network odel With
More informationHigher order clustering coecients in Barabasi Albert networks
Physica A 316 (2002) 688 694 www.elsevier.com/locate/physa Higher order clustering coecients in Barabasi Albert networks Agata Fronczak, Janusz A. Ho lyst, Maciej Jedynak, Julian Sienkiewicz Faculty of
More informationVolume 2, Issue 11, November 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 11, November 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationAre You Ready? Angle Relationships
SKILL 5 Angle Relationships Teaching Skill 5 Objective Identify angle relationships. Begin by explaining to students that angle relationships often provide information about the measure of the angles.
More informationSocial Network Analysis of the Planetary Data System
Social Network Analysis of the Planetary Data System Final Presentation Kate Martin Mark Avnet May 9, 2006 ESD.342 Advanced System Architecture Overview Planetary Data System Image courtesy of NASA. Decomposing
More informationSTRUCTURAL ANALYSIS OF ELECTRICAL NETWORKS
CRIS, Third International Conference on Critical Infrastructures, Alexandria, VA, September 2006 STRUCTURAL ANALYSIS OF ELECTRICAL NETWORKS Karla Atkins (*), Jiangzhuo Chen (*), V. S. Anil Kumar (*) and
More informationOECD QSAR Toolbox v.3.4. Types of endpoint vs. endpoint correlations using ToxCast and other endpoint data applied in Toolbox 3.4
OECD QSAR Toolbox v.3.4 Types of endpoint vs. endpoint correlations using ToxCast and other endpoint data applied in Toolbox 3.4 Outlook Background Objectives The exercise Workflow Background This presentation
More informationOh Pott, Oh Pott! or how to detect community structure in complex networks
Oh Pott, Oh Pott! or how to detect community structure in complex networks Jörg Reichardt Interdisciplinary Centre for Bioinformatics, Leipzig, Germany (Host of the 2012 Olympics) Questions to start from
More informationDANCer: Dynamic Attributed Network with Community Structure Generator
DANCer: Dynamic Attributed Network with Community Structure Generator Oualid Benyahia, Christine Largeron, Baptiste Jeudy, Osmar Zaïane To cite this version: Oualid Benyahia, Christine Largeron, Baptiste
More informationLesson 4. Random graphs. Sergio Barbarossa. UPC - Barcelona - July 2008
Lesson 4 Random graphs Sergio Barbarossa Graph models 1. Uncorrelated random graph (Erdős, Rényi) N nodes are connected through n edges which are chosen randomly from the possible configurations 2. Binomial
More information