Unit 5: Centrality. ICPSR University of Michigan, Ann Arbor Summer 2015 Instructor: Ann McCranie
|
|
- Amy Leslie McKenzie
- 6 years ago
- Views:
Transcription
1 Unit 5: Centrality ICPSR University of Michigan, Ann Arbor Summer 2015 Instructor: Ann McCranie
2 What does centrality tell us? We often want to know who the most important actors in a network are. Centrality is one way to do this. There are many (dozens) of different kinds of centrality measures. Here are three of the most commonly used: Degree Closeness Betweenness
3 Things to keep in mind Centrality is a measure of an actor, centralization is a measure of the network. It matters whether you are considering a directed or an undirected network. Consider whether the measure is on ties sent and received (centrality) or ties received (prestige) Most centrality measures work on binary/ unweighted networks. Some have been extended to weighted networks. The three ideal networks we are about to use are all undirected and binary.
4 Example: Star N1 N2 N3 N4 N5 N6 N7 N N N N N N N
5 Example: Circle N1 N2 N3 N4 N5 N6 N7 N N N N N N N
6 Example: Line N1 N2 N3 N4 N5 N6 N7 N N N N N N N
7 Actor Degree Centrality In an undirected graph, the number of actor s ties. A highly central actor is where the action is and has connections with many other actors, relatively speaking. This person in a major conduit of whatever the content of the relationship is: information, affection, infectiousness. An actor with a low degree centrality has few ties.
8 Actor Degree Centrality Actor Degree Centrality (W&F, 178) Note, it is dependent on the size of the group. So...standardized, with range of 0-1:
9 Group Degree Centralization A centralization measure quantifies the range or variability of the individual actor indices. Most commonly used, reported in UCINET. Standardized:
10 Actor Degree Centrality and Group Centralization Actor Star Circle Line N N N N N N N C D
11 Degree Centrality Illustrated Fig. 1 from The Privileging of Communitarian Ideas: Citation Practices and the Translation of Social Capital in Public Health Research. S Moore, A Shiell, P Hawe, VA Haines - American Journal of Public Health, 2005" " (Actually shows indegree centrality) "
12 Actor Closeness Centrality An actor is close to all other actors in the network. If this actor is central by this measure, they can interact with all others. If they aren t connected to everyone, the geodesics, or shortest paths, should be as short as possible. This person can get to many others quickly. An actor who has very low closeness centrality takes many more steps to get to everyone. We are calculating distance using the sum of geodesic distances, the standard Freeman measure. There are other calculations of distances (sum of reciprocal distances, average of reverse distances (Valente and Foreman), all trails, all paths.
13 Actor Closeness Centrality Actor Closeness Centrality (W&F, ) Again, it is dependent on the size of the group. So...standardized:
14 Group Closeness Centralization Essentially: the sum of the differences between the maximum standardized actor centrality measure and each actor s centrality divided by the theoretical maximum of these summed differences. Range: 0-1
15 Actor Closeness Centrality and Group Closeness Centralization Actor Star Circle Line N N N N N N N C C
16 Closeness Centrality Illustrated Blue to red hue indicates closeness centrality From Wikipedia
17 Actor Betweenness Centrality An actor has a high betweenness centrality when they occupy a position in the geodesics connecting many pairs of other actors in the network. This doesn t mean they have the most ties, just the most that connect the most other people... High betweenness actors can be thought of as a cutpoint in the shortest path connecting two other nodes, therefore being a critical link between them. Think of terrorist networks. Actors who have few unique ties would not be as central. We are considering Freeman Betweenness Centrality, but there are other types.
18 Actor Betweenness Centrality W&F (pg ) g jk (n i ) = # of geodesics between n j and n k containing n i g jk = # of geodesics connecting n j and n k sum of percentages of all geodesics which contain n i Betweenness Centrality Standardized
19 Actor Betweenness Centrality and Group Betweenness Centralization Actor Star Circle Line N N N N N N N C B
20 Example: Betweenness If you add lines from C to D and from D to H, you remove the high betweenness centrality of E and F. "The Strength of Strong Ties: The Importance of Philos in Organizations." In N. Nohria & R. Eccles (eds.), Networks and Organizations: Structure, Form,and Action: Boston, MA: Harvard Business School Press. ""!!
21 For Directed Relations: Prestige and Rank Centrality focuses on choices made we can measure degree, closeness Prestige focuses on choices received we can measure degree, proximity, rank
22 Prestige Object of many ties, direct or indirect. Must be able to distinguish choices received from choices made. have to have a directed relation. Sometimes called status, deference, popularity, rank. P A (n i ) = actor level prestige index for actor i P A = group level prestige A = D, P, R Group level indices: variances
23 Prestige In-Degree divide the number of ties received by g-1 P D (n i ) = x +i / (g-1) Proximity like closeness, the ratio between the proportion of actors in the influence domain to the average distance of these actors to actor i. I i = # of actors who can reach n i Sum taken over all actors in n i s influence domain Between 0 (unreachable) and 1 (everyone can reach n i ) Can calculate variance for both of these to get group level index Nan Lin s index (1976)
24 A Rank solution: Eigenvector Centrality A node, using this measure, is important because they are connected to important others. Eigenvector centrality can be thought of as an extended form of degree centrality, in which we take into account not only how many neighbors a vertex has but also how central those neighbors themselves are. (Newman, Mark (2010) Networks: An Introduction)
25 Eigenvector Centrality Can be calculated in different ways, but commonly it is a matrix-based calculation in which node j s centrality is determined by the jth entry in the eigenvector corresponding to the largest positive eigenvalue
26 An ideal example. Hansen, Derek (2010). Analyzing Social Media Networks with NodeXL: Insights from a Connected World
27 An ideal example. Not center of attention But a broker of information Hansen, Derek (2010). Analyzing Social Media Networks with NodeXL: Insights from a Connected World
28 Padgett s Business Relation Bonacich Eigenvector Centralities 1 2 Eigenvec neigenvec ACCIAIUOLI ALBIZZI BARBADORI BISCHERI CASTELLANI GINORI GUADAGNI LAMBERTESCHI MEDICI PAZZI PERUZZI PUCCI RIDOLFI SALVIATI STROZZI TORNABUONI
29 A Directed Example Right now, UCINET doesn t implement in- out- Eigenvector, so Open KA in Netdraw Analysis->Centrality. Choose the directed version Size the nodes based on in-degree eigenvector Use the egonet viewer as shown above and step through the different ego inneighborhoods to see the differences in ego s neighbors centrality
30 For more information Newman (2010) provides a very technical discussion of the different ways of calculating centrality by using eigenvectors. This is a good tutorial on calculating eigenvectors. You do need to have familiarity with matrix algebra. eigenvalues-eigenvectors.html
31 There are many more types of centrality Bonacich Power (Bonacich P (1987). Power and Centrality: A family of Measures. American Journal of Sociology 92, ) Flow betweenness - Freeman L C, Borgatti S P and White D R (1991). Centrality in valued graphs: A measure of betweenness based on network flow Social Networks 13, Information - Stephenson K and Zelen M (1991). Rethinking Centrality Social Networks 13. Random Walk Betweenness - Newman, MEJ. (2005) A measure of betweenness centrality based on random walks. Social Networks,
32 Two-Mode Centrality Fig. 4. Strongest weighted cosponsorship ties in the full Senate network, Note: Size of each vertex is proportional to the Senator's connectedness score, the width of each arrow is proportional to the weighted quantity of bills cosponsored wij (values of wij < 10 not shown) and vertices that represent the top 20 Senators are identified by name. Figure drawn using Kamada Kawai algorithm in Pajek. From: Legislative cosponsorship networks in the US House and Senate Social Networks, Volume 28, Issue 4, October 2006, Pages James H. Fowler
33 Caution! This is an active field of research with regular innovation. Be careful when you are considering centrality measures that involve stuff traveling through networks. For instance, do the things being passed on get shared like diseases or are they passed on like packages? The examples shown above are common examples of centrality, but such off the shelf solutions often don t get it right. Borgatti Centrality and network flow. Social Networks, 27(1) Pages 55-71
34 A few more resources Chapter 5, Wasserman and Faust Chapter 4, Extending Centrality in Carrington, Scott, and Wasserman Borgatti and Everett A Graphtheoretic perspective on centrality. Social Networks. 28(4): (for undirected) Friedkin Theoretical Foundations for Centrality Measures. The American Journal of Sociology 96(6):
35 For tomorrow Assignment due Tuesday night. Next assignment due on Monday. Will require that you have worked through Lab 6.
36 RANK Most interesting prestige index P R (n i ) = x 1i P R (n 1 )+x 2i P R (n 2 )+ +x gi P R (n g ) or p = p X, where p = (P R (n 1 ),P R (n 2 ),,P R (n g )) or (I X )p = 0 Variety of suggestions for a solution: Katz: standardize X to have column sums of unity first (largest) eigenvalue of standardized X will be 1. corresponding eigenvector is p.
Centrality II. MGT 780 Social Network Analysis Steve Borgatti LINKS Center University of Kentucky. 11 April 2016 (c) 2016 Stephen P Borgatti 1
Centrality II MGT 780 Social Network Analysis Steve Borgatti LINKS Center University of Kentucky 1 Experimental exchange theory Recruit subjects to play game in which pairs of people have to allocate 24
More informationCentrality Measures. Leonid E. Zhukov
Centrality Measures Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural Analysis and Visualization
More informationNetworks in the Real World
Networks: Lecture 2 Introduction Networks in the Real World A network is a set of items (nodes or vertices) connected by edges or links. Systems taking the form of networks abound in the world. Types of
More informationNode Centrality and Ranking on Networks
Node Centrality and Ranking on Networks Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Social
More informationCentrality Measures. Leonid E. Zhukov
Centrality Measures Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Network Science Leonid E.
More informationCSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68
CSI 445/660 Part 6 (Centrality Measures for Networks) 6 1 / 68 References 1 L. Freeman, Centrality in Social Networks: Conceptual Clarification, Social Networks, Vol. 1, 1978/1979, pp. 215 239. 2 S. Wasserman
More informationCentrality in Social Networks: Theoretical and Simulation Approaches
entrality in Social Networks: Theoretical and Simulation Approaches Dr. Anthony H. Dekker Defence Science and Technology Organisation (DSTO) anberra, Australia dekker@am.org Abstract. entrality is an important
More informationUNCORRECTED PROOF. A Graph-theoretic perspective on centrality. Stephen P. Borgatti a,, Martin G. Everett b,1. 1. Introduction
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 Abstract Social Networks xxx (2005) xxx xxx A Graph-theoretic perspective on centrality Stephen P. Borgatti a,, Martin G. Everett
More informationDegree Distribution: The case of Citation Networks
Network Analysis Degree Distribution: The case of Citation Networks Papers (in almost all fields) refer to works done earlier on same/related topics Citations A network can be defined as Each node is
More informationNode and Link Analysis
Node and Link Analysis Leonid E. Zhukov School of Applied Mathematics and Information Science National Research University Higher School of Economics 10.02.2014 Leonid E. Zhukov (HSE) Lecture 5 10.02.2014
More informationPeripheries of Cohesive Subsets
Peripheries of Cohesive Subsets Martin G. Everett University of Greenwich School of Computing and Mathematical Sciences 30 Park Row London SE10 9LS Tel: (0181) 331-8716 Fax: (181) 331-8665 E-mail: m.g.everett@gre.ac.uk
More informationAssessing the Goodness-of-Fit of Network Models
Assessing the Goodness-of-Fit of Network Models Mark S. Handcock Department of Statistics University of Washington Joint work with David Hunter Steve Goodreau Martina Morris and the U. Washington Network
More informationCentrality in Social Networks
Developments in Data Analysis A. Ferligoj and A. Kramberger (Editors) Metodološki zvezki, 12, Ljubljana: FDV, 1996 Centrality in Social Networks Vladimir Batagelj Abstract In the paper an introduction
More informationCentrality. Structural Importance of Nodes
Centrality Structural Importance of Nodes Life in the Military A case by David Krackhardt Roger was in charge of a prestigious Advisory Team, which made recommendations to the Joint Chiefs of Staff. His
More informationSocial and Economic Networks: Models and Analysis Matthew O. Jackson Stanford University, Santa Fe Institute, CIFAR,
Social and Economic Networks: Models and Analysis Matthew O. Jackson Stanford University, Santa Fe Institute, CIFAR, www.stanford.edu\~jacksonm Copyright 2013 The Board of Trustees of The Leland Stanford
More informationarxiv: v2 [physics.soc-ph] 4 Sep 2013
Eigenvector centrality of nodes in multiplex networks arxiv:35.7445v2 [physics.soc-ph] 4 Sep 23 Luis Solá,,2 Miguel Romance,,2 Regino Criado,,2 Julio Flores,,2 Alejandro García del Amo,,2 and Stefano Boccaletti
More informationEpsilon Equitable Partition: A positional analysis method for large social networks
Epsilon Equitable Partition: A positional analysis method for large social networks Kiran Kate IBM Research - India Bangalore, India kirankate@in.ibm.com Balaraman Ravindran Dept. of Computer Science and
More informationMathematical Foundations of Social Network Analysis
Mathematical Foundations of Social Network Analysis Steve Borgatti Revised Jan 2008 for MGT 780 Three Representations Network/relational data typically represented in one of three ways Graphs Graphs vs
More informationarxiv: v1 [cs.si] 19 Dec 2013
Vulnerability and power on networks arxiv:1312.5598v1 [cs.si] 19 Dec 2013 Enrico Bozzo Department of Mathematics and Computer Science University of Udine enrico.bozzo@uniud.it Massimo Franceschet Department
More informationIn Social Network Analysis, Which Centrality Index Should I Use?: Theoretical Differences and Empirical Similarities among Top Centralities
Journal of Methods and Measurement in the Social Sciences, Vol. 8, No. 2, 72-99, 2017 In Social Network Analysis, Which Centrality Index Should I Use?: Theoretical Differences and Empirical Similarities
More informationPeripheries of cohesive subsets
Ž. Social Networks 21 1999 397 407 www.elsevier.comrlocatersocnet Peripheries of cohesive subsets Martin G. Everett a,), Stephen P. Borgatti b,1 a UniÕersity of Greenwich School of Computing and Mathematical
More informationIdeology and Social Networks in the U.S. Congress
Ideology and Social Networks in the U.S. Congress James H. Fowler University of California, San Diego July 11, 2007 Improve connectedness scores (Fowler 2005) Cosponsorship is about 2 things: The idea
More informationEvaluating the Project Coordination Performance Using Information Centrality
1119 Evaluating the Project Coordination Performance Using Information Centrality Pelin Ipek TIMURCAN 1 and Sevgi Zeynep DOGAN 2 1 Department of Architecture, Izmir Institute of Technology, 35430, Gulbahce,
More informationA Short Introduction to Networks
2015 Aaron Clauset 003 052 002 001 Aaron Clauset @aaronclauset Assistant Professor of Computer Science University of Colorado Boulder External Faculty, Santa Fe Institute 051 A Short Introduction to Networks
More informationTaught: 2005/6, 2006/7, 2007/8, 2008/9, 2009/10, 2010/11
Department of Sociology & Anthropology, BGU Course: Social Network Analysis Level and status: 4 credit points M.A. One of the core seminars for the track Organizational Sociology, and an elective seminar
More informationStatistical Inference for Networks Systems Biology Doctoral Training Centre Theoretical Systems Biology Module
Statistical Inference for Networks Systems Biology Doctoral Training Centre Theoretical Systems Biology Module MARCH 26-28, 2014 PROF. GESINE REINERT www.stats.ox.ac.uk/people/academic_staff/gesine_reinert
More informationWeb Structure Mining Nodes, Links and Influence
Web Structure Mining Nodes, Links and Influence 1 Outline 1. Importance of nodes 1. Centrality 2. Prestige 3. Page Rank 4. Hubs and Authority 5. Metrics comparison 2. Link analysis 3. Influence model 1.
More informationComplex Social System, Elections. Introduction to Network Analysis 1
Complex Social System, Elections Introduction to Network Analysis 1 Complex Social System, Network I person A voted for B A is more central than B if more people voted for A In-degree centrality index
More informationIntroduction to Social Network Analysis PSU Quantitative Methods Seminar, June 15
Introduction to Social Network Analysis PSU Quantitative Methods Seminar, June 15 Jeffrey A. Smith University of Nebraska-Lincoln Department of Sociology Course Website https://sites.google.com/site/socjasmith/teaching2/psu_social_networks_seminar
More informationLAPLACIAN MATRIX AND APPLICATIONS
LAPLACIAN MATRIX AND APPLICATIONS Alice Nanyanzi Supervisors: Dr. Franck Kalala Mutombo & Dr. Simukai Utete alicenanyanzi@aims.ac.za August 24, 2017 1 Complex systems & Complex Networks 2 Networks Overview
More informationWorking with Node Attributes
Working with Node Attributes Steve Borgatti 2009 LINKS Center Workshop ADVANCED Session Egonet Composition Concept Characterize the alters that an ego has ties a given type of ties with What proportion
More informationKristina Lerman USC Information Sciences Institute
Rethinking Network Structure Kristina Lerman USC Information Sciences Institute Università della Svizzera Italiana, December 16, 2011 Measuring network structure Central nodes Community structure Strength
More information6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities
6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities 1 Outline Outline Dynamical systems. Linear and Non-linear. Convergence. Linear algebra and Lyapunov functions. Markov
More informationLab 8: Measuring Graph Centrality - PageRank. Monday, November 5 CompSci 531, Fall 2018
Lab 8: Measuring Graph Centrality - PageRank Monday, November 5 CompSci 531, Fall 2018 Outline Measuring Graph Centrality: Motivation Random Walks, Markov Chains, and Stationarity Distributions Google
More informationComplex Networks CSYS/MATH 303, Spring, Prof. Peter Dodds
Complex Networks CSYS/MATH 303, Spring, 2011 Prof. Peter Dodds Department of Mathematics & Statistics Center for Complex Systems Vermont Advanced Computing Center University of Vermont Licensed under the
More informationNetwork Data: an overview
Network Data: an overview Introduction to Graph Theory and Sociometric Notation Dante J. Salto & Taya L. Owens 6 February 2013 Rockefeller College RPAD 637 Works Summarized Wasserman, S. & Faust, K. (2009).
More informationPolitician Family Networks and Electoral Outcomes: Evidence from the Philippines. Online Appendix. Cesi Cruz, Julien Labonne, and Pablo Querubin
Politician Family Networks and Electoral Outcomes: Evidence from the Philippines Online Appendix Cesi Cruz, Julien Labonne, and Pablo Querubin 1 A.1 Additional Figures 8 4 6 2 Vote Share (residuals) 4
More informationThe analysis of social networks
Health Serv Outcomes Res Method (2008) 8:222 269 DOI 10.1007/s10742-008-0041-z The analysis of social networks A. James O Malley Æ Peter V. Marsden Received: 2 March 2008 / Revised: 16 September 2008 /
More informationSocial Networks 8 (1986) North-Holland CUMULATED SOCIAL ROLES: THE DUALITY OF PERSONS AND THEIR ALGEBRAS *
Social Networks 8 (1986) 215-256 215 North-Holland CUMULATED SOCAL ROLES: THE DUALTY OF PERSONS AND THER ALGEBRAS * Ronald L. BREGER ** Cornell U, iversity Philippa E. PATTSON *** University of Melbourne
More informationNetwork Theory with Applications to Economics and Finance
Network Theory with Applications to Economics and Finance Instructor: Michael D. König University of Zurich, Department of Economics, Schönberggasse 1, CH - 8001 Zurich, email: michael.koenig@econ.uzh.ch.
More informationELEC6910Q Analytics and Systems for Social Media and Big Data Applications Lecture 3 Centrality, Similarity, and Strength Ties
ELEC6910Q Analytics and Systems for Social Media and Big Data Applications Lecture 3 Centrality, Similarity, and Strength Ties Prof. James She james.she@ust.hk 1 Last lecture 2 Selected works from Tutorial
More informationDATA MINING LECTURE 13. Link Analysis Ranking PageRank -- Random walks HITS
DATA MINING LECTURE 3 Link Analysis Ranking PageRank -- Random walks HITS How to organize the web First try: Manually curated Web Directories How to organize the web Second try: Web Search Information
More informationSocial Network Notation
Social Network Notation Wasserman & Faust (1994) Chapters 3 & 4 [pp. 67 166] Marsden (1987) Core Discussion Networks of Americans Junesoo, Xiaohui & Stephen Monday, February 8th, 2010 Wasserman & Faust
More informationClass President: A Network Approach to Popularity. Due July 18, 2014
Class President: A Network Approach to Popularity Due July 8, 24 Instructions. Due Fri, July 8 at :59 PM 2. Work in groups of up to 3 3. Type up the report, and submit as a pdf on D2L 4. Attach the code
More informationGoogle Page Rank Project Linear Algebra Summer 2012
Google Page Rank Project Linear Algebra Summer 2012 How does an internet search engine, like Google, work? In this project you will discover how the Page Rank algorithm works to give the most relevant
More informationOnline Social Networks and Media. Link Analysis and Web Search
Online Social Networks and Media Link Analysis and Web Search How to Organize the Web First try: Human curated Web directories Yahoo, DMOZ, LookSmart How to organize the web Second try: Web Search Information
More informationCentrality Measures in Networks
Centrality Measures in Networks arxiv:1608.05845v3 [physics.soc-ph] 17 Jun 2017 Francis Bloch Matthew O. Jackson Pietro Tebaldi June 2017 Abstract We show that although the prominent centrality measures
More information8 Influence Networks. 8.1 The basic model. last revised: 23 February 2011
last revised: 23 February 2011 8 Influence Networks Social psychologists have long been interested in social influence processes, and whether these processes will lead over time to the convergence (or
More informationSustainable Tourism Networks
Sustainable Tourism Networks Seldjan Timur Abstract This study examines the existing pattern of stakeholder relationships representing major partners of sustainable tourism development. By utilizing a
More informationMath Fundamentals for Statistics I (Math 52) Unit 7: Connections (Graphs, Equations and Inequalities)
Math Fundamentals for Statistics I (Math 52) Unit 7: Connections (Graphs, Equations and Inequalities) By Scott Fallstrom and Brent Pickett The How and Whys Guys This work is licensed under a Creative Commons
More informationResearch Article Analysis of Unweighted Amino Acids Network
International Scholarly Research Notices, Article ID 350276, 6 pages http://dx.doi.org/10.1155/2014/350276 Research Article Analysis of Unweighted Amino Acids Network Adil Akhtar and Tazid Ali Department
More informationBargaining, Information Networks and Interstate
Bargaining, Information Networks and Interstate Conflict Erik Gartzke Oliver Westerwinter UC, San Diego Department of Political Sciene egartzke@ucsd.edu European University Institute Department of Political
More information(2009) 388 (5) ISSN
Estrada, Ernesto and Higham, Desmond J. and Hatano, Naomichi (2009) Communicability betweenness in complex networks. Physica A: Statistical Mechanics and its Applications, 388 (5). pp. 764-774. ISSN 0378-4371,
More informationMore on infinite series Antiderivatives and area
More on infinite series Antiderivatives and area September 28, 2017 The eighth breakfast was on Monday: There are still slots available for the October 4 breakfast (Wednesday, 8AM), and there s a pop-in
More informationStatistics 202: Data Mining. c Jonathan Taylor. Week 2 Based in part on slides from textbook, slides of Susan Holmes. October 3, / 1
Week 2 Based in part on slides from textbook, slides of Susan Holmes October 3, 2012 1 / 1 Part I Other datatypes, preprocessing 2 / 1 Other datatypes Document data You might start with a collection of
More informationPart I. Other datatypes, preprocessing. Other datatypes. Other datatypes. Week 2 Based in part on slides from textbook, slides of Susan Holmes
Week 2 Based in part on slides from textbook, slides of Susan Holmes Part I Other datatypes, preprocessing October 3, 2012 1 / 1 2 / 1 Other datatypes Other datatypes Document data You might start with
More informationAXIOMS FOR CENTRALITY
AXIOMS FOR CENTRALITY From a paper by Paolo Boldi, Sebastiano Vigna Università degli Studi di Milano! Internet Math., 10(3-4):222 262, 2014. Proc. 13th ICDMW. IEEE, 2013. Proc. 4th WebScience. ACM, 2012.!
More informationThis section is an introduction to the basic themes of the course.
Chapter 1 Matrices and Graphs 1.1 The Adjacency Matrix This section is an introduction to the basic themes of the course. Definition 1.1.1. A simple undirected graph G = (V, E) consists of a non-empty
More informationModule 1: Introduction to Functions
Haberman / Kling MTH 95 Section II: Functions, Inequalities, and the Absolute Value Module 1: Introduction to Functions A function is a special type of binary relation. So before we discuss what a function
More informationBECOMING FAMILIAR WITH SOCIAL NETWORKS
1 BECOMING FAMILIAR WITH SOCIAL NETWORKS Each one of us has our own social networks, and it is easiest to start understanding social networks through thinking about our own. So what social networks do
More informationSocial Network Analysis. Mrigesh Kshatriya, CIFOR Sentinel Landscape Data Analysis workshop (3rd-7th March 2014) Venue: CATIE, Costa Rica.
Social Network Analysis Mrigesh Kshatriya, CIFOR Sentinel Landscape Data Analysis workshop (3rd-7th March 2014) Venue: CATIE, Costa Rica. Talk outline What is a Social Network? Data collection Visualizing
More informationPageRank: The Math-y Version (Or, What To Do When You Can t Tear Up Little Pieces of Paper)
PageRank: The Math-y Version (Or, What To Do When You Can t Tear Up Little Pieces of Paper) In class, we saw this graph, with each node representing people who are following each other on Twitter: Our
More informationLocal and Consistent Centrality Measures in Networks 1
Local and Consistent Centrality Measures in Networks 1 Vianney Dequiedt 2 and Yves Zenou 3 This version: September 27, 2014 Abstract The centrality of an agent in a network has been shown to be crucial
More informationData science with multilayer networks: Mathematical foundations and applications
Data science with multilayer networks: Mathematical foundations and applications CDSE Days University at Buffalo, State University of New York Monday April 9, 2018 Dane Taylor Assistant Professor of Mathematics
More informationOnline Social Networks and Media. Link Analysis and Web Search
Online Social Networks and Media Link Analysis and Web Search How to Organize the Web First try: Human curated Web directories Yahoo, DMOZ, LookSmart How to organize the web Second try: Web Search Information
More informationMining of Massive Datasets Jure Leskovec, AnandRajaraman, Jeff Ullman Stanford University
Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit
More informationOnline Sampling of High Centrality Individuals in Social Networks
Online Sampling of High Centrality Individuals in Social Networks Arun S. Maiya and Tanya Y. Berger-Wolf Department of Computer Science University of Illinois at Chicago 85 S. Morgan, Chicago, IL 667,
More informationJustification and Application of Eigenvector Centrality
Justification and Application of Eigenvector Centrality Leo Spizzirri With great debt to P. D. Straffin, Jr Algebra in Geography: Eigenvectors of Networks[7] 3/6/2 Introduction Mathematics is only a hobby
More informationCohesive Subgroups. October 4, Based on slides by Steve Borgatti. Modifications (many sensible) by Rich DeJordy
Cohesive Subgroups October 4, 26 Based on slides by Steve Borgatti. Modifications (many sensible) by Rich DeJordy Before We Start Any questions on cohesion? Why do we care about Cohesive Subgroups 1. They
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
Data Mining and Analysis: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA
More informationMath 304 Handout: Linear algebra, graphs, and networks.
Math 30 Handout: Linear algebra, graphs, and networks. December, 006. GRAPHS AND ADJACENCY MATRICES. Definition. A graph is a collection of vertices connected by edges. A directed graph is a graph all
More informationAs it is not necessarily possible to satisfy this equation, we just ask for a solution to the more general equation
Graphs and Networks Page 1 Lecture 2, Ranking 1 Tuesday, September 12, 2006 1:14 PM I. II. I. How search engines work: a. Crawl the web, creating a database b. Answer query somehow, e.g. grep. (ex. Funk
More informationAstronomical Distances. Astronomical Distances 1/30
Astronomical Distances Astronomical Distances 1/30 Last Time We ve been discussing methods to measure lengths and objects such as mountains, trees, and rivers. Today we ll look at some more difficult problems.
More informationCS224W: Social and Information Network Analysis Lada Adamic
CS224W: Social and Information Network Analysis Lada Adamic http://cs224w.stanford.edu Stanford Social Web (ca. 1999) network of personal homepages at Stanford different notions of centrality In each
More informationCONTENTS. Preface List of Symbols and Notation
CONTENTS Preface List of Symbols and Notation xi xv 1 Introduction and Review 1 1.1 Deterministic and Stochastic Models 1 1.2 What is a Stochastic Process? 5 1.3 Monte Carlo Simulation 10 1.4 Conditional
More informationUnit 01 Motion with constant velocity. What we asked about
Unit 01 Motion with constant velocity Outline for this unit: Displacement, Velocity: numerically and graphically Mechanics Lecture 1, Slide 1 What we asked about Would like to see more practice problems
More informationPhysics 008 Tutorial 7: Energy Bands
1 Physics 8 Tutorial 7: Bands In this tutorial we are going to investigate how electronic bands form when atoms are brought together. We saw in the last tutorial and in the lectures that atoms possess
More informationIntroduction Centrality Measures Implementation Applications Limitations Homework. Centrality Metrics. Ron Hagan, Yunhe Feng, and Jordan Bush
Centrality Metrics Ron Hagan, Yunhe Feng, and Jordan Bush University of Tennessee Knoxville April 22, 2015 Outline 1 Introduction 2 Centrality Metrics 3 Implementation 4 Applications 5 Limitations Introduction
More informationLink Analysis Information Retrieval and Data Mining. Prof. Matteo Matteucci
Link Analysis Information Retrieval and Data Mining Prof. Matteo Matteucci Hyperlinks for Indexing and Ranking 2 Page A Hyperlink Page B Intuitions The anchor text might describe the target page B Anchor
More informationOverview of Stochastic Approaches to Social Network Analysis
Overview of Stochastic Approaches to Social Network Analysis Wasserman and Faust, Chapter 13-16. Anderson, Carolyn J., Stanley Wasserman, and Bradley Crouch. 1999. A p* primer: Logit models for social
More informationIntroduction to Data Mining
Introduction to Data Mining Lecture #9: Link Analysis Seoul National University 1 In This Lecture Motivation for link analysis Pagerank: an important graph ranking algorithm Flow and random walk formulation
More informationFinding central nodes in large networks
Finding central nodes in large networks Nelly Litvak University of Twente Eindhoven University of Technology, The Netherlands Woudschoten Conference 2017 Complex networks Networks: Internet, WWW, social
More informationCS 277: Data Mining. Mining Web Link Structure. CS 277: Data Mining Lectures Analyzing Web Link Structure Padhraic Smyth, UC Irvine
CS 277: Data Mining Mining Web Link Structure Class Presentations In-class, Tuesday and Thursday next week 2-person teams: 6 minutes, up to 6 slides, 3 minutes/slides each person 1-person teams 4 minutes,
More informationLabs: Chelsea Ackroyd Office Location: FMAB 005 Office Hours: M 08:45 11:45 AM or by appointment
Introduction to Geographic Information Systems (GEOG 3140 and 314) & GIS Fundamentals (GEOG 6139) Fall 2017 Section 002 M 01:25 02:45 PM Section 003 M 03:00 4:20 PM Section 004 W 01:25 02:45 PM M Lib 1150
More informationName: Laboratory Investigation
Laboratory Investigation Abstract: Analysis of the circular motion of a swinging stopper will provide insight into the causes of centripetal force and develop relationships between speed, radius and centripetal
More informationCohesive Subgroups and Core- Periphery Structure. Xiao Hyo-shin
Cohesive Subgroups and Core- Periphery Structure Xiao Hyo-shin Wasserman and Faust, chapter7 Cohesive Subgroups: Theoretical motivation Assess Directional relations and valued relations Interpretation
More informationA Note on Google s PageRank
A Note on Google s PageRank According to Google, google-search on a given topic results in a listing of most relevant web pages related to the topic. Google ranks the importance of webpages according to
More informationCommunities Via Laplacian Matrices. Degree, Adjacency, and Laplacian Matrices Eigenvectors of Laplacian Matrices
Communities Via Laplacian Matrices Degree, Adjacency, and Laplacian Matrices Eigenvectors of Laplacian Matrices The Laplacian Approach As with betweenness approach, we want to divide a social graph into
More informationOnline Social Networks and Media. Opinion formation on social networks
Online Social Networks and Media Opinion formation on social networks Diffusion of items So far we have assumed that what is being diffused in the network is some discrete item: E.g., a virus, a product,
More informationLecture: Local Spectral Methods (1 of 4)
Stat260/CS294: Spectral Graph Methods Lecture 18-03/31/2015 Lecture: Local Spectral Methods (1 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough. They provide
More informationCS Algorithms and Complexity
CS 50 - Algorithms and Complexity Linear Programming, the Simplex Method, and Hard Problems Sean Anderson 2/15/18 Portland State University Table of contents 1. The Simplex Method 2. The Graph Problem
More informationApplications to network analysis: Eigenvector centrality indices Lecture notes
Applications to network analysis: Eigenvector centrality indices Lecture notes Dario Fasino, University of Udine (Italy) Lecture notes for the second part of the course Nonnegative and spectral matrix
More information6.842 Randomness and Computation March 3, Lecture 8
6.84 Randomness and Computation March 3, 04 Lecture 8 Lecturer: Ronitt Rubinfeld Scribe: Daniel Grier Useful Linear Algebra Let v = (v, v,..., v n ) be a non-zero n-dimensional row vector and P an n n
More information5( 4) 4 = x. Answers to Warm Up: Solve the equation and then graph your solution on the number line below.
Grade Level/Course: Grade 7, Grade 8, and Algebra 1 Lesson/Unit Plan Name: Introduction to Solving Linear Inequalities in One Variable Rationale/Lesson Abstract: This lesson is designed to introduce graphing
More informationDominating Configurations of Kings
Dominating Configurations of Kings Jolie Baumann July 11, 2006 Abstract In this paper, we are counting natural subsets of graphs subject to local restrictions, such as counting independent sets of vertices,
More informationPhysical Metaphors for Graphs
Graphs and Networks Lecture 3 Physical Metaphors for Graphs Daniel A. Spielman October 9, 203 3. Overview We will examine physical metaphors for graphs. We begin with a spring model and then discuss resistor
More informationTEMPORAL EXPONENTIAL- FAMILY RANDOM GRAPH MODELING (TERGMS) WITH STATNET
1 TEMPORAL EXPONENTIAL- FAMILY RANDOM GRAPH MODELING (TERGMS) WITH STATNET Prof. Steven Goodreau Prof. Martina Morris Prof. Michal Bojanowski Prof. Mark S. Handcock Source for all things STERGM Pavel N.
More informationAn Algorithmist s Toolkit September 10, Lecture 1
18.409 An Algorithmist s Toolkit September 10, 2009 Lecture 1 Lecturer: Jonathan Kelner Scribe: Jesse Geneson (2009) 1 Overview The class s goals, requirements, and policies were introduced, and topics
More informationSOCIAL network analysis and visualization have become
106 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. 18, NO. 1, JANUARY 2012 Visual Reasoning about Social Networks Using Centrality Sensitivity Carlos D. Correa, Member, IEEE, Tarik Crnovrsanin,
More informationMATH 829: Introduction to Data Mining and Analysis Clustering II
his lecture is based on U. von Luxburg, A Tutorial on Spectral Clustering, Statistics and Computing, 17 (4), 2007. MATH 829: Introduction to Data Mining and Analysis Clustering II Dominique Guillot Departments
More information