Presentation is loading. Please wait.

Presentation is loading. Please wait.

Social Network Analysis - Lecture 3 - *

Published byEric Webb Modified over 6 years ago

Similar presentations

Presentation on theme: "Social Network Analysis - Lecture 3 - *"— Presentation transcript:

1 Social Network Analysis - Lecture 3 - *
Dr. Stefan Siersdorfer * Figures and Examples in Slides are from Easley and Kleinberg 2010

2 Recap: Betweennes values (1): BFS

3 Recap: Betweenness values (2): Counting Shortest Paths

4 Recap: Betweenness values (3) Flows

5 International Relations (1)

6 International Relations (2)

7 Proof: Balance Theorem for incomplete graphs (1)

8 Proof: Balance Theorem for incomplete graphs (2)

9 Proof: Balance Theorem for incomplete graphs (3)

10 Proof: Balance Theorem for incomplete graphs (4)

11 Proof: Balance Theorem for incomplete gaphs (5)

Download ppt "Social Network Analysis - Lecture 3 - *"

Similar presentations

Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,

Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Max Flow Problem Given network N=(V,A), two nodes s,t of V, and capacities on the arcs: uij is the capacity on arc (i,j). Find non-negative flow fij for.

Max Flow Problem Given network N=(V,A), two nodes s,t of V, and capacities on the arcs: uij is the capacity on arc (i,j). Find non-negative flow fij for.
EMIS 8374 Vertex Connectivity Updated 20 March 2008.

EMIS 8374 Vertex Connectivity Updated 20 March 2008.
Graph Partitioning Dr. Frank McCown Intro to Web Science Harding University This work is licensed under Creative Commons Attribution-NonCommercial 3.0Attribution-NonCommercial.

Graph Partitioning Dr. Frank McCown Intro to Web Science Harding University This work is licensed under Creative Commons Attribution-NonCommercial 3.0Attribution-NonCommercial.
A b c d e f g h j i k Graph G is shown. Which of the following is a trail but not a path? 1). acdefhg 2). hfdcbdfe 3). ghfdcbde 4). acdegik 5). None of.

A b c d e f g h j i k Graph G is shown. Which of the following is a trail but not a path? 1). acdefhg 2). hfdcbdfe 3). ghfdcbde 4). acdegik 5). None of.
CSE 421 Algorithms Richard Anderson Lecture 22 Network Flow.

CSE 421 Algorithms Richard Anderson Lecture 22 Network Flow.
Can Dijkstra’s Algorithm be modified in an obvious way to give the longest path in a graph? a). Yes b). No c). I have absolutely no idea.

Can Dijkstra’s Algorithm be modified in an obvious way to give the longest path in a graph? a). Yes b). No c). I have absolutely no idea.
INFM 718A / LBSC 705 Information For Decision Making Lecture 6.

INFM 718A / LBSC 705 Information For Decision Making Lecture 6.
Economics 214 Lecture 29 Multivariate Calculus. Homogeneous Function.

Economics 214 Lecture 29 Multivariate Calculus. Homogeneous Function.
2006 Fall MATH 100 Lecture 141 MATH 100Class 21 Line Integral independent of path.

2006 Fall MATH 100 Lecture 141 MATH 100Class 21 Line Integral independent of path.
P247. Figure 9-1 p248 Figure 9-2 p251 p251 Figure 9-3 p253.

P247. Figure 9-1 p248 Figure 9-2 p251 p251 Figure 9-3 p253.
CSE 421 Algorithms Richard Anderson Lecture 22 Network Flow.

CSE 421 Algorithms Richard Anderson Lecture 22 Network Flow.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.

Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Web Science Course 2014 - Lecture: Social Networks - * Dr. Stefan Siersdorfer 1 * Figures from Easley and Kleinberg 2010 (http://www.cs.cornell.edu/home/kleinber/networks-book/)

Web Science Course Lecture: Social Networks - * Dr. Stefan Siersdorfer 1 * Figures from Easley and Kleinberg 2010 (
Lecture 7 All-Pairs Shortest Paths. All-Pairs Shortest Paths.

Lecture 7 All-Pairs Shortest Paths. All-Pairs Shortest Paths.
All-Pairs Shortest Paths HONG-MING CHU 2013/10/31.

All-Pairs Shortest Paths HONG-MING CHU 2013/10/31.
Social Network Analysis - Lecture 1 - Dr. Stefan Siersdorfer 1.

Social Network Analysis - Lecture 1 - Dr. Stefan Siersdorfer 1.
Social Network Analysis - Lecture 11 - * Dr. Stefan Siersdorfer 1 * Figures and Examples in Slides from Easley and Kleinberg 2010.

Social Network Analysis - Lecture 11 - * Dr. Stefan Siersdorfer 1 * Figures and Examples in Slides from Easley and Kleinberg 2010.
1 3.2 The Mean Value Theorem. 2 Rolle’s Theorem 3 Figure 1 shows the graphs of four such functions. Figure 1 (c) (b) (d) (a) Examples:

1 3.2 The Mean Value Theorem. 2 Rolle’s Theorem 3 Figure 1 shows the graphs of four such functions. Figure 1 (c) (b) (d) (a) Examples:
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 25.

CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 25.

Similar presentations

Ads by Google