NETWORK ANALYSIS. Duygu Tosun-Turgut, Ph.D. Center for Imaging of Neurodegenerative Diseases Department of Radiology and Biomedical Imaging
|
|
- Paulina Skinner
- 5 years ago
- Views:
Transcription
1 NETWORK ANALYSIS Duygu Tosun-Turgut, Ph.D. Center for Imaging of Neurodegenerative Diseases Department of Radiology and Biomedical Imaging
2 What is a network? - Complex web-like structures
3 Internet is network of routers and computers linked by physical or wireless links
4 Social network Nodes are humans and edges are social relationships
5 Protein-protein interaction networks Network of chemicals connected by chemical reactions
6 Scientific collaboration network
7 Business ties in US biotech-industry
8 Genetic interaction network
9 Ecological networks
10 Graph theory - Study of complex networks - Initially focused on regular graphs - Connections are completely regular, e.g. each node is connected only to nearest neighbors - Since 1950s large-scale networks with no apparent design principles were described as random graphs
11 What makes a problem graph-like? - There are two components to a graph - Nodes and edges - In graph-like problems, these components have natural correspondences to problem elements - Entities are nodes and interactions between entities are edges - Most complex systems are graph-like
12 Graph Theory - History Leonhard Euler's paper on Seven Bridges of Königsberg, published in 1736.
13 Graph Theory - History Cycles in polyhedra Thomas P. Kirkman William R. Hamilton Hamiltonian cycles in Platonic graphs
14 Graph Theory - History Trees in electric circuits Gustav Kirchhoff
15 Graph Theory - History Enumeration of chemical isomers n.b. topological distance a.k.a chemical distance Arthur Cayley James J. Sylvester George Polya
16 Graph Theory - History Four color maps Francis Guthrie Auguste DeMorgan
17 Definition: Graph - G is an ordered triple G:=(V, E, f) - V is a set of nodes, points, or vertices. - E is a set, whose elements are known as edges or lines. - f is a function - maps each element of E - to an unordered pair of vertices in V. - N nodes; connect every pair of nodes with probability p - à Approximately K edges randomly K pn( N 1) 2
18 Definitions - Vertex - Basic element - Drawn as a node or a dot. - Vertex set of G is usually denoted by V(G), or V - Edge - A set of two elements - Drawn as a line connecting two vertices, called end vertices, or endpoints. - The edge set of G is usually denoted by E(G), or E.
19 Example V:={1,2,3,4,5,6} E:={{1,2},{1,5},{2,3},{2,5},{3,4},{4,5},{4,6}}
20 Simple graph is a graph without multiple edges or self-loops.
21 Directed graph (digraph) Edges have directions An edge is an ordered pair of nodes loop multiple edge edge node
22 Weighted graph is a graph for which each edge has an associated weight, usually given by a weight function w: E R
23 Structures and structural metrics - Graph structures are used to isolate interesting or important sections of a graph - Interesting because they form a significant domain-specific structure, or because they significantly contribute to graph properties - A subset of the nodes and edges in a graph that possess certain characteristics, or relate to each other in particular ways - Structural metrics provide a measurement of a structural property of a graph - Global metrics refer to a whole graph - Local metrics refer to a single node in a graph
24 Connectivity - A graph is connected if - you can get from any node to any other by following a sequence of edges OR - any two nodes are connected by a path. - A directed graph is strongly connected if there is a directed path from any node to any other node.
25 Component Every disconnected graph can be split up into a number of connected components.
26 Degree Number of edges incident on a node The degree of 5 is 3
27 Degree (directed graphs) In-degree: Number of edges entering Out-degree: Number of edges leaving Degree = in-degree + out-degree outdeg(1)=2 indeg(1)=0 outdeg(2)=2 indeg(2)=2 outdeg(3)=1 indeg(3)=4
28 Degree: Simple facts If G is a graph with m edges, then Σ deg(v) = 2m = 2 E If G is a digraph then Σ in-degree(v)=σ out-degree(v) = E Number of odd degree nodes is even
29 Walks - A walk of length k in a graph is a succession of k (not necessarily different) edges of the form uv,vw,wx,,yz - This walk is denote by uvwx xz, and is referred to as a walk between u and z. - A walk is closed is u=z. 1,2,5,2,3,4 1,2,5,2,3,2,1 walk of length 5 CW of length 6
30 Path is a walk in which all the edges and all the nodes are different. 1,2,3,4,6 path of length 4
31 Cycle is a closed walk in which all the edges are different. 1,2,5,1 2,3,4,5,2 3-cycle 4-cycle
32 Special types of graphs - Empty graph / Edgeless graph - No edge - Null graph - No nodes - Obviously no edge
33 Trees - Connected acyclic graph - Two nodes have exactly one path between them c.f. routing, later Path Star
34 Regular - Connected graph - All nodes have the same degree
35 Special regular graphs: Cycles C 3 C 4 C 5
36 Bipartite graph - V can be partitioned into 2 sets V 1 and V 2 such that (u,v) E implies - either u V 1 and v V 2 - OR v V 1 and u V 2. - Shows up in coding & modulation algorithms
37
38
39 Complete graph - Every pair of vertices are adjacent - Has n(n-1)/2 edges
40 Complete bipartite graph - Every node of one set is connected to every other node on the other set Stars
41 Planar graphs - Can be drawn on a plane such that no two edges intersect - K4 is the largest complete graph that is planar
42 Subgraph Vertex and edge sets are subsets of those of G a supergraph of a graph G is a graph that contains G as a subgraph.
43 Special subgraphs: Cliques A clique is a maximum complete connected subgraph. A B C D E F G H I
44 Spanning subgraph Subgraph H has the same vertex set as G. Possibly not all the edges H spans G.
45 Spanning tree Let G be a connected graph. Then a spanning tree in G is a subgraph of G that includes every node and is also a tree.
46 Isomorphism - Bijection, i.e., a one-to-one mapping: f : V(G) -> V(H) u and v from G are adjacent if and only if f(u) and f(v) are adjacent in H. - If an isomorphism can be constructed between two graphs, then we say those graphs are isomorphic.
47 Isomorphism Problem - Determining whether two graphs are isomorphic - Although these graphs look very different, they are isomorphic; one isomorphism between them is f(a)=1 f(b)=6 f(c)=8 f(d)=3 f(g)=5 f(h)=2 f(i)=4 f(j)=7
48 Matrix representation of graphs - Incidence Matrix - V x E - [vertex, edges] contains the edge's data - Adjacency Matrix - V x V - Boolean values (adjacent or not) - Or Edge Weights ,6 4,5 3,4 2,5 2,3 1,5 1,
49 List representation of graphs - Edge List - pairs (ordered if directed) of vertices - Optionally weight and other data - Adjacency List (node list)
50 Implementation of a Graph. Adjacency-list representation an array of V lists, one for each vertex in V. For each u V, ADJ [ u ] points to all its adjacent vertices.
51 Edge and Node Lists Edge List Node List
52 Edge lists for weighted graphs Edge List
53 Topological Distance - A shortest path is the minimum path connecting two nodes. - The number of edges in the shortest path connecting p and q is the topological distance between these two nodes, d p,q
54 Distance matrix V x V matrix D = ( d ij ) such that d ij is the topological distance between i and j
55
56 Random graphs & nature - Erdős and Renyi (1959) - N nodes - A pair of nodes has probability p of being connected. N = 12 p = 0.0 ; k = 0 - Average degree, k pn - What interesting things can be said for different values of p or k? (that are true as N à ) p = 0.09 ; k = 1 p = 1.0 ; k ½N 2
57 p = ; k = 0.5 p = 0.0 ; k = 0 p = 0.09 ; k = 1 p = 1.0 ; k ½N 2 - Size of the largest connected cluster - Diameter (maximum path length between nodes) of the largest cluster - Average path length between nodes (if a path exists)
58 Path length L i,j := minimal number of edges that must be traversed to form a direct connection between two nodes i and j L = 1 N 2 L rand i j ln N L i. j ln( K N 1), where K is number of edges
59 p = 0.0 ; k = 0 p = ; k = 0.5 p = 0.09 ; k = 1 p = 1.0 ; k ½N 2 Size of largest component Diameter of largest component Average path length between nodes
60 If k < 1: small, isolated clusters small diameters short path lengths At k = 1: a giant component appears diameter peaks path lengths are high For k > 1: almost all nodes connected diameter shrinks path lengths shorten Percentage of nodes in largest component Diameter of largest component (not to scale) k 1.0 phase transition
61 What does this mean? - If connections between people can be modeled as a random graph, then - Because the average person easily knows more than one person (k >> 1), - We live in a small world where within a few links, we are connected to anyone in the world. - Erdős and Renyi showed that average path length between connected nodes is ln N ln k Erdős and Renyi (1959) Fan Chung David Mumford Peter Belhumeur Kentaro Toyama
62 By definition, for a small world network λ L = 1 L rand
63 α-model Watts (1999) - The people you know aren t randomly chosen. - People tend to get to know those who are two links away (Rapoport, 1957). - The real world exhibits a lot of clustering.
64 Clustering There are cliques or clusters where every node is connected to every other node. Let node i have k i edges which connect it to k i other nodes. K i is number of edges existing between k i nodes. C i = 2K i k i (k i 1) C = i C i C=1 if nearest neighbors of i are also nearest neighbors of other. For a random graph, C rand =p. For a small world networks, γ = C 1 C rand
65 α-model - Add edges to nodes, as in random graphs, but makes links more likely when two nodes have a common friend. - Probability of linkage as a function of number of mutual friends (a is 0 in upper left, 1 in diagonal, and in bottom right curves.)
66 For a range of α values - The world is small (average path length is short) - Groups tend to form (high clustering coefficient). α Clustering coefficient (C) and average path length (L) plotted against a
67 β-model Watts and Strogatz (1998) β = 0 β = β = 1 People know their neighbors. Clustered, but not a small world People know their neighbors, and a few distant people. Clustered and small world People know others at random. Not clustered, but small world
68 Path length and clustering C(0) and L(0) are clustering coefficient and path length for regular graph. For small world, C(p)/C(0) < 1 L(p)/L(0) < 1 Watts and Strogatz, Nature, Vol 393:
69 Empirical Examples of Small World Networks L actual L random C actual C random Film actors Power grid C. elegans Watts and Strogatz, Nature, Vol 393:
70 β-model - First five random links reduce the average path length of the network by half, regardless of N! - Both α and β models reproduce short-path results of random graphs, but also allow for clustering. - Small-world phenomena occur at threshold between order and chaos. Clustering coefficient (C) and average path length (L) plotted against b
71 Power law Albert and Barabasi (1999) - What s the degree (number of edges) distribution over a graph, for real-world graphs? Degree distribution of a random graph, N = 10,000, p = (Curve is a Poisson curve, for comparison.) - Random-graph model results in Poisson distribution.
72 Degree distribution - k i - number of edges connected to a node i - degree of node i
73 Typical shape of a power-law distribution Mathematical relationship: If the frequency (with which an event occurs) varies as a power of some attribute of that event (e.g. its size), the frequency is said to follow a power law. P(k) = λ k e λ k!
74 Many real-world networks exhibit a power-law distribution! WWW hyperlinks Co-starring in movies Co-authorship of physicists Co-authorship of neuroscientists
75 The rich get richer! - Power-law distribution of node distribution arises if number of nodes grow - Edges are added in proportion to the number of edges a node already has - Additional variable fitness coefficient allows for some nodes to grow faster than others
76 Recap - Are real networks fundamentally random? - Intuitively, complex systems must display some organizing principles, which must be encoded in their topology - arrangement in which the nodes of the network are connected to each other
77 Why should we think about the brain as a small world network? - Brain is a complex network on multiple spatial and time scales - Connectivity of neurons - Brain supports segregated and distributed information processing - Somatosensory and visual systems segregated - Distributed processing, executive functions - Brain likely evolved to maximize efficiency and minimize the costs of information processing - Small world topology is associated with high global and local efficiency of parallel information processing, sparse connectivity between nodes, and low wiring costs - Adaptive reconfiguration
78 Three concepts in complex networks Small worlds Clustering Degree distribution
79
80
81
82 How to use network analysis / graph theory to study brain? - Test for small world behavior - Model development or evolution of brain networks - Link network topology to network dynamics (structure to function) - Explore network robustness (vulnerability to damaged nodes, model for neurodegeneration) - Determine if network parameters can help diagnose or distinguish patients from controls - Relate network parameters to cognition
83 Network efficiency and IQ van den Heuvel M P et al. J. Neurosci. 2009;29: The existence of a strong association between the level of global communication efficiency of the functional brain network and intellectual performance - 19 healthy subject - IQ measured with WAIS-III - Resting state fmri - Association was correlation between time-series from each voxel pair (9500 voxels/nodes) - Network constructed for each subject - Network measures were correlated with IQ scores - γ, λ and total connections k - Also correlated normalized path length at each node with IQ
84 Functional network: Small world properties observed for a range of thresholds van den Heuvel M P et al. J. Neurosci. 2009;29:
85 Network parameters vs IQ van den Heuvel M P et al. J. Neurosci. 2009;29:
86 Path length at nodes vs IQ van den Heuvel M P et al. J. Neurosci. 2009;29:
87 Study conclusions - Efficiency of intrinsic resting-state functional connectivity patterns is predictive of cognitive performance - Short path length is crucial for efficient information processing in functional brain networks
88 Cortical Thickness Networks in Temporal Lobe Epilepsy Bernhardt B C et al. Cereb. Cortex 2011;21: patients with drug-resistant TLE; 63 LTLE, 59 RTLE - 47 age- and sex-matched healthy controls - T1-weighted imaging at 1.5T - Estimated cortical thickness in 52 ROIs - Thicknesses corrected for age, gender, overall mean thickness - Computed r ij Pearson product moment cross-correlation across subjects in regions i and j - Explored network parameters at a range of connection densities - Different networks for controls, LTLE, RTLE - Ensures that networks in all groups have the same number of edges or wiring cost - Between group differences reflect topological organization differences; not differences in correlations
89 Cortical thickness correlation networks Bernhardt B C et al. Cereb. Cortex 2011;21:
90 Network parameter analysis of the crosssectional cohort. Bernhardt B C et al. Cereb. Cortex 2011;21:
91 Network robustness analysis. Bernhardt B C et al. Cereb. Cortex 2011;21:
92 Clinical correlation: Relationship between network alterations and seizure outcome after surgery Bernhardt B C et al. Cereb. Cortex 2011;21:
93 A practical framework
94
95
96
97
98
99
100 References - Duncan Watts, Six Degrees (2003). - Albert and Barabasi, Statistical mechanics of complex networks. Review of Modern Physics. 74: (2002) - Kolaczyk, Statistical Analysis of Network Data: Methods and Models, Springer Guye et al., Imaging of structural and functional connectivity: towards a unified definiton of human brain organization? Current Opinion in Neurology 2008, 21: Bassett et al., Hierarchical organization of human cortical networks in health and schizophrenia schizophrenia. The Journal of Neuroscience, 2009, 28(37): Van den Heuvel et al., Efficiency of functional brain networks and intellectual performance. The Journal of Neuroscience, 2009, 29(23): Bassett and Bullmore, Small-World Brain Networks. The Neuroscientist, 2006, 12(6): Bullmore and Sporns, Complex brain networks: graph theorectical analysis of structural and functional systems. Nature Reviews: Neuroscience, 2009, 10: Telesford et al., Reproducilbility of graph metrics in fmri networks. Frontiers in Neuroscience, 2010, 4:article 117.
101 Network / graph analysis software - Brain connectivity toolbox - Matlab BGL -
What is a network? Network Analysis
What is a network? Network Analysis Valerie Cardenas Nicolson Associate Adjunct Professor Department of Radiology and Biomedical Imaging Complex weblike structures Cell is network of chemicals connected
More informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
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 informationMath 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
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 informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
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 informationCS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1. Define Graph. A graph G = (V, E) consists
More informationGraph and Digraph Glossary
1 of 15 31.1.2004 14:45 Graph and Digraph Glossary A B C D E F G H I-J K L M N O P-Q R S T U V W-Z Acyclic Graph A graph is acyclic if it contains no cycles. Adjacency Matrix A 0-1 square matrix whose
More informationCSCI5070 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
More informationIntroduction 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
More informationCharacterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)
S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More information1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G))
10 Graphs 10.1 Graphs and Graph Models 1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G)) 2. an edge is present, say e = {u,
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 informationGraph Theory. ICT Theory Excerpt from various sources by Robert Pergl
Graph Theory ICT Theory Excerpt from various sources by Robert Pergl What can graphs model? Cost of wiring electronic components together. Shortest route between two cities. Finding the shortest distance
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 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 informationAlgorithms: Graphs. Amotz Bar-Noy. Spring 2012 CUNY. Amotz Bar-Noy (CUNY) Graphs Spring / 95
Algorithms: Graphs Amotz Bar-Noy CUNY Spring 2012 Amotz Bar-Noy (CUNY) Graphs Spring 2012 1 / 95 Graphs Definition: A graph is a collection of edges and vertices. Each edge connects two vertices. Amotz
More informationConstructing 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
More informationGRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS
GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS DR. ANDREW SCHWARTZ, PH.D. 10.1 Graphs and Graph Models (1) A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes)
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 informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationAlgorithms. Graphs. Algorithms
Algorithms Graphs Algorithms Graphs Definition: A graph is a collection of edges and vertices. Each edge connects two vertices. Algorithms 1 Graphs Vertices: Nodes, points, computers, users, items,...
More informationNetworks 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
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationGraph Theory. Part of Texas Counties.
Graph Theory Part of Texas Counties. We would like to visit each of the above counties, crossing each county only once, starting from Harris county. Is this possible? This problem can be modeled as a graph.
More informationNetwork Thinking. Complexity: A Guided Tour, Chapters 15-16
Network Thinking Complexity: A Guided Tour, Chapters 15-16 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-pj45avc/
More informationConstructing 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,
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 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 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 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 informationCS 311 Discrete Math for Computer Science Dr. William C. Bulko. Graphs
CS 311 Discrete Math for Computer Science Dr. William C. Bulko Graphs 2014 Definitions Definition: A graph G = (V,E) consists of a nonempty set V of vertices (or nodes) and a set E of edges. Each edge
More informationCS 4407 Algorithms Lecture 5: Graphs an Introduction
CS 4407 Algorithms Lecture 5: Graphs an Introduction Prof. Gregory Provan Department of Computer Science University College Cork 1 Outline Motivation Importance of graphs for algorithm design applications
More informationGraph 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
More informationWUCT121. Discrete Mathematics. Graphs
WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,
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 Introduction to Graph Theory
An Introduction to Graph Theory CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 17 th February 2012 Outline 1 Graphs 2 Paths and cycles 3 Graphs and
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 informationDiscrete mathematics II. - Graphs
Emil Vatai April 25, 2018 Basic definitions Definition of an undirected graph Definition (Undirected graph) An undirected graph or (just) a graph is a triplet G = (ϕ, E, V ), where V is the set of vertices,
More informationModels of Network Formation. Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Models of Network Formation Networked Life NETS 112 Fall 2017 Prof. Michael Kearns Roadmap Recently: typical large-scale social and other networks exhibit: giant component with small diameter sparsity
More informationLecture 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),
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 informationDiscrete Mathematics
Discrete Mathematics Lecturer: Mgr. Tereza Kovářová, Ph.D. tereza.kovarova@vsb.cz Guarantor: doc. Mgr. Petr Kovář, Ph.D. Department of Applied Mathematics, VŠB Technical University of Ostrava About this
More informationGraph Theory and Network Measurment
Graph Theory and Network Measurment Social and Economic Networks MohammadAmin Fazli Social and Economic Networks 1 ToC Network Representation Basic Graph Theory Definitions (SE) Network Statistics and
More informationVarying 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
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 informationSocial Network Analysis
Social Network Analysis Mathematics of Networks Manar Mohaisen Department of EEC Engineering Adjacency matrix Network types Edge list Adjacency list Graph representation 2 Adjacency matrix Adjacency matrix
More informationGraphs. The ultimate data structure. graphs 1
Graphs The ultimate data structure graphs 1 Definition of graph Non-linear data structure consisting of nodes & links between them (like trees in this sense) Unlike trees, graph nodes may be completely
More informationGraph Theory Review. January 30, Network Science Analytics Graph Theory Review 1
Graph Theory Review Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ January 30, 2018 Network
More informationDS UNIT 4. Matoshri College of Engineering and Research Center Nasik Department of Computer Engineering Discrete Structutre UNIT - IV
Sr.No. Question Option A Option B Option C Option D 1 2 3 4 5 6 Class : S.E.Comp Which one of the following is the example of non linear data structure Let A be an adjacency matrix of a graph G. The ij
More informationMachine 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
More informationComplex-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
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 informationGraphs 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
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationGraph Model Selection using Maximum Likelihood
Graph Model Selection using Maximum Likelihood Ivona Bezáková Adam Tauman Kalai Rahul Santhanam Theory Canal, Rochester, April 7 th 2008 [ICML 2006 (International Conference on Machine Learning)] Overview
More informationElements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
More informationHow 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,
More information1 Random Graph Models for Networks
Lecture Notes: Social Networks: Models, Algorithms, and Applications Lecture : Jan 6, 0 Scribes: Geoffrey Fairchild and Jason Fries Random Graph Models for Networks. Graph Modeling A random graph is a
More informationMATH 363 Final Wednesday, April 28. Final exam. You may use lemmas and theorems that were proven in class and on assignments unless stated otherwise.
Final exam This is a closed book exam. No calculators are allowed. Unless stated otherwise, justify all your steps. You may use lemmas and theorems that were proven in class and on assignments unless stated
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 informationγ(ɛ) (a, b) (a, d) (d, a) (a, b) (c, d) (d, d) (e, e) (e, a) (e, e) (a) Draw a picture of G.
MAD 3105 Spring 2006 Solutions for Review for Test 2 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ
More informationRANDOM-REAL NETWORKS
RANDOM-REAL NETWORKS 1 Random networks: model A random graph is a graph of N nodes where each pair of nodes is connected by probability p: G(N,p) Random networks: model p=1/6 N=12 L=8 L=10 L=7 The number
More informationCombinatorics Summary Sheet for Exam 1 Material 2019
Combinatorics Summary Sheet for Exam 1 Material 2019 1 Graphs Graph An ordered three-tuple (V, E, F ) where V is a set representing the vertices, E is a set representing the edges, and F is a function
More informationSummary: 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 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 informationCourse Introduction / Review of Fundamentals of Graph Theory
Course Introduction / Review of Fundamentals of Graph Theory Hiroki Sayama sayama@binghamton.edu Rise of Network Science (From Barabasi 2010) 2 Network models Many discrete parts involved Classic mean-field
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI Department of Computer Science and Engineering CS6702 - GRAPH THEORY AND APPLICATIONS Anna University 2 & 16 Mark Questions & Answers Year / Semester: IV /
More informationSome 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
More informationGraphs (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
More informationCMSC 380. Graph Terminology and Representation
CMSC 380 Graph Terminology and Representation GRAPH BASICS 2 Basic Graph Definitions n A graph G = (V,E) consists of a finite set of vertices, V, and a finite set of edges, E. n Each edge is a pair (v,w)
More informationGraph Theory. Connectivity, Coloring, Matching. Arjun Suresh 1. 1 GATE Overflow
Graph Theory Connectivity, Coloring, Matching Arjun Suresh 1 1 GATE Overflow GO Classroom, August 2018 Thanks to Subarna/Sukanya Das for wonderful figures Arjun, Suresh (GO) Graph Theory GATE 2019 1 /
More informationErdős-Rényi Model for network formation
Network Science: Erdős-Rényi Model for network formation Ozalp Babaoglu Dipartimento di Informatica Scienza e Ingegneria Università di Bologna www.cs.unibo.it/babaoglu/ Why model? Simpler representation
More informationEffect of age and dementia on topology of brain functional networks. Paul McCarthy, Luba Benuskova, Liz Franz University of Otago, New Zealand
Effect of age and dementia on topology of brain functional networks Paul McCarthy, Luba Benuskova, Liz Franz University of Otago, New Zealand 1 Structural changes in aging brain Age-related changes in
More informationChapter 1. Social Media and Social Computing. October 2012 Youn-Hee Han
Chapter 1. Social Media and Social Computing October 2012 Youn-Hee Han http://link.koreatech.ac.kr 1.1 Social Media A rapid development and change of the Web and the Internet Participatory web application
More informationGraph (1A) Young Won Lim 4/19/18
Graph (1A) Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationTWO CONTRIBUTIONS OF EULER
TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention
More informationStructural Analysis of Paper Citation and Co-Authorship Networks using Network Analysis Techniques
Structural Analysis of Paper Citation and Co-Authorship Networks using Network Analysis Techniques Kouhei Sugiyama, Hiroyuki Ohsaki and Makoto Imase Graduate School of Information Science and Technology,
More informationModeling 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
More informationChapter 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,
More informationBrief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions
Brief History Graph Theory What is a graph? It all began in 1736 when Leonhard Euler gave a proof that not all seven bridges over the Pregolya River could all be walked over once and end up where you started.
More informationOutline. Introduction. Representations of Graphs Graph Traversals. Applications. Definitions and Basic Terminologies
Graph Chapter 9 Outline Introduction Definitions and Basic Terminologies Representations of Graphs Graph Traversals Breadth first traversal Depth first traversal Applications Single source shortest path
More informationIS 709/809: Computational Methods in IS Research. Graph Algorithms: Introduction
IS 709/809: Computational Methods in IS Research Graph Algorithms: Introduction Nirmalya Roy Department of Information Systems University of Maryland Baltimore County www.umbc.edu Motivation Several real-life
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 informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationECS 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
More informationGraph Theory: Introduction
Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in Resources Copies of slides available at: http://www.facweb.iitkgp.ernet.in/~pallab
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 informationMATH 350 GRAPH THEORY & COMBINATORICS. Contents
MATH 350 GRAPH THEORY & COMBINATORICS PROF. SERGEY NORIN, FALL 2013 Contents 1. Basic definitions 1 2. Connectivity 2 3. Trees 3 4. Spanning Trees 3 5. Shortest paths 4 6. Eulerian & Hamiltonian cycles
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 informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics An Introduction to Graph Theory. Introduction. Definitions.. Vertices and Edges... The Handshaking Lemma.. Connected Graphs... Cut-Points and Bridges.
More informationAn introduction to the physics of complex networks
An introduction to the physics of complex networks Alain Barrat CPT, Marseille, France ISI, Turin, Italy http://www.cpt.univ-mrs.fr/~barrat http://www.cxnets.org http://www.sociopatterns.org REVIEWS: Statistical
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 informationGraph 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
More informationChapter 11: Graphs and Trees. March 23, 2008
Chapter 11: Graphs and Trees March 23, 2008 Outline 1 11.1 Graphs: An Introduction 2 11.2 Paths and Circuits 3 11.3 Matrix Representations of Graphs 4 11.5 Trees Graphs: Basic Definitions Informally, a
More informationAlessandro Del Ponte, Weijia Ran PAD 637 Week 3 Summary January 31, Wasserman and Faust, Chapter 3: Notation for Social Network Data
Wasserman and Faust, Chapter 3: Notation for Social Network Data Three different network notational schemes Graph theoretic: the most useful for centrality and prestige methods, cohesive subgroup ideas,
More informationChapter 9. Graph Theory
Chapter 9. Graph Theory Prof. Tesler Math 8A Fall 207 Prof. Tesler Ch. 9. Graph Theory Math 8A / Fall 207 / 50 Graphs PC Computer network PC2 Modem ISP Remote server PC Emily Dan Friends Irene Gina Harry
More informationCMSC Honors Discrete Mathematics
CMSC 27130 Honors Discrete Mathematics Lectures by Alexander Razborov Notes by Justin Lubin The University of Chicago, Autumn 2017 1 Contents I Number Theory 4 1 The Euclidean Algorithm 4 2 Mathematical
More information