Social Network Analysis and the Mass Media By Paul Rossman Indiana University of Pennsylvania.

Slides:



Advertisements
Similar presentations
Complex Networks Luis Miguel Varela COST meeting, Lisbon March 27 th 2013.
Advertisements

Review Binary Search Trees Operations on Binary Search Tree
Vertex Cover Dominating Set These slides are based on the Lecture Notes by David Mount for the course CMSC 451 at the University of Maryland. The Copyright.
Social Network Analysis and Its Applications By Paul Rossman Indiana University of Pennsylvania.
Graph A graph, G = (V, E), is a data structure where: V is a set of vertices (aka nodes) E is a set of edges We use graphs to represent relationships among.
Relationship Mining Network Analysis Week 5 Video 5.
Introduction This chapter explores graphs and their applications in computer science This chapter explores graphs and their applications in computer science.
Social Network Analysis Social Computing Foothill College.
Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Introduction to Graph  A graph consists of a set of vertices, and a set of edges that link together the vertices.  A graph can be: Directed: Edges are.
Chapter 9 Graph algorithms Lec 21 Dec 1, Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
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,
Balanced Binary Search Trees height is O(log n), where n is the number of elements in the tree AVL (Adelson-Velsky and Landis) trees red-black trees get,
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.
Social Network Analysis
Graph. Data Structures Linear data structures: –Array, linked list, stack, queue Non linear data structures: –Tree, binary tree, graph and digraph.
Intro to Graphs CSIT 402 Data Structures II. CSIT 402 Graph Introduction2 Graphs Graphs are composed of ›Nodes (vertices) Can be labeled ›Edges (arcs)
Computer Science 112 Fundamentals of Programming II Introduction to Graphs.
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,
Social Network Analysis: A Non- Technical Introduction José Luis Molina Universitat Autònoma de Barcelona
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
Introduction to Graphs. Introduction Graphs are a generalization of trees –Nodes or verticies –Edges or arcs Two kinds of graphs –Directed –Undirected.
 What is a graph? What is a graph?  Directed vs. undirected graphs Directed vs. undirected graphs  Trees vs graphs Trees vs graphs  Terminology: Degree.
Lecture 17 Trees CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Network Analysis of the local Public Health Sector: Translating evidence into practice Helen McAneney School of Medicine, Dentistry and Biomedical Sciences,
1 CS104 : Discrete Structures Chapter V Graph Theory.
Data Structures & Algorithms Graphs
L – Modelling and Simulating Social Systems with MATLAB Lesson 6 – Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano.
Computer Science: A Structured Programming Approach Using C Graphs A graph is a collection of nodes, called vertices, and a collection of segments,
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
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?
Introduction to Graph Theory
+ Big Data, Network Analysis Week How is date being used Predict Presidential Election - Nate Silver –
Data Structures & Algorithms Graphs Richard Newman based on book by R. Sedgewick and slides by S. Sahni.
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.
Graphs 황승원 Fall 2010 CSE, POSTECH. 2 2 Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects.
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
Graphs Basic properties.
Copyright © Curt Hill Graphs Definitions and Implementations.
Advanced Mathematics in Mass Journalism By Paul Rossman March 18, 2008.
MAT 2720 Discrete Mathematics Section 8.1 Introduction
Minimum Spanning Tree 8/7/2018 4:26 AM
Graphs and Graph Models
SOCIAL NETWORKS Amit Sharma INF -38FQ School of Information
Balanced Binary Search Trees
Network Science: A Short Introduction i3 Workshop
Why Social Graphs Are Different Communities Finding Triangles
Graphs All tree structures are hierarchical. This means that each node can only have one parent node. Trees can be used to store data which has a definite.
Graph Operations And Representation
Connectivity Section 10.4.
Graph Theory By Amy C. and John M..
Graphs.
CS 594: Empirical Methods in HCC Social Network Analysis in HCI
CC 215 Data Structures Graph Terminology
CSE 373 Data Structures Lecture 17
Graphs By Rajanikanth B.
Graphs Chapter 7 Visit for more Learning Resources.
Graphs.
Graphs G = (V, E) V are the vertices; E are the edges.
GRAPHS G=<V,E> Adjacent vertices Undirected graph
Graph Terminology CSE 373 Data Structures.
Trees-2, Graphs Data Structures with C Chpater-6 Course code: 10CS35
Graphs: Definitions How would you represent the following?
CSE 373 Data Structures Lecture 13
Graphs G = (V,E) V is the vertex set.
Chapter 9 Graph algorithms
GRAPHS.
Concepts of Computation
Presentation transcript:

