On Social networks with an overview of graph drawing with demo of a system Pajek
author:
Vladimir Batagelj,
IMFM
Description
Network = Graph + Data. The data can be measured or computed/derived from the network. The graph drawing is already well established field with its own conference http://www.gd2005.org/ (started in 1992). In ’traditional’ graph drawing the goal is to produce ’the best’ layout of given graph. SNA (Social Network Analysis) is a part of data analysis. Its goal is to get insight into the structure and characteristics of given network.
You might be experiencing some problems with Your Video player.
| Slides | |
| 0:00 | Visualization of large networks and Pajek |
| 0:42 | Outline |
| 0:43 | Networks in social sciences |
| 1:21 | Moreno: Who shall survive? |
| 5:43 | Networks |
| 7:11 | Networks / Formally |
| 7:33 | Types of networks |
| 9:21 | Deep South |
| 10:11 | Temporal networks |
| 10:58 | Multi-relational temporal network |
| 13:05 | Size of Networks |
| 15:41 | Large Networks |
| 18:03 | Pajek |
| 20:33 | Main design goals |
| 24:36 | Line-cut: Krebs Internet Industries, |
| 26:21 | Representations of properties |
| 28:51 | Analysis and Visualization |
| 29:22 | Some comments |
| 34:38 | Sociograph |
| 35:19 | James Moody: Display of properties – school |
| 38:25 | Douglas White: relinking marriages among the Aydinli |
| 38:45 | Lothar Krempel |
| 39:07 | FAS: The scientific field of Austria |
| 40:33 | FAS: Austria’s most important Companies |
| 40:40 | Katy B¨orner: Text analysis |
| 41:07 | Ulrik Brandes: Discourse network |
| 41:28 | Jeffrey Johnson: St Marks food web |
| 41:40 | Large networks |
| 42:11 | Big picture, V. Batagelj |
| 43:13 | Big picture |
| 46:11 | Michael Blum |
| 46:33 | Internet Movie Database |
| 47:22 | Bipartite cores |
| 49:18 | (247,2)-core and (27,22)-core |
| 50:50 | (2,516)-Hard core |
| 51:05 | 4-rings and analysis of 2-mode networks |
| 52:59 | Directed 4-rings |
| 53:03 | Simple line islands in IMDB |
| 53:35 | Example |
| 54:39 | Example2 |
| 55:09 | New drawing algorithms |
| 56:06 | New drawing algorithms2 |
| 58:10 | Dense networks |
| 58:46 | Snyder & Kick’s World trade network |
| 60:50 | Contracted clusters – international trade |
| 61:22 | Generalized Blockmodeling |
| 61:46 | New graphical elements |
| 62:01 | Core based layout |
| 62:04 | Dynamic/temporal networks |
| 64:09 | Temporal networks / September 11 |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Visitors who watched this lecture also watched...
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !






Video took long time to download and voice quality is also not good.