1 / 19

Principles of Network Analysis An Introduction

Principles of Network Analysis An Introduction. Adapted from slides by: Thomas G. Padilla Digital Humanities Librarian @thomasgpadilla Brandon Locke Director, LEADR Lab @brandontlocke. net·work a group or system of interconnected people or things. a·nal·y·sis

cmatlock
Download Presentation

Principles of Network Analysis An Introduction

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Principles of Network Analysis An Introduction Adapted from slides by: Thomas G. Padilla Digital Humanities Librarian @thomasgpadilla Brandon Locke Director, LEADR Lab @brandontlocke

  2. net·work a group or system of interconnected people or things a·nal·y·sis detailed examination of the elements or structure of something, typically as a basis for discussion or interpretation

  3. net·work a·nal·y·sis Study of the structure of relationships between things and across things. Things include but are not limited to people, neural cells, power grids, and transportation hubs.

  4. questions What does the network look like? How connected is the network? Which are the key entities? Which are key subgroups? How does network structure affect function?

  5. immersion.media.mit.edu

  6. Graphs

  7. nodes |edges undirected

  8. directed weighted 3 1 9 4 6

  9. path a sequence of nodes, where each node in the sequence is connected by an edge

  10. pivotal node node is pivotal if it lies on shortest path between two pairs of nodes E A F B C D

  11. component a subset of connected nodes

  12. clustering coefficient the probability that two randomly selected friends of a node are friends with eachother

  13. degree centrality measure of how connected a node is degree– no. connections in-degree– inbound connections out-degree – outbound connections

  14. basic process Specify question Find or create relational data Specify nodes & edges Explore & Analyze relational data Interpret results Repeat

  15. Try it! bit.ly/dh1016b Start by downloading the first dataset.

  16. (I lied, we’re detouring.) http://raw.densitydesign.org/

  17. (OK, now back to network analysis!) bit.ly/dh1016b This time download the node list and the edge list for dataset two and REMEMBER WHERE YOU PUT THEM.

  18. Anatomy of an edge list

  19. Anatomy of a node list

More Related