Social Network Analysis and the Mass Media By Paul Rossman Indiana University of Pennsylvania

What is Social Network Analysis? The mapping and measuring of relationships and flows between people, groups, organizations, computers, web sites, and other information/knowledge processing entities.

Who uses it? The following fields: –social psychology –Sociology –Ethology –and anthropology. SNA derives many of its concepts from mathematics, namely graph theory.

Basics of graph theory A graph G(V,E) consists of … –Set of nodes | vertices V representing actors –Set of lines | edges E representing ties An edge is an unordered pair of nodes {u,v} Nodes u and v adjacent if {u,v} is an element of E –So E is subset of set of all pairs of nodes

Directed Graphs (digraphs) Digraph D(V,E) consists of … –Set of nodes V –Set directed arcs E An arc is an ordered pair of nodes {u,v} {u,v} is an element of E indicates u sends arc to v {u,v} is an element of E does not imply that {v,u} is an element of E

Graphs in SNA Directed graphs –Gave money to Undirected graphs – –Attending meetings with – –Friends with – –Related to

Valued Graphs (vigraphs) Graphs can also be valued or non-valued. A valued graph has numbers attached to the lines that indicate the strength or frequency or intensity or quantity of the tie between nodes.

Other Key Terms Adjacency Matrix: A binary n  n matrix A in which aij = 1 and aji = 1 if vertex vi is adjacent to vertex vj, and aij = 0 and aji = 0 otherwise.

Other Key Terms Degree: The degree d a of vertex a is the number of vertices to which a is linked by an edge. –The minimum possible degree is 0 –The maximum possible degree is n-1

Other Key Terms Centrality: Simply counting the in-ties and out-ties for each node Those which have the most are said to be the most influential in the network.

Applications Kevin Bacon Game Erdos Number

So what’s this have to do with the mass media? Journalists have begun to use SNA to investigate relationships among officials and to visualize where money is going. It is a part of the field called computer- assisted reporting (CAR).

Computer-Assisted Reporting What is Computer-Assisted Reporting? Def: the use of computers to gather and analyze the data necessary to write news stories. –First instance used in 1952 Election when CBS used the UNIVAC I computer to analyze returns from the U.S. presidential election. –Later pioneered by Philip Meyer, professor and Knight Chair at UNC-Chapel Hill –Today CAR skills are used in newsrooms across the country and the world –No student or beginning journalist should be without these skills.

Computer-Assisted Reporting In the last 15 years, journalism organizations such as the National Institute for Computer-Assisted Reporting (NICAR, a program of Investigative Reporters and Editors) has been created solely to promote the use of CAR in newsgathering. Journalists have also created mailing lists to share ideas about CAR, including NICAR-L.

How are journalists using SNA? SNA has only been widespread for about 5 years in the mass media Journalists are using SNA to analyze: – –Power in local government – –Campaign contributions – –Crime trends – –Public health – –Contracts and bids

SNA and public records Sources for doing a social network analysis is everywhere in public records – –Local government Web sites – –Form 990s – –FEC Contributions – –Property Records – –Court Records

Good examples of SNA in Journalism In 2004, The Kansas City Star used social network analysis software to visualize U.S. government allegations that the Islamic African Relief Agency (IARA) in Columbia, Mo., helped finance bin Laden and other terrorists. In 2004, the Washington Post used it to look at the campaign fundraising practices of President George W. Bush’s main contributors.

John Kerry’s contributions The Washington Post also used it to analyze Kerry’s donors in the 2004 election.

John Kerry’s contributions

Software So how did I do this?

Questions?