Class 2: Graph Theory IST402.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Chapter 9 Graphs.
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Graph-02.
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Graph theory at work.  Examine the procedure utilized by snow plows in Iowa City  Systemize and minimize routes  Review mathematical concepts involved.
Mining and Searching Massive Graphs (Networks)
Introduction to Graphs
Global topological properties of biological networks.
Graph, Search Algorithms Ka-Lok Ng Department of Bioinformatics Asia University.
CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.
Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.
Graph: Relations There are many kinds of social relations. For example: Role-based : brother of, father of, sister of, etc. : friend of, acquaintance of,
Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Graph Essentials Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Graph Essentials Networks A network is a graph. – Elements of the network.
Social Media Mining Graph Essentials.
Discrete Math Round, Round, Get Around… I Get Around Mathematics of Getting Around.
GRAPH Learning Outcomes Students should be able to:
Data Structures Using C++ 2E
Graph Theoretic Concepts. What is a graph? A set of vertices (or nodes) linked by edges Mathematically, we often write G = (V,E)  V: set of vertices,
Chapter 2 Graph Algorithms.
Class 2: Graph theory and basic terminology Learning the language Network Science: Graph Theory 2012 Prof. Albert-László Barabási Dr. Baruch Barzel, Dr.
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
1 CS104 : Discrete Structures Chapter V Graph Theory.
Mathematics of Networks (Cont)
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
Data Structures & Algorithms Graphs
L – Modelling and Simulating Social Systems with MATLAB Lesson 6 – Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano.
Complex Networks: Models Lecture 2 Slides by Panayiotis TsaparasPanayiotis Tsaparas.
1/24 Introduction to Graphs. 2/24 Graph Definition Graph : consists of vertices and edges. Each edge must start and end at a vertex. Graph G = (V, E)
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
CSS106 Introduction to Elementary Algorithms
The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?
Graphs Edge(arc) Vertices can be even or odd or undirected (two-way) Edges can be directed (one-way) This graph is connected. Degree(order) = 3 Odd vertex.
Week 1 – Introduction to Graph Theory I Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
Lecture 10: Graph-Path-Circuit
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Discrete Structures CISC 2315 FALL 2010 Graphs & Trees.
Graphs Upon completion you will be able to:
Class 2: Graph Theory IST402. The Bridges of Konigsberg Section 1.
Class 2: Graph Theory IST402. Can one walk across the seven bridges and never cross the same bridge twice? Network Science: Graph Theory THE BRIDGES OF.
Copyright © Curt Hill Graphs Definitions and Implementations.
Chapter 9: Graphs.
Introduction to Graph Theory By: Arun Kumar (Asst. Professor) (Asst. Professor)
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Department of Computer and IT Engineering University of Kurdistan Social Network Analysis Graph Theory By: Dr. Alireza Abdollahpouri.
Graphs Rosen, Chapter 8. NOT ONE OF THESE! One of these!
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.
1 Data Structures and Algorithms Graphs. 2 Graphs Basic Definitions Paths and Cycles Connectivity Other Properties Representation Examples of Graph Algorithms:
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 10.
Complex Networks Analysis Information Systems Engineering ‎ (2013 A) Instructor: Rami Puzis TA: Luiza
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Graph theory Definitions Trees, cycles, directed graphs.
Discrete Structures – CNS2300
Network analysis.
Community detection in graphs
Network Science: A Short Introduction i3 Workshop
Peer-to-Peer and Social Networks Fall 2017
Graph Operations And Representation
Graph Theory By Amy C. and John M..
Graphs G = (V, E) V are the vertices; E are the edges.
Graph Theory Relations, graphs
Presentation transcript:

Class 2: Graph Theory IST402

The Bridges of Konigsberg Section 1 The Bridges of Konigsberg

THE BRIDGES OF KONIGSBERG Can one walk across the seven bridges and never cross the same bridge twice? Network Science: Graph Theory http://www.numericana.com/answer/graphs.htm

THE BRIDGES OF KONIGSBERG Can one walk across the seven bridges and never cross the same bridge twice? 1735: Euler’s theorem: If a graph has more than two nodes of odd degree, there is no path. If a graph is connected and has no odd degree nodes, it has at least one path. Network Science: Graph Theory http://www.numericana.com/answer/graphs.htm

