Presentation is loading. Please wait.

Presentation is loading. Please wait.

Social Network Analysis - Lecture 2 - *

Published byLesley Mosley Modified over 5 years ago

Similar presentations

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

1 Social Network Analysis - Lecture 2 - *
Dr. Stefan Siersdorfer * Figures in Slides from Easly and Kleinberg 2010

2 Closure Property: Example Graph

3 Tie Strength and Neiborhood Overlap (Phone Communication Network)

4 Different Types of Connections: Facebook

5 Graph Partitioning (1) : Co-author network

6 Graph Partitioning (2): Karate Club

7 Graph Partitionining (3): Flow and Betweeness

8 Girvan Newman Method

9 Betweennes values (1): BFS

10 Betweenness values (2): Counting Shortest Paths

11 Betweenness values (3) Flows

12 Homopholy: School Network

13 Affiliation Network: Board Membership

14 Segregation: Cities

15 Segregation: Schelling Model (1)

16 Segregation: Schelling Model (2)

17 Segregation: Schelling Model (3)

18 Segregation: Schelling Model (4)

19 Segregation: Schelling Model (4)

20 Schelling Model: Software

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

Similar presentations

Social Network Analysis (in 10 minutes) Nick Crossley.

Social Network Analysis (in 10 minutes) Nick Crossley.
Class 12: Communities Network Science: Communities Dr. Baruch Barzel.

Class 12: Communities Network Science: Communities Dr. Baruch Barzel.
Social network partition Presenter: Xiaofei Cao Partick Berg.

Social network partition Presenter: Xiaofei Cao Partick Berg.
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.

Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.
Peer-to-Peer and Social Networks Centrality measures.

Peer-to-Peer and Social Networks Centrality measures.
Relationship Mining Network Analysis Week 5 Video 5.

Relationship Mining Network Analysis Week 5 Video 5.
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.
Graph Theory ITEC 320 Lecture 21. Graph Theory Review Higher level usage of pointers –Factories –Flyweight –Disk pool Rationale Benefits / Downsides.

Graph Theory ITEC 320 Lecture 21. Graph Theory Review Higher level usage of pointers –Factories –Flyweight –Disk pool Rationale Benefits / Downsides.
Network Analysis Max Hinne Social Networks 6/1/20152Network Analysis.

Network Analysis Max Hinne Social Networks 6/1/20152Network Analysis.
Modularity in Biological networks.  Hypothesis: Biological function are carried by discrete functional modules.  Hartwell, L.-H., Hopfield, J. J., Leibler,

Modularity in Biological networks.  Hypothesis: Biological function are carried by discrete functional modules.  Hartwell, L.-H., Hopfield, J. J., Leibler,
Reading Group “Networks, Crowds and Markets” Session 1: Graph Theory and Social Networks Typ hier de naam van de FEB afzender.

Reading Group “Networks, Crowds and Markets” Session 1: Graph Theory and Social Networks Typ hier de naam van de FEB afzender.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.

The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.

Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.

Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.
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 (
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Online Social Networks and Media

Online Social Networks and Media
Mining Social Network for Personalized Email Prioritization Language Techonology Institute School of Computer Science Carnegie Mellon University Shinjae.

Mining Social Network for Personalized Prioritization Language Techonology Institute School of Computer Science Carnegie Mellon University Shinjae.
Lesson 2 How do electric circuits work?. Electric Circuits You know that electric circuits only work when the circuit is closed. OPEN.

Lesson 2 How do electric circuits work?. Electric Circuits You know that electric circuits only work when the circuit is closed. OPEN.
Online Social Networks and Media

Online Social Networks and Media

Similar presentations

Ads by Google