V 1 Introduction! Mon, Oct 15, 2012! Bioinformatics 3 Volkhard Helms!
|
|
|
- Ambrose Morton
- 6 years ago
- Views:
Transcription
1 V 1 Introduction! Mon, Oct 15, 2012! Bioinformatics 3 Volkhard Helms!
2 How Does a Cell Work?! A cell is a crowded environment! => many different proteins,! metabolites, compartments,! On a microscopic level! => direct two-body interactions! At the macroscopic level! => complex behavior! Can we understand the behavior from the interactions?! Medalia et al, Science 298 (2002) 1209! => Connectivity! Bioinformatics 3 WS 12/13! V 1! 2!
3 The view of traditional molecular biology! Molecular Biology: "One protein one function"! mutation => phenotype! Linear one-way dependencies: regulation at the DNA level, proteins follow! DNA => RNA => protein => phenotype! Structural Biology: "Protein structure determines its function"! biochemical conditions => phenotype! No feedback, just re-action:! genetic information! molecular biochemical =>! =>! =>! structure! function! phenotype! Bioinformatics 3 WS 12/13! V 1! 3!
4 The Network View of Biology! Molecular Systems Biology: "It's both + molecular interactions"! genetic information! molecular biochemical =>! =>! =>! structure! function! phenotype! molecular interactions! => highly connected network of various interactions, dependencies! => study networks! Bioinformatics 3 WS 12/13! V 1! 4!
5 Example: Proteins in the Cell Cycle! From Lichtenberg et al,! Science 307 (2005) 724:! color coded assignment of proteins in time-dependent complexes during the cell cycle! => protein complexes are transient! => describe with a time dependent network! Bioinformatics 3 WS 12/13! V 1! 5!
6 Major Metabolic Pathways! static connectivity! dynamic response to <=>! <=>! external conditions! different states during the cell cycle! Bioinformatics 3 WS 12/13! V 1! 6!
7 Bioinformatics 3 WS 12/13! V 1! 7!
8 Metabolism of E. coli! Bioinformatics 3 WS 12/13! from the KEGG Pathway database! V 1! 8!
9 Königsberg (1736)! Can one cross all seven bridges once in one continuous (closed) path???! Bioinformatics 3 WS 12/13! Images: google maps, wikimedia! V 1! 9!
10 The Königsberg Connections! Turn problem into a graph:! i) each neighborhood is a node! ii) each bridge is a link! iii) straighten the layout! k = 3! k = 5! k = 3! k = 3! Continuous path! <=>!2 nodes with odd degree! Closed continuous path! <=> only nodes with even degree! see also: Bioinformatics 3 WS 12/13! V 1! 10!
11 Draw in one stroke:! Bioinformatics 3 WS 12/13! V 1! 11!
12 Quantify the "Hairy Monsters"! Network Measures:! No. of edges, nodes! => size of the network! Average degree <k>! => density of connections! Degree distribution P(k)! => structure of the network! Cluster coefficient C(k)! => local connectivity! Connected components! => subgraphs! Schwikowski, Uetz, Fields, Nature Biotech. 18, 1257 (2001)! Bioinformatics 3 WS 12/13! V 1! 12!
13 Lecture Overview! Protein complexes: spatial structure!! => experiments, spatial fitting, docking! Protein association:!! => interface properties, spatial simulations! Protein-Protein-Interaction Networks: pairwise connectivity!! => data from experiments, quality check! PPI: static network structure!! => network measures, clusters, modules,! Gene regulation: cause and response!! => Boolean networks! Systems Biology! Metabolic networks: steady state of large networks!! => FBA, extreme pathways! Metabolic networks / signaling networks: dynamics!! => ODEs, modules, stochastic effects! Bioinformatics 3 WS 12/13! V 1! 13!
14 Literature! Lecture slides available before the lecture! Suggested reading! Textbooks! => check our web page! => check computer science library! Bioinformatics 3 WS 12/13! V 1! 14!
15 How to pass this course! Schein = you need to pass 3 out of 4 short tests and!!! you need to pass the final exam! Short tests:! Final exam:! 4 tests of 45 min each! planned are: first half of lectures V6, V12, V18, V24!!!average grade is computed from 3 best tests! If you have passed 2 tests but failed 1-2 tests, you can! select one failed test for an oral re-exam.! written test of 120 min about assignments! requirements for participation:!! 50% of the points from the assignments!! one assignment task blackboard!! 2 short tests passed! planned: Fri, Feb. 8, 2013???! Bioinformatics 3 WS 12/13! V 1! 15!
16 Assignments! Tutors:! Christian Spaniol, Ruslan Akulenko,!!! Mohamed Hamed, Nadine Schaadt,! Tutorial: Wed, 12:00 14:00, E2 1, room 007! 10 assignments with 100 points each! Assignments are part of the course material (not everything is covered in lecture)! => one solution for two students (or one)! => hand-written or one printable PDF/PS file per ! => content: data analysis + interpretation think!! => no 100% solutions required!!!! => attach the source code of the programs for checking (no suppl. data)! => present one task at the blackboard! Hand in at the following Fri electronically until 13:00 or!!!!!!!! printed at the start of the lecture.! Bioinformatics 3 WS 12/13! V 1! 16!
17 Some Graph Basics! Network <=> Graph! Formal definition:! A graph G is an ordered pair (V, E) of a set V of vertices and a set E of edges.! G = (V, E)! undirected graph! directed graph! If E = V (2) => fully connected graph! Bioinformatics 3 WS 12/13! V 1! 17!
18 Graph Basics II! Subgraph:! G' = (V', E') is a subset of G = (V, E)! Weighted graph:! Weights assigned to the edges! Practical question: how to define useful subgraphs?! Note: no weights for vertices! => why???! Bioinformatics 3 WS 12/13! V 1! 18!
19 Walk the Graph! Path = sequence of connected vertices!!! start vertex => internal vertices => end vertex! Two paths are independent (internally vertex-disjoint),!!! if they have no internal vertices in common.! Vertices u and v are connected, if there exists a path from u to v.!!! otherwise: disconnected! Trail = path, in which all edges are distinct! Length of a path = number of vertices sum of the edge weights! How many paths connect the green to the red vertex?! How long are the shortest paths?! Find the four trails from the green to the red vertex.! How many of them are independent?! Bioinformatics 3 WS 12/13! V 1! 19!
20 Local Connectivity: Degree! Degree k of a vertex = number of edges at this vertex!!! Directed graph => discern kin and kout! Degree distribution P(k) = fraction of nodes with k connections! k! 0! 1! 2! 3! 4! P(k)! 0! 3/7! 1/7! 1/7! 2/7! k! 0! 1! 2! 3! P(kin)! 1/7! 5/7! 0! 1/7! P(kout)! 2/7! 3/7! 1/7! 1/7! Bioinformatics 3 WS 12/13! V 1! 20!
21 Basic Types: Random Network! Generally: N vertices connected by L edges! More specific: distribute the edges randomly between the vertices! Maximal number of links between N vertices:! => propability p for an edge between two randomly selected nodes:! => average degree! => path lengths grow with log(n) => small world! Bioinformatics 3 WS 12/13! V 1! 21!
22 Network with N vertices, L edges! => Probability for a random link:! Random Network: P(k)! Probability that random node has links to k other particular nodes:! Probability that random node has links to any k other nodes:! Limit of large graph: N! oo, p = " / N! Bioinformatics 3 WS 12/13! V 1! 22!
23 Random Network: P(k)! Many independently placed edges => Poisson statistics! k! P(k " = 2)! 0 " " 1 " " 2 " " 3 " " 4 " " 5 " " 6 " " 7 " " 8 " " 9 " " => Small probability for k >>! 10 " e-05" Bioinformatics 3 WS 12/13! V 1! 23!
24 Basic Types: Scale-Free! Growing network a la Barabasi and Albert (1999):! start from a small "nucleus"! add new node with n links! connect new links to existing nodes with probability k! (preferential attachment; (BA) = 1)! => "the rich get richer"! Properties:! power-law degree distribution:! with = 3 for the BA model! self-similar structure with highly connected hubs (no intrinsic length scale)! => path lengths grow with log(log(n))! => very small world! Bioinformatics 3 WS 12/13! V 1! 24!
25 Power law (Potenzgesetz)! The Power-Law Signature! Take log on both sides:! Plot log(p) vs. log(k) => straight line! Note: for fitting against experimental data it is often better to use the integrated P(k)! => integral smoothes the data! Bioinformatics 3 WS 12/13! V 1! 25!
26 The World-Wide-Web:!! => growth via links to portal sites! Scale-Free: Examples! Flight connections between airports!! => large international hubs, small local airports! Protein interaction networks!! => some central,!! ubiquitous proteins! Bioinformatics 3 WS 12/13! V 1! 26!
27 Saturation: Ageing + Costs! Example:! network of movie actors (with how many other actors did!!! an actor appear in a joint movie?)! Each actor makes new acquaintances for ~40 years before retirement! => limits maximum number of links! Example: building up a physical computer network! It gets more and more expensive for a network hub to grow further! => number of links saturates! cost! Bioinformatics 3 WS 12/13! V 1! 27!
28 Hierarchical, Regular, Clustered! Tree-like network with similar degrees! => like an organigram! => hierarchic network! All nodes have the same degree and the same local neighborhood! => regular network! P(k) for these example networks? (finite size!)! Note: most real-world networks are somewhere in between the basic types! Bioinformatics 3 WS 12/13! V 1! 28!
29 Summary! What you learned today:! => networks are everywhere! => how to get the "Schein" for BI3! => basic network types and definitions:! random, scale-free, degree distribution, Poisson distribution, ageing,! Next lecture:! => clusters, percolation! => algorithm on a graph: Dijkstra's shortest path algorithm! => looking at graphs: graph layout! Further Reading:! R. Albert and A L Barabási, Statistical mechanics of complex networks! Rev. Mod. Phys. 74 (2002) 47-97! Bioinformatics 3 WS 12/13! V 1! 29!
V 2 Clusters, Dijkstra, and Graph Layout
Bioinformatics 3 V 2 Clusters, Dijkstra, and Graph Layout Mon, Oct 31, 2016 Graph Basics A graph G is an ordered pair (V, E) of a set V of vertices and a set E of edges. Degree distribution P(k) Random
Graph 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,
Properties 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
Nick 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
Lesson 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
Advanced 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
Example for calculation of clustering coefficient Node N 1 has 8 neighbors (red arrows) There are 12 connectivities among neighbors (blue arrows)
Example for calculation of clustering coefficient Node N 1 has 8 neighbors (red arrows) There are 12 connectivities among neighbors (blue arrows) Average clustering coefficient of a graph Overall measure
Special-topic lecture bioinformatics: Mathematics of Biological Networks
Special-topic lecture bioinformatics: Leistungspunkte/Credit points: 5 (V2/Ü1) This course is taught in English language. The material (from books and original literature) are provided online at the course
Network analysis. Martina Kutmon Department of Bioinformatics Maastricht University
Network analysis Martina Kutmon Department of Bioinformatics Maastricht University What's gonna happen today? Network Analysis Introduction Quiz Hands-on session ConsensusPathDB interaction database Outline
V 2 Clusters, Dijkstra, and Graph Layout
Bioinformatics 3 V 2 Clusters, Dijkstra, and Graph Layout Fri, Oct 19, 2012 Graph Basics A graph G is an ordered pair (V, E) of a set V of vertices and a set E of edges. Degree distribution P(k) Random
V 2 Clusters, Dijkstra, and Graph Layout"
Bioinformatics 3! V 2 Clusters, Dijkstra, and Graph Layout" Mon, Oct 21, 2013" Graph Basics" A graph G is an ordered pair (V, E) of a set V of vertices and a set E of edges." Degree distribution P(k)!
CS-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
An 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
Biological Networks Analysis
Biological Networks Analysis Introduction and Dijkstra s algorithm Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein The clustering problem: partition genes into distinct
A quick review. The clustering problem: Hierarchical clustering algorithm: Many possible distance metrics K-mean clustering algorithm:
The clustering problem: partition genes into distinct sets with high homogeneity and high separation Hierarchical clustering algorithm: 1. Assign each object to a separate cluster.. Regroup the pair of
Structure 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
Analysis of Biological Networks. 1. Clustering 2. Random Walks 3. Finding paths
Analysis of Biological Networks 1. Clustering 2. Random Walks 3. Finding paths Problem 1: Graph Clustering Finding dense subgraphs Applications Identification of novel pathways, complexes, other modules?
The 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
CAIM: 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
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
Case 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
Wednesday, 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
A quick review. Which molecular processes/functions are involved in a certain phenotype (e.g., disease, stress response, etc.)
Gene expression profiling A quick review Which molecular processes/functions are involved in a certain phenotype (e.g., disease, stress response, etc.) The Gene Ontology (GO) Project Provides shared vocabulary/annotation
V10 Metabolic networks - Graph connectivity
V10 Metabolic networks - Graph connectivity Graph connectivity is related to analyzing biological networks for - finding cliques - edge betweenness - modular decomposition that have been or will be covered
Graph-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
Biological Networks Analysis
iological Networks nalysis Introduction and ijkstra s algorithm Genome 559: Introduction to Statistical and omputational Genomics Elhanan orenstein The clustering problem: partition genes into distinct
- relationships (edges) among entities (nodes) - technology: Internet, World Wide Web - biology: genomics, gene expression, proteinprotein
Complex networks Phys 7682: Computational Methods for Nonlinear Systems networks are everywhere (and always have been) - relationships (edges) among entities (nodes) explosion of interest in network structure,
Basics 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,
How Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
How Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns Roadmap Next several lectures: universal structural properties of networks Each large-scale network is unique microscopically,
Mathematics of Networks II
Mathematics of Networks II 26.10.2016 1 / 30 Definition of a network Our definition (Newman): A network (graph) is a collection of vertices (nodes) joined by edges (links). More precise definition (Bollobàs):
The 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
(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
Graph Theory for Network Science
Graph Theory for Network Science Dr. Natarajan Meghanathan Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Networks or Graphs We typically
Networks in economics and finance. Lecture 1 - Measuring networks
Networks in economics and finance Lecture 1 - Measuring networks What are networks and why study them? A network is a set of items (nodes) connected by edges or links. Units (nodes) Individuals Firms Banks
Plan 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
Complex 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
CS249: 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
Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 14.1 Graphs, Paths, and Circuits INB Table of Contents Date Topic Page # January 27, 2014 Test #1 14 January 27, 2014 Test # 1 Corrections 15 January 27, 2014 Section 14.1 Examples 16 January 27,
Precept 4: Traveling Salesman Problem, Hierarchical Clustering. Qian Zhu 2/23/2011
Precept 4: Traveling Salesman Problem, Hierarchical Clustering Qian Zhu 2/23/2011 Agenda Assignment: Traveling salesman problem Hierarchical clustering Example Comparisons with K-means TSP TSP: Given the
Graph Theory for Network Science
Graph Theory for Network Science Dr. Natarajan Meghanathan Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Networks or Graphs We typically
Social and Technological Network Data Analytics. Lecture 5: Structure of the Web, Search and Power Laws. Prof Cecilia Mascolo
Social and Technological Network Data Analytics Lecture 5: Structure of the Web, Search and Power Laws Prof Cecilia Mascolo In This Lecture We describe power law networks and their properties and show
Introduction to Complex Networks Analysis
Introduction to Complex Networks Analysis Miloš Savić Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Serbia Complex systems and networks System - a set of interrelated
Exercise 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,
Introduction to Engineering Systems, ESD.00. Networks. Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow
Introduction to Engineering Systems, ESD.00 Lecture 7 Networks Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow The Bridges of Königsberg The town of Konigsberg in 18 th century
Some Graph Theory for Network Analysis. CS 249B: Science of Networks Week 01: Thursday, 01/31/08 Daniel Bilar Wellesley College Spring 2008
Some Graph Theory for Network Analysis CS 9B: Science of Networks Week 0: Thursday, 0//08 Daniel Bilar Wellesley College Spring 008 Goals this lecture Introduce you to some jargon what we call things in
Constructing a G(N, p) Network
Random Graph Theory Dr. Natarajan Meghanathan Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Introduction At first inspection, most
NETWORK BASICS OUTLINE ABSTRACT ORGANIZATION NETWORK MEASURES. 1. Network measures 2. Small-world and scale-free networks 3. Connectomes 4.
NETWORK BASICS OUTLINE 1. Network measures 2. Small-world and scale-free networks 3. Connectomes 4. Motifs ABSTRACT ORGANIZATION In systems/mechanisms in the real world Entities have distinctive properties
M.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
Evolutionary origins of modularity
Evolutionary origins of modularity Jeff Clune, Jean-Baptiste Mouret and Hod Lipson Proceedings of the Royal Society B 2013 Presented by Raghav Partha Evolvability Evolvability capacity to rapidly adapt
6.2. Paths and Cycles
6.2. PATHS AND CYCLES 85 6.2. Paths and Cycles 6.2.1. Paths. A path from v 0 to v n of length n is a sequence of n+1 vertices (v k ) and n edges (e k ) of the form v 0, e 1, v 1, e 2, v 2,..., e n, v n,
Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 14.1 Graphs, Paths, and Circuits What You Will Learn Graphs Paths Circuits Bridges 14.1-2 Definitions A graph is a finite set of points called vertices (singular form is vertex) connected by line
MAE 298, Lecture 9 April 30, Web search and decentralized search on small-worlds
MAE 298, Lecture 9 April 30, 2007 Web search and decentralized search on small-worlds Search for information Assume some resource of interest is stored at the vertices of a network: Web pages Files in
Math 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
Information Security in Scale Free Networks
Information Security in Scale Free Networks Mohamed Ridza Wahiddin, PhD, DSc Department of Computer Science Faculty of Information and Communication Technology International Islamic University Malaysia
Week 8: The fundamentals of graph theory; Planar Graphs 25 and 27 October, 2017
(1/25) MA284 : Discrete Mathematics Week 8: The fundamentals of graph theory; Planar Graphs 25 and 27 October, 2017 1 Definitions 1. A graph 2. Paths and connected graphs 3. Complete graphs 4. Vertex degree
Machine Learning and Modeling for Social Networks
Machine Learning and Modeling for Social Networks Olivia Woolley Meza, Izabela Moise, Nino Antulov-Fatulin, Lloyd Sanders 1 Introduction to Networks Computational Social Science D-GESS Olivia Woolley Meza
Modeling and Simulating Social Systems with MATLAB
Modeling and Simulating Social Systems with MATLAB Lecture 8 Introduction to Graphs/Networks Olivia Woolley, Stefano Balietti, Lloyd Sanders, Dirk Helbing Chair of Sociology, in particular of Modeling
Heuristics 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
Comparison of Centralities for Biological Networks
Comparison of Centralities for Biological Networks Dirk Koschützki and Falk Schreiber Bioinformatics Center Gatersleben-Halle Institute of Plant Genetics and Crop Plant Research Corrensstraße 3 06466 Gatersleben,
Signal 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
Graphs (MTAT , 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402
Graphs (MTAT.05.080, 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402 homepage: http://courses.cs.ut.ee/2012/graafid (contains slides) For grade: Homework + three tests (during or after
3 Global Properties of Networks
3 Global Properties of Networks Ralf Steuer a and Gorka Zamora-López b a Humboldt University Berlin, Institute for Theoretical Biology, Invalidenstr. 43, 10115 Berlin, Germany. b University of Potsdam,
Response 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
Web Structure Mining Community Detection and Evaluation
Web Structure Mining Community Detection and Evaluation 1 Community Community. It is formed by individuals such that those within a group interact with each other more frequently than with those outside
Incoming, Outgoing Degree and Importance Analysis of Network Motifs
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 6, June 2015, pg.758
CSCI5070 Advanced Topics in Social Computing
CSCI5070 Advanced Topics in Social Computing Irwin King The Chinese University of Hong Kong king@cse.cuhk.edu.hk!! 2012 All Rights Reserved. Outline Graphs Origins Definition Spectral Properties Type of
Chapter 2 Graphs. 2.1 Definition of Graphs
Chapter 2 Graphs Abstract Graphs are discrete structures that consist of vertices and edges connecting some of these vertices. Graphs have many applications in Mathematics, Computer Science, Engineering,
An Investigation into the Free/Open Source Software Phenomenon using Data Mining, Social Network Theory, and Agent-Based
An Investigation into the Free/Open Source Software Phenomenon using Data Mining, Social Network Theory, and Agent-Based Greg Madey Computer Science & Engineering University of Notre Dame UIUC - NSF Workshop
Lecture 3: Recap. Administrivia. Graph theory: Historical Motivation. COMP9020 Lecture 4 Session 2, 2017 Graphs and Trees
Administrivia Lecture 3: Recap Assignment 1 due 23:59 tomorrow. Quiz 4 up tonight, due 15:00 Thursday 31 August. Equivalence relations: (S), (R), (T) Total orders: (AS), (R), (T), (L) Partial orders: (AS),
Networks and Discrete Mathematics
Aristotle University, School of Mathematics Master in Web Science Networks and Discrete Mathematics Small Words-Scale-Free- Model Chronis Moyssiadis Vassilis Karagiannis 7/12/2012 WS.04 Webscience: lecture
Graphs Eulerian and Hamiltonian Applications Graph layout software. Graphs. SET07106 Mathematics for Software Engineering
Graphs SET76 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2 Copyright Edinburgh Napier University Graphs Slide /3 Outline Graphs Eulerian
Euler and Hamilton paths. Jorge A. Cobb The University of Texas at Dallas
Euler and Hamilton paths Jorge A. Cobb The University of Texas at Dallas 1 Paths and the adjacency matrix The powers of the adjacency matrix A r (with normal, not boolean multiplication) contain the number
Complex-Network Modelling and Inference
Complex-Network Modelling and Inference Lecture 8: Graph features (2) Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/notes/ Network_Modelling/ School
Network visualization and analysis with Cytoscape. Based on slides by Gary Bader (U Toronto)
Network visualization and analysis with Cytoscape Based on slides by Gary Bader (U Toronto) Network Analysis Workflow Load Networks e.g. PPI data Import network data into Cytoscape Load Attributes e.g.
L Modelling and Simulating Social Systems with MATLAB
851-0585-04L Modelling and Simulating Social Systems with MATLAB Lesson 6 Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano and S. Wehrli) ETH Zürich 2010-03-29 Lesson 6 Contents History:
Graphs,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
Introduction 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
Classic Graph Theory Problems
Classic Graph Theory Problems Hiroki Sayama sayama@binghamton.edu The Origin Königsberg bridge problem Pregel River (Solved negatively by Euler in 176) Representation in a graph Can all the seven edges
How can we lay cable at minimum cost to make every telephone reachable from every other? What is the fastest route between two given cities?
1 Introduction Graph theory is one of the most in-demand (i.e. profitable) and heavily-studied areas of applied mathematics and theoretical computer science. May graph theory questions are applied in this
Characteristics of Preferentially Attached Network Grown from. Small World
Characteristics of Preferentially Attached Network Grown from Small World Seungyoung Lee Graduate School of Innovation and Technology Management, Korea Advanced Institute of Science and Technology, Daejeon
Graphs and Genetics. Outline. Computational Biology IST. Ana Teresa Freitas 2015/2016. Slides source: AED (MEEC/IST); Jones and Pevzner (book)
raphs and enetics Computational Biology IST Ana Teresa Freitas / Slides source: AED (MEEC/IST); Jones and Pevzner (book) Outline l Motivacion l Introduction to raph Theory l Eulerian & Hamiltonian Cycle
We ve done. Introduction to the greedy method Activity selection problem How to prove that a greedy algorithm works Fractional Knapsack Huffman coding
We ve done Introduction to the greedy method Activity selection problem How to prove that a greedy algorithm works Fractional Knapsack Huffman coding Matroid Theory Now Matroids and weighted matroids Generic
Critical 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
Network Theory Introduction
The 13 th Taiwan Nuclear Physics Summer School 2009 June 29 ~ July 4 National Chiao-Tung University Network Theory Introduction HC Lee (Notes prepared with Dr. Rolf Sing-Guan Kong) Computational Biology
Algorithms and Applications in Social Networks. 2017/2018, Semester B Slava Novgorodov
Algorithms and Applications in Social Networks 2017/2018, Semester B Slava Novgorodov 1 Lesson #1 Administrative questions Course overview Introduction to Social Networks Basic definitions Network properties
Graphs and Puzzles. Eulerian and Hamiltonian Tours.
Graphs and Puzzles. Eulerian and Hamiltonian Tours. CSE21 Winter 2017, Day 11 (B00), Day 7 (A00) February 3, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Exam Announcements Seating Chart on Website Good
E6885 Network Science Lecture 5: Network Estimation and Modeling
E 6885 Topics in Signal Processing -- Network Science E6885 Network Science Lecture 5: Network Estimation and Modeling Ching-Yung Lin, Dept. of Electrical Engineering, Columbia University October 7th,
Constructing a G(N, p) Network
Random Graph Theory Dr. Natarajan Meghanathan Associate Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Introduction At first inspection,
Majority and Friendship Paradoxes
Majority and Friendship Paradoxes Majority Paradox Example: Small town is considering a bond initiative in an upcoming election. Some residents are in favor, some are against. Consider a poll asking the
Network Topology and Graph
Network Topology Network Topology and Graph EEE442 Computer Method in Power System Analysis Any lumped network obeys 3 basic laws KVL KCL linear algebraic constraints Ohm s law Anawach Sangswang Dept.
MATH 101: Introduction to Contemporary Mathematics
MATH 101: Introduction to Contemporary Mathematics Sections 201-206 Instructor: H. R. Hughes Course web page: http://www.math.siu.edu/hughes/math101.htm Summer 2013 Lecture sessions meet: MTWF 12:10-1:10
Walking with Euler through Ostpreußen and RNA
Walking with Euler through Ostpreußen and RNA Mark Muldoon February 4, 2010 Königsberg (1652) Kaliningrad (2007)? The Königsberg Bridge problem asks whether it is possible to walk around the old city in
Topology and Dynamics of Complex Networks
CS 790R Seminar Modeling & Simulation Topology and Dynamics of Complex Networks ~ Lecture 3: Review based on Strogatz (2001), Barabási & Bonabeau (2003), Wang, X. F. (2002) ~ René Doursat Department of
BioNSi - Biological Network Simulation Tool
Workshop: BioNSi - Biological Network Simulation Tool Amir Rubinstein CS @ TAU Tel-Aviv University, Faculty of Life Sciences 8 May 2016 Outline Part I Basic notions: - Modeling and simulation - Crash intro
TELCOM2125: 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
Graph Theory. Network Science: Graph theory. Graph theory Terminology and notation. Graph theory Graph visualization
Network Science: Graph Theory Ozalp abaoglu ipartimento di Informatica Scienza e Ingegneria Università di ologna www.cs.unibo.it/babaoglu/ ranch of mathematics for the study of structures called graphs
Overlay (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
EECS730: Introduction to Bioinformatics
EECS730: Introduction to Bioinformatics Lecture 15: Microarray clustering http://compbio.pbworks.com/f/wood2.gif Some slides were adapted from Dr. Shaojie Zhang (University of Central Florida) Microarray
ECS 253 / MAE 253, Lecture 8 April 21, Web search and decentralized search on small-world networks
ECS 253 / MAE 253, Lecture 8 April 21, 2016 Web search and decentralized search on small-world networks Search for information Assume some resource of interest is stored at the vertices of a network: Web
Varying Applications (examples)
Graph Theory Varying Applications (examples) Computer networks Distinguish between two chemical compounds with the same molecular formula but different structures Solve shortest path problems between cities