Section 2 Networks and graphs

COMPONENTS OF A COMPLEX SYSTEM components: nodes, vertices N interactions: links, edges L system: network, graph (N,L) Network Science: Graph Theory

network often refers to real systems NETWORKS OR GRAPHS? network often refers to real systems www, social network metabolic network. Language: (Network, node, link) graph: mathematical representation of a network web graph, social graph (a Facebook term) Language: (Graph, vertex, edge) We will try to make this distinction whenever it is appropriate, but in most cases we will use the two terms interchangeably. Network Science: Graph Theory

A COMMON LANGUAGE N=4 L=4 Network Science: Graph Theory

In some cases there is a unique, unambiguous representation. CHOOSING A PROPER REPRESENTATION The choice of the proper network representation determines our ability to use network theory successfully. In some cases there is a unique, unambiguous representation. In other cases, the representation is by no means unique.   For example, the way we assign the links between a group of individuals will determine the nature of the question we can study. Network Science: Graph Theory

If you connect individuals that work with each other, you will explore CHOOSING A PROPER REPRESENTATION If you connect individuals that work with each other, you will explore the professional network. Network Science: Graph Theory

CHOOSING A PROPER REPRESENTATION If you connect those that have a romantic and sexual relationship, you will be exploring the sexual networks. Network Science: Graph Theory

It is a network, nevertheless. CHOOSING A PROPER REPRESENTATION If you connect individuals based on their first name (all Peters connected to each other), you will be exploring what? It is a network, nevertheless. Network Science: Graph Theory

Q2: Degree, degree distribution. Question 2 Q2: Degree, degree distribution.

Degree, Average Degree and Degree Distribution Section 2.3 Degree, Average Degree and Degree Distribution

Undirected Directed NODE DEGREES A B Node degree: the number of links connected to the node. A Undirected B In directed networks we can define an in-degree and out-degree. The (total) degree is the sum of in- and out-degree. Source: a node with kin= 0; Sink: a node with kout= 0. A G F B C D E Directed

A BIT OF STATISTICS Network Science: Graph Theory

Undirected Directed AVERAGE DEGREE j i Undirected N – the number of nodes in the graph A F B C D E Directed Network Science: Graph Theory

Average Degree Network Science: Graph Theory

Degree distribution DEGREE DISTRIBUTION P(k): probability that a randomly chosen node has degree k Nk = # nodes with degree k P(k) = Nk / N ➔ plot

DEGREE DISTRIBUTION Log-log plot

DEGREE DISTRIBUTION Discrete Representation: pk is the probability that a node has degree k. Continuum Description: p(k) is the pdf of the degrees, where represents the probability that a node’s degree is between k1 and k2. Normalization condition: where Kmin is the minimal degree in the network.   Network Science: Graph Theory

Question 3 Q3: Directed vs. undirected networks.

Undirected Directed UNDIRECTED VS. DIRECTED NETWORKS Links: undirected (symmetrical) Graph: Links: directed (arcs). Digraph = directed graph: L A D M B An undirected link is the superposition of two opposite directed links. F C I D B G E G A H C F Undirected links : coauthorship links Actor network protein interactions Directed links : URLs on the www phone calls metabolic reactions Network Science: Graph Theory

Section 2.2 Reference Networks

Question 4 Q4: Adjacency Matrices

Section 2.4 Adjacency matrix

Aij=1 if there is a link between node i and j ADJACENCY MATRIX 4 2 3 1 Aij=1 if there is a link between node i and j Aij=0 if nodes i and j are not connected to each other. Note that for a directed graph (right) the matrix is not symmetric. if there is a link pointing from node j and i if there is no link pointing from j to i. Network Science: Graph Theory

ADJACENCY MATRIX AND NODE DEGREES 4 Undirected 3 2 1 Directed 4 3 2 1

ADJACENCY MATRIX b e g a c f h d a b c d e f g h a 0 1 0 0 1 0 1 0 b 1 0 1 0 0 0 0 1 c 0 1 0 1 0 1 1 0 d 0 0 1 0 1 0 0 0 e 1 0 0 1 0 0 0 0 f 0 0 1 0 0 0 1 0 g 1 0 1 0 0 0 0 0 h 0 1 0 0 0 0 0 0 Network Science: Graph Theory

