Social Network Analysis and Its Applications By Paul Rossman Indiana University of Pennsylvania.

Slides:



Advertisements
Similar presentations
Social Network Analysis (in 10 minutes) Nick Crossley.
Advertisements

Complex Networks Luis Miguel Varela COST meeting, Lisbon March 27 th 2013.
Network Matrix and Graph. Network Size Network size – a number of actors (nodes) in a network, usually denoted as k or n Size is critical for the structure.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Review Binary Search Trees Operations on Binary Search Tree
Introduction to Network Theory: Modern Concepts, Algorithms
1 Slides based on those of Kenneth H. Rosen Slides by Sylvia Sorkin, Community College of Baltimore County - Essex Campus Graphs.
Introduction to Social Network Analysis Lluís Coromina Departament d’Economia. Universitat de Girona Girona, 18/01/2005.
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.
Graph & BFS.
Graph & BFS Lecture 22 COMP171 Fall Graph & BFS / Slide 2 Graphs * Extremely useful tool in modeling problems * Consist of: n Vertices n Edges D.
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.
How is this going to make us 100K Applications of Graph Theory.
Graph: Relations There are many kinds of social relations. For example: Role-based : brother of, father of, sister of, etc. : friend of, acquaintance of,
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Graphs, relations and matrices
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 Networks Corina Ciubuc.
Graph. Data Structures Linear data structures: –Array, linked list, stack, queue Non linear data structures: –Tree, binary tree, graph and digraph.
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 and the Mass Media By Paul Rossman Indiana University of Pennsylvania.
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,
1 Topics Intro. to Graphs (11.1) A B C D EF G. 2 Definition (p.650) A graph G = V(G) + E(G) A set of vertices (or nodes), V(G) = {v 1, v 2, …, v n } A.
 What is a graph? What is a graph?  Directed vs. undirected graphs Directed vs. undirected graphs  Trees vs graphs Trees vs graphs  Terminology: Degree.
Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Graphs.
Social Network Basics CS315 – Web Search and Data Mining.
1 CS104 : Discrete Structures Chapter V Graph Theory.
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 April 25, 2012.
How to Analyse Social Network?
Data Structures & Algorithms Graphs
L – Modelling and Simulating Social Systems with MATLAB Lesson 6 – Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Introduction to Graph Theory
Graphs & Matrices Todd Cromedy & Bruce Nicometo March 30, 2004.
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
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,
Introduction to Matrices and Statistics in SNA Laura L. Hansen Department of Sociology UMB SNA Workshop July 31, 2008 (SOURCE: Introduction to Social Network.
Graphs Basic properties.
How to Analyse Social Network? Social networks can be represented by complex networks.
Chapter 05 Introduction to Graph And Search Algorithms.
Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.
Advanced Mathematics in Mass Journalism By Paul Rossman March 18, 2008.
Social Networks Analysis
Social Networks Analysis
Department of Computer and IT Engineering University of Kurdistan
Graphs and Graph Models
Network analysis.
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..
CSE 373 Data Structures Lecture 17
Graphs.
Graphs G = (V, E) V are the vertices; E are the edges.
GRAPHS G=<V,E> Adjacent vertices Undirected graph
Trees-2, Graphs Data Structures with C Chpater-6 Course code: 10CS35
CSE 373 Data Structures Lecture 13
Graphs G = (V,E) V is the vertex set.
GRAPHS.
Presentation transcript:

Social Network Analysis and Its Applications 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: –Sociometry & psychometry Jacob Moreno (sociogram) –Social anthropology kinship algebra –Sociology Durkheim SNA derives many of its concepts from discrete math from fields such as graph theory, group theory and matrix algebra.

Why Social Network Analysis? SNA violates traditional statistical tests –Assumes dependence rather than independence –Need somehow to measure how “connected” a group is or who the major players are in a network. –Graph theory, and properties of matrices help us with this problem

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.

Centrality Degree: Number of ties to others. Row or column sums of adjacency matrix. –In a friendship network, degree may translate to gregariousness or popularity Closeness: The graph-theoretic distance of a given node to all other nodes. –Simple closeness is an inverse measure of centrality (Larger the numbers, the more distant the actor is)

Centrality Betweenness: –The number of "times" that any node needs a given node to reach any node by the shortest path. Interpreted as indicating power and access to diversity of what flows; potential for synthesizing. Eigenvector: –Principal eigenvector of the (possibly valued) adjacency matrix of a network. Indicator of popularity, “in the know” Tends to identify centers of large cliques

Applications Kevin Bacon Game Baseball Oracle Erdos Number

So why did I learn this? 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).

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? * Grin -- * UCINET --

Questions? Presentation will be up at Indiana County Data Center