Centrality in Social Networks Background: At the individual level, one dimension of position in the network can be captured through centrality. Conceptually,

Slides:



Advertisements
Similar presentations
Sampling Distributions Suppose I throw a dice times and count the number of times each face turns up: Each score has a similar frequency (uniform.
Advertisements

Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale Network Theory: Computational Phenomena and Processes Social Network.
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.
SOCI 5013: Advanced Social Research: Network Analysis Spring 2004.
Introduction to Social Network Analysis Lluís Coromina Departament d’Economia. Universitat de Girona Girona, 18/01/2005.
CHAPTER 8: AFFILIATION AND OVERLAPPING SUBGROUPS SOCIAL NETWORK ANALYSIS BY WASSERMAN AND FAUST AFFILIATION NETWORKS Adapted from a presentation by Jody.
CONNECTIVITY “The connectivity of a network may be defined as the degree of completeness of the links between nodes” (Robinson and Bamford, 1978).
Identity and search in social networks Presented by Pooja Deodhar Duncan J. Watts, Peter Sheridan Dodds and M. E. J. Newman.
Centrality in Social Networks
By: Roma Mohibullah Shahrukh Qureshi
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
Correlation and Autocorrelation
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Centrality and Prestige HCC Spring 2005 Wednesday, April 13, 2005 Aliseya Wright.
Network Structure and Delinquency Within a Juvenile Gang.
Visual representations of networks Judith Molka-Danielsen In765: Knowledge Networks Nov.08, 2005 Reference: Based on notes from “Introduction to Social.
A measure of betweenness centrality based on random walks Author: M. E. J. Newman Presented by: Amruta Hingane Department of Computer Science Kent State.
HCC class lecture 22 comments John Canny 4/13/05.
Chapter 12 Network positions and social roles: The idea of equivalence 1.
Centrality in Social Networks Background: At the individual level, one dimension of position in the network can be captured through centrality. Conceptually,
Designing the Marketing Channel
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
Models of Influence in Online Social Networks
Connectivity and the Small World Overview Background: de Pool and Kochen: Random & Biased networks Rapoport’s work on diffusion Travers and Milgram Argument.
Social Networks Corina Ciubuc.
SOCIAL NETWORKS and COMMUNITY DETECTION. “Networks” is a pervasive term? Networked Economy Immigrant Networks National Innovation Networks Networking.
@ 2012 Wadsworth, Cengage Learning Chapter 5 Description of Behavior Through Numerical 2012 Wadsworth, Cengage Learning.
Descriptive Statistics Used to describe the basic features of the data in any quantitative study. Both graphical displays and descriptive summary statistics.
Overview Granovetter: Strength of Weak Ties What are ‘weak ties’? why are they ‘strong’? Burt: Structural Holes What are they? What do they do? How do.
Spectral coordinate of node u is its location in the k -dimensional spectral space: Spectral coordinates: The i ’th component of the spectral coordinate.
Presentation: Random Walk Betweenness, J. Govorčin Laboratory for Data Technologies, Faculty of Information Studies, Novo mesto – September 22, 2011 Random.
Lecture 4 Transport Network and Flows. Mobility, Space and Place Transport is the vector by which movement and mobility is facilitated. It represents.
Infrastructure of MANETs  MANETS are without a fixed infrastructure  Network Graphs in MANETS are rarely or ever connected  MANET routing protocols.
Connectivity and the Small World Overview Background: de Pool and Kochen: Random & Biased networks Rapoport’s work on diffusion Travers and Milgram Argument.
Victor Lee.  What are Social Networks?  Role and Position Analysis  Equivalence Models for Roles  Block Modelling.
Principles of Social Network Analysis. Definition of Social Networks “A social network is a set of actors that may have relationships with one another”
Centrality in undirected networks These slides are by Prof. James Moody at Ohio State.
Network Analysis of the local Public Health Sector: Translating evidence into practice Helen McAneney School of Medicine, Dentistry and Biomedical Sciences,
Science: Graph theory and networks Dr Andy Evans.
An Introduction to Social Network Analysis Yi Li
Centrality Spring 2012.
"Social Networks, Cohesion and Epidemic Potential" James Moody Department of Sociology Department of Mathematics Undergraduate Recognition Ceremony May.
School of Information University of Michigan Unless otherwise noted, the content of this course material is licensed under a Creative Commons Attribution.
Variables and their Operational Definitions
Lecture 13: Network centrality Slides are modified from Lada Adamic.
Connectivity & Cohesion Overview Background: Small World = Connected What distinguishes simple connection from cohesion? Moody & White Argument Measure.
Chapter 7 Probability and Samples: The Distribution of Sample Means.
Individual Differences & Correlations Psy 425 Tests & Measurements Furr & Bacharach Ch 3, Part 1.
1-1 What is Management?  All managers work in organizations  Organizations ≈ collections of people who work together and coordinate their actions to.
Understanding Network Concepts in Modules Dong J, Horvath S (2007) BMC Systems Biology 2007, 1:24.
Lab 4: Working with NetDraw
Slides are modified from Lada Adamic
Hierarchy Overview Background: Hierarchy surrounds us: what is it? Micro foundations of social stratification Ivan Chase: Structure from process Action.
Graphs & Matrices Todd Cromedy & Bruce Nicometo March 30, 2004.
Inequality, networks and distributive decisions: A field experiment Ben D’Exelle University of Antwerp - IOB Maastricht University Arno Riedl Maastricht.
Chapter Eight: Using Statistics to Answer Questions.
Chapter Thirteen – Organizational Effectiveness.  Be able to define organizational effectiveness  Understand the issues underpinning measuring organizational.
1 Epidemic Potential in Human Sexual Networks: Connectivity and The Development of STD Cores.
Structural Holes & Weak Ties
11 Network Level Indicators Bird’s eye view of network Image matrix example of network level Many network level measures Some would argue this is the most.
HCC class lecture 21: Intro to Social Networks John Canny 4/11/05.
Selected Topics in Data Networking Explore Social Networks: Center and Periphery.
How to Analyse Social Network? Social networks can be represented by complex networks.
Informatics tools in network science
Importance Measures on Nodes Lecture 2 Srinivasan Parthasarathy 1.
Social Networks Analysis
Department of Computer and IT Engineering University of Kurdistan
Network Science: A Short Introduction i3 Workshop
Centrality in Social Networks
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Presentation transcript:

Centrality in Social Networks Background: At the individual level, one dimension of position in the network can be captured through centrality. Conceptually, centrality is fairly straight forward: we want to identify which nodes are in the ‘center’ of the network. In practice, identifying exactly what we mean by ‘center’ is somewhat complicated. Approaches: Degree Closeness Betweenness Information & Power Graph Level measures: Centralization Applications: Friedkin: Interpersonal Influence in Groups Baker: The social Organization of Conspiracy

Intuitively, we want a method that allows us to distinguish “important” actors. Consider the following graphs:

The most intuitive notion of centrality focuses on degree: The actor with the most ties is the most important:

Degree centrality, however, can be deceiving:

One often standardizes the degree distribution, by the maximum possible (g-1):

If we want to measure the degree to which the graph as a whole is centralized, we look at the dispersion of centrality: Simple: variance of the individual centrality scores. Or, using Freeman’s general formula for centralization:

Degree Centralization Scores Freeman:.07 Variance:.20 Freeman: 1.0 Variance: 3.9 Freeman:.02 Variance:.17 Freeman: 0.0 Variance: 0.0

Degree Centralization Scores Freeman: 0.1 Variance: 4.84

A second measure of centrality is closeness centrality. An actor is considered important if he/she is relatively close to all other actors. Closeness is based on the inverse of the distance of each actor to every other actor in the network. Closeness Centrality: Normalized Closeness Centrality

Distance Closeness normalized Closeness Centrality in the examples Distance Closeness normalized

Distance Closeness normalized Closeness Centrality in the examples

Distance Closeness normalized Closeness Centrality in the examples

Closeness Centralization Scores Centralizationvariance Index Star: Circle: Line: Group Grid

Graph Theoretic Center (Barry or Jordan Center). Identify the points with the smallest, maximum distance to all other points. Value = longest distance to any other node. The graph theoretic center is ‘3’, but you might also consider a continuous measure as the inverse of the maximum geodesic

Graph Theoretic Center (Barry or Jordan Center).

Betweenness Centrality: Model based on communication flow: A person who lies on communication paths can control communication flow, and is thus important. Betweenness centrality counts the number of geodesic paths between i and k that actor j resides on. b a C d e f g h

Betweenness Centrality: a bc d e f g h i j k l m a b d e f k m l m g h j i j c d e f k m l m g h j i j

Where g jk = the number of geodesics connecting jk, and g jk = the number that actor i is on. Usually normalized by:

Centralization: 1.0 Centralization:.31 Centralization:.59 Centralization: 0 Betweenness Centrality:

Centralization:.183 Betweenness Centrality:

Information Centrality: It is quite likely that information can flow through paths other than the geodesic. The Information Centrality score uses all paths in the network, and weights them based on their length.

Information Centrality:

Bonacich Power Centrality: Actor’s centrality (prestige) is equal to a function of the prestige of those they are connected to. Thus, actors who are tied to very central actors should have higher prestige/ centrality than those who are not.  is a scaling vector, which is set to normalize the score.  reflects the extent to which you weight the centrality of people ego is tied to. R is the adjacency matrix (can be valued) I is the identity matrix (1s down the diagonal) 1 is a matrix of all ones.

Bonacich Power Centrality: The magnitude of  reflects the radius of power. Small values of  weight local structure, larger values weight global structure. If  is positive, then ego has higher centrality when tied to people who are central. If  is negative, then ego has higher centrality when tied to people who are not central. As  approaches zero, you get degree centrality.

 =.23  =-.23 Bonacich Power Centrality:

 =.35  =-.35 Bonacich Power Centrality:

 =.23

Bonacich Power Centrality:  =-.23

Total Effects Centrality (Friedkin). Very similar to the Bonacich measure, it is based on an assumed peer influence model (which we will go over next meeting). The formula is: Where W is a row-normalized adjacency matrix, and  is a weight for the amount of interpersonal influence

Noah Friedkin: Structural bases of interpersonal influence in groups Interested in identifying the structural bases of power. In addition to resources, he identifies: Cohesion Similarity Centrality Which are thought to affect interpersonal visibility and salience

Cohesion Members of a cohesive group are likely to be aware of each others opinions, because information diffuses quickly within the group. Groups encourage (through balance) reciprocity and compromise. This likely increases the salience of opinions of other group members, over non-group members. Noah Friedkin: Structural bases of interpersonal influence in groups

Structural Similarity Two people may not be directly connected, but occupy a similar position in the structure. As such, they have similar interests in outcomes that relate to positions in the structure. Similarity must be conditioned on visibility. P must know that O is in the same position, which means that the effect of similarity might be conditional on communication frequency.

Noah Friedkin: Structural bases of interpersonal influence in groups Centrality Central actors are likely more influential. They have greater access to information and can communicate their opinions to others more efficiently. Research shows they are also more likely to use the communication channels than are periphery actors.

Noah Friedkin: Structural bases of interpersonal influence in groups Substantive questions: Influence in establishing school performance criteria. Data on 23 teachers collected in 2 waves Dyads are the unit of analysis (P--> O): want to measure the extent of influence of one actor on another. Each teacher identified how much an influence others were on their opinion about school performance criteria. Cohesion = probability of a flow of events (communication) between them, within 3 steps. Similarity = pairwise measure of equivalence (profile correlations) Centrality = TEC (power centrality)

Find that each matter for interpersonal communication, and that communication is what matters most for interpersonal influence Noah Friedkin: Structural bases of interpersonal influence in groups

Baker & Faulkner: Social Organization of Conspiracy Questions: How are relations organized to facilitate illegal behavior? They show that the pattern of communication maximizes concealment, and predicts the criminal verdict. Inter-organizational cooperation is common, but too much ‘cooperation’ can thwart market competition, leading to (illegal) market failure. Illegal networks differ from legal networks, in that they must conceal their activity from outside agents. A “Secret society” should be organized to (a) remain concealed and (b) if discovered make it difficult to identify who is involved in the activity The need for secrecy should lead conspirators to conceal their activities by creating sparse and decentralized networks.

From an individual standpoint, actors want to be central to get the benefits, but peripheral to remain concealed. They examine the effect of Degree, Betweenness and Closeness centrality on the criminal outcomes, based on reconstruction of the communication networks involved. At the organizational level, they find decentralized networks in the two low information-processing conspiracies, but high centralization in the other. Thus, a simple product can be organized without centralization. At the individual level, that degree centrality (net of other factors) predicts verdict,

Information Low High Secrecy Low High Centralized Decentralized Centralized