ADJACENCY MATRICES ARE SPARSE Network Science: Graph Theory

More on Matrixology

Question 5 Q5: Sparsness

Real networks are sparse Section 4 Real networks are sparse

The maximum number of links a network of N nodes can have is: COMPLETE GRAPH The maximum number of links a network of N nodes can have is: A graph with degree L=Lmax is called a complete graph, and its average degree is <k>=N-1 Network Science: Graph Theory

Most networks observed in real systems are sparse: REAL NETWORKS ARE SPARSE Most networks observed in real systems are sparse: L << Lmax or <k> <<N-1. WWW (ND Sample): N=325,729; L=1.4 106 Lmax=1012 <k>=4.51 Protein (S. Cerevisiae): N= 1,870; L=4,470 Lmax=107 <k>=2.39 Coauthorship (Math): N= 70,975; L=2 105 Lmax=3 1010 <k>=3.9 Movie Actors: N=212,250; L=6 106 Lmax=1.8 1013 <k>=28.78 (Source: Albert, Barabasi, RMP2002) Network Science: Graph Theory

ADJACENCY MATRICES ARE SPARSE Network Science: Graph Theory

The maximum number of links a network of N nodes can have is: METCALFE’S LAW The maximum number of links a network of N nodes can have is: Network Science: Graph Theory

WEIGHTED AND UNWEIGHTED NETWORKS Section 2.6 WEIGHTED AND UNWEIGHTED NETWORKS

WEIGHTED AND UNWEIGHTED NETWORKS

The maximum number of links a network of N nodes can have is: METCALFE’S LAW The maximum number of links a network of N nodes can have is: Network Science: Graph Theory

Question 5 Q6: Bipartite Networks

Section 2.7 BIPARTITE NETWORKS

BIPARTITE GRAPHS bipartite graph (or bigraph) is a graph whose nodes can be divided into two disjoint sets U and V such that every link connects a node in U to one in V; that is, U and V are independent sets. Examples: Hollywood actor network Collaboration networks Disease network (diseasome) Network Science: Graph Theory

Goh, Cusick, Valle, Childs, Vidal & Barabási, PNAS (2007) GENE NETWORK – DISEASE NETWORK GENOME PHENOME DISEASOME Gene network Disease network Goh, Cusick, Valle, Childs, Vidal & Barabási, PNAS (2007) Network Science: Graph Theory

HUMAN DISEASE NETWORK

Ingredient-Flavor Bipartite Network Y.-Y. Ahn, S. E. Ahnert, J. P. Bagrow, A.-L. Barabási 
Flavor network and the principles of food pairing , Scientific Reports 196, (2011). Network Science: Graph Theory

Question 6 Q6: Paths

Section 2.8 PATHOLOGY

PATHS A path is a sequence of nodes in which each node is adjacent to the next one Pi0,in of length n between nodes i0 and in is an ordered collection of n+1 nodes and n links In a directed network, the path can follow only the direction of an arrow. Network Science: Graph Theory

DISTANCE IN A GRAPH Shortest Path, Geodesic Path The distance (shortest path, geodesic path) between two nodes is defined as the number of edges along the shortest path connecting them. *If the two nodes are disconnected, the distance is infinity. In directed graphs each path needs to follow the direction of the arrows. Thus in a digraph the distance from node A to B (on an AB path) is generally different from the distance from node B to A (on a BCA path). B A C D B A C D Network Science: Graph Theory

Nij,number of paths between any two nodes i and j: NUMBER OF PATHS BETWEEN TWO NODES Adjacency Matrix Nij,number of paths between any two nodes i and j:   Length n=1: If there is a link between i and j, then Aij=1 and Aij=0 otherwise. Length n=2: If there is a path of length two between i and j, then AikAkj=1, and AikAkj=0 otherwise. The number of paths of length 2: Length n: In general, if there is a path of length n between i and j, then Aik…Alj=1 and Aik…Alj=0 otherwise. The number of paths of length n between i and j is* *holds for both directed and undirected networks.   Network Science: Graph Theory