THE KNOWLEDGE MANAGEMENT STRATEGY IN ORGANIZATIONS. Summer semester, 2016/2017
|
|
- Christine Hunter
- 5 years ago
- Views:
Transcription
1 THE KNOWLEDGE MANAGEMENT STRATEGY IN ORGANIZATIONS Summer semester, 2016/2017
2 SOCIAL NETWORK ANALYSIS: THEORY AND APPLICATIONS
3 1. A FEW THINGS ABOUT NETWORKS
4 NETWORKS IN THE REAL WORLD There are four categories of networks: social networks, information networks, technological networks, biological networks.
5 SOCIAL NETWORK A social network is a social structure made up of individuals (or organizations) called "nodes", which are tied (connected) by one or more specific types of interdependency, such as: friendship, kindness, common interest, financial exchange, dislike, sexual relationships, relationships of beliefs, knowledge or prestige.
6 STANLEY MILGRAM'S EXPERIMENT Developed out of a desire to learn more about the probability that two randomly selected people would know each other. He asked certain residents of Wichita and Omaha to contact and send a folder to a target person by sending it to an acquaintance, who would then do likewise etc., until the target person in Boston was reached. This experiment allow Milgram to measure how many intermediate nodes would be necessary to link the original sender and the target. 42 of the 160 letters supposedly made it to their target, with a median number of intermediates equal to 5.5. Hence the idea of six degrees of separation was born.
7 SIX DEGREES OF SEPARATION T h e B a c o n n u m b e r The Bacon number of an actor or actress is the number of degrees of separation he or she has from Kevin Bacon, as defined by the game. This is an application of the Erdős Number Project concept to the Hollywood movie industry. The computation of a Bacon number for the actor X is a "shortest path" algorithm: Kevin Bacon has a Bacon number of 0. Those actors who have worked directly with Kevin Bacon have a Bacon number of 1. If the lowest Bacon number of any actor with whom X has appeared in a movie is N, X's Bacon number is N B = 2 B = 1 N = 1 Actor X
8 STRONG AND WEAK TIES According to Mark Granovetter, Weak Ties are the most important source of information that contribute to the promotion of the subject and. In contrast to the weak, the strong and the close interpersonal relationships are the channel of information, the least different from that available to the subject himself. This information begins to be duplicated, which reduces its usefulness.
9 STRENGTH OF WEAK TIES Granovetter interviews 54 people who found their jobs via a social tie.
10
11 2. THE NOTIONS OF SOCIAL NETWORK ANALYSIS
12 SOCIAL NETWORK
13 DIRECTED GRAPH Jim 2 Anne 1 Mary 3 John 4 Adjacency matrix Node
14 UNDIRECTED GRAPH Jane 2 1 and 2 like each other 2, 3 and 4 are relatives Tom 1 Mike 3 1 and 3 are neighbors 1 and 4 are colleagues Sam 4 Adjacency matrix Node
15 ADDING WEIGHTS TO EDGES Girls school dormitory dining-table partners (Moreno, The sociometry reader, 1960): first and second choices shown
16 GRAPH CHARACTERISTICS 1 N Actors {n 1, n 2,, n g } n1 nj - there is a tie between the pair <n1,nj > (n1,nj) - nondirectional relation <n1,nj> - directional relation g*(g-1) - number of ordered pairs <n1,nj> in directional network g*(g-1)/2 - number of ordered pairs (n1,nj) in nondirectional network
17 GRAPH CHARACTERISTICS 2 Measures FROM IMMEDIATE CONNECTION NEIGHBORHOOD IN-DEGREE is the set of nodes that the node is connected to how many directed links are incident on a node OUT-DEGREE how many directed links originate at a node DEGREE (in- and out-) CENTRALITY number of links incident/originate node FROM THE ENTIRE GRAPH betweenness, closeness
18 2.1. DEGREE CENTRALITY
19 NODE DEGREE Adjacency matrix (A) Node OUTDEGREE: Example: out-degree for node 3 is 1, which we obtain by summing the number of non-zero entries in the 3 rd row INDEGREE: Example: the indegree for node 3 is 2, which we obtain by summing the number of non-zero entries in the 3 rd column
20 DEGREE CENTRALITY OF A NODE Standardization of d Oi and d Ii allows to compare nodes from networks with different sizes. Directed graph Undirected graph
21 DEGREE CENTRALIZATION OF A NETWORK Value of a node n i
22 DEGREE CENTRALIZATION Example: financial trading networks High centralization: one node trading with many others Low centralization: trades are more distributed
23 2.2. CLOSENESS CENTRALITY
24 CLOSENESS CENTRALITY The closeness centrality of a node is based on the total distance between one node and all other nodes, where larger distances make lower closeness centrality scores. The closer a node is to all other nodes, the easier information may reach it. Closeness Centrality (Index of expected arrival time) Normalized Closeness Centrality Sum of Geodesic Distances of each node
25 CLOSENESS CENTRALITY OF A NODE Example
26 CLOSENESS CENTRALIZATION OF A NETWORK Value of a node n i
27 C L O S E N E S S C E N T R A L I T Y Application High closeness centrality individuals tend to be important influencers within their local network community. They may often not be public figures to the entire network of a corporation or profession, but they are often respected locally and they occupy short paths for information spread within their network community.
28 2.3. BETWEENNESS CENTRALITY
29 BETWEENNESS CENTRALITY Degree and closeness centrality: How easily can information reach a person? Betweenness centrality and centralization rests on the idea that a person is more central if he or she is more important as an intermediary in the communication network: 1.How crucial is a person to the transmission of information through a network? 2.How many flows of information will be broken if a person stops passing on information or disappears from the network? 3.To what extent may a person control the flow of information due to his/her position in the communication network?
30 BETWEENNESS CENTRALITY A person is more central if he or she is more important as an intermediary in the communication network. How many shortest geodesic links between two actors n j and n k the actor n i contains? (n j n i n k ) g ik - the number of geodesics from n j to n k g jk (n i ) - the number of geodesics that contain point n i as an intermediary in the geodesics from n j to n k, then: is the probability that distinct actor n i involved in communication between two actors n j and n k
31 BETWEENNESS CENTRALITY Usually normalized by: number of pairs of vertices excluding the vertex itself Betweennes Centralization: Value of a node n i
32 BETWEENNESS CENTRALITY K=1 K=2 K=3 J=5 1/1 2/2 1/1 J=6 1/1 2/2 1/1 J=7 2/2 4/4 2/2 J=8 2/2 4/4 2/2 J=9 2/2 4/4 2/2
33 BETWEENESS CENTRALITY Application High betweenness individuals are often critical to collaboration across departments and to maintaining the spread of a new product through an entire network. Because of their locations between network communities, they are natural brokers of information and collaboration.
34 2.4. EIGENVECTOR CENTRALITY
35 EIGENVECTOR CENTRALITY A person s importance is defined by his/her friends importance. More precisely, centrality of a node is proportional to the sum of scores of its neighbors.
36 EIGENVECTOR CENTRALITY Google s Pagerank is a variant of the eigenvector centrality. PageRank is an algorithm used by Google Search to rank websites in their search engine results. Page B Page C Page E
37 SUMMARY
38 M E A S U R E S Conclusion Centrality measure DEGREE CLOSENESS BETWEENNESS Interpretation in social networks How many people can this person reach directly? Who has the shortest distance to the other actors? Who controls knowledge flows?
39 NETWORK QUANTITATIVE CHARACTERISTICS NETWORK Directed / undirected Weighted / not weighted One network EACH NODE Eigenvector Centrality Normalized Networks comparison Eigenvector Number of nodes & edges (size) Degree Centralization Degree, In-degree, Out-degree Normalized degrees Closeness Centralization Closeness Centrality Normalized Closeness Betweenness Centralization Betweenness Centrality Normalized Betweenness
40 ASSIGNMENTS
41 DIFFERENT VISUALIZATION METHODS Analyze two projects describing a network
42 ASSIGNMENT 1 Part 1. Building a network 1. Think of any network You would like to describe. 2. Prepare the data about relationships in this network. 3. Draw the Network, using Gephi. 4. Define: Degree and Weighted Degree measures for each node, Closeness Centrality for each node, Betweenness Centrality for each node, Eigenvector Centrality for each node, Density of the network Modularity of the network (communities inside the network). 5. Make conclusions about relationships in the network.
43 ASSIGNMENT 1 Part 2. Centrality Generally different centrality metrics will be positively correlated When they are not, there is, probably, something interesting about the network Suggest possible node positions to fit each square Low Degree High Degree - Low Closeness High Closeness - Low Betweenness High Betweenness -
44 ASSIGNMENT 1 Example: International Week network
45 ASSIGNMENT 2 Facebook Network 1. Choose an open group/page on Facebook. 2. Find the Netvizz application in Facebook search panel. 3. Choose the group data or page data option (in accordance with the choice in 1). 4. Define the page/group ID. 5. In data to get choose full data. 6. In case of page data analysis, choose posts by page and users option. 7. Download the zip archive. In Gephi, You will use only the GDF file.
46 ASSIGNMENT 2 Facebook Network 1. For the obtained graph define all the possible measures. 2. Identify, which type of post causes the highest engagement? If possible, find out what information does this post contain? 3. Evaluate the general effectiveness of the page?
47
Week 5 Video 5. Relationship Mining Network Analysis
Week 5 Video 5 Relationship Mining Network Analysis Today s Class Network Analysis Network Analysis Analysis of anything that can be seen as connections between nodes Most common social networks Connections
More informationSocial Networks. Slides by : I. Koutsopoulos (AUEB), Source:L. Adamic, SN Analysis, Coursera course
Social Networks Slides by : I. Koutsopoulos (AUEB), Source:L. Adamic, SN Analysis, Coursera course Introduction Political blogs Organizations Facebook networks Ingredient networks SN representation Networks
More informationBasic Network Concepts
Basic Network Concepts Basic Vocabulary Alice Graph Network Edges Links Nodes Vertices Chuck Bob Edges Alice Chuck Bob Edge Weights Alice Chuck Bob Apollo 13 Movie Network Main Actors in Apollo 13 the
More informationCS224W: Analysis of Networks Jure Leskovec, Stanford University
CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 11/13/17 Jure Leskovec, Stanford CS224W: Analysis of Networks, http://cs224w.stanford.edu 2 Observations Models
More informationStructure of Social Networks
Structure of Social Networks Outline Structure of social networks Applications of structural analysis Social *networks* Twitter Facebook Linked-in IMs Email Real life Address books... Who Twitter #numbers
More informationCSE 190 Lecture 16. Data Mining and Predictive Analytics. Small-world phenomena
CSE 190 Lecture 16 Data Mining and Predictive Analytics Small-world phenomena Another famous study Stanley Milgram wanted to test the (already popular) hypothesis that people in social networks are separated
More informationWeb 2.0 Social Data Analysis
Web 2.0 Social Data Analysis Ing. Jaroslav Kuchař jaroslav.kuchar@fit.cvut.cz Structure(1) Czech Technical University in Prague, Faculty of Information Technologies Software and Web Engineering 2 Contents
More informationMath 443/543 Graph Theory Notes 10: Small world phenomenon and decentralized search
Math 443/543 Graph Theory Notes 0: Small world phenomenon and decentralized search David Glickenstein November 0, 008 Small world phenomenon The small world phenomenon is the principle that all people
More informationMathematical Foundations
Mathematical Foundations Steve Borgatti Revised 7/04 in Colchester, U.K. Graphs Networks represented mathematically as graphs A graph G(V,E) consists of Set of nodes vertices V representing actors Set
More informationDetecting and Analyzing Communities in Social Network Graphs for Targeted Marketing
Detecting and Analyzing Communities in Social Network Graphs for Targeted Marketing Gautam Bhat, Rajeev Kumar Singh Department of Computer Science and Engineering Shiv Nadar University Gautam Buddh Nagar,
More informationCSE 158 Lecture 11. Web Mining and Recommender Systems. Triadic closure; strong & weak ties
CSE 158 Lecture 11 Web Mining and Recommender Systems Triadic closure; strong & weak ties Triangles So far we ve seen (a little about) how networks can be characterized by their connectivity patterns What
More informationCSE 255 Lecture 13. Data Mining and Predictive Analytics. Triadic closure; strong & weak ties
CSE 255 Lecture 13 Data Mining and Predictive Analytics Triadic closure; strong & weak ties Monday Random models of networks: Erdos Renyi random graphs (picture from Wikipedia http://en.wikipedia.org/wiki/erd%c5%91s%e2%80%93r%c3%a9nyi_model)
More informationCSE 158 Lecture 13. Web Mining and Recommender Systems. Triadic closure; strong & weak ties
CSE 158 Lecture 13 Web Mining and Recommender Systems Triadic closure; strong & weak ties Monday Random models of networks: Erdos Renyi random graphs (picture from Wikipedia http://en.wikipedia.org/wiki/erd%c5%91s%e2%80%93r%c3%a9nyi_model)
More informationNon Overlapping Communities
Non Overlapping Communities Davide Mottin, Konstantina Lazaridou HassoPlattner Institute Graph Mining course Winter Semester 2016 Acknowledgements Most of this lecture is taken from: http://web.stanford.edu/class/cs224w/slides
More informationL Modelling and Simulating Social Systems with MATLAB
851-0585-04L Modelling and Simulating Social Systems with MATLAB Lesson 6 Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano and S. Wehrli) ETH Zürich 2010-03-29 Lesson 6 Contents History:
More informationCentrality. Peter Hoff. 567 Statistical analysis of social networks. Statistics, University of Washington 1/36
1/36 Centrality 567 Statistical analysis of social networks Peter Hoff Statistics, University of Washington 2/36 Centrality A common goal in SNA is to identify the central nodes of a network. What does
More informationCentrality Book. cohesion.
Cohesion The graph-theoretic terms discussed in the previous chapter have very specific and concrete meanings which are highly shared across the field of graph theory and other fields like social network
More informationThe Basics of Network Structure
The Basics of Network Structure James M. Cook University of Maine at Augusta james.m.cook@maine.edu Keywords Betweenness; Centrality; Closeness; Degree; Density; Diameter; Distance; Clique; Connected Component;
More informationHow to explore big networks? Question: Perform a random walk on G. What is the average node degree among visited nodes, if avg degree in G is 200?
How to explore big networks? Question: Perform a random walk on G. What is the average node degree among visited nodes, if avg degree in G is 200? Questions from last time Avg. FB degree is 200 (suppose).
More informationMath/Stat 2300 Modeling using Graph Theory (March 23/25) from text A First Course in Mathematical Modeling, Giordano, Fox, Horton, Weir, 2009.
Math/Stat 2300 Modeling using Graph Theory (March 23/25) from text A First Course in Mathematical Modeling, Giordano, Fox, Horton, Weir, 2009. Describing Graphs (8.2) A graph is a mathematical way of describing
More informationAlgorithms and Applications in Social Networks. 2017/2018, Semester B Slava Novgorodov
Algorithms and Applications in Social Networks 2017/2018, Semester B Slava Novgorodov 1 Lesson #1 Administrative questions Course overview Introduction to Social Networks Basic definitions Network properties
More information.. Spring 2009 CSC 466: Knowledge Discovery from Data Alexander Dekhtyar..
.. Spring 2009 CSC 466: Knowledge Discovery from Data Alexander Dekhtyar.. Link Analysis in Graphs: PageRank Link Analysis Graphs Recall definitions from Discrete math and graph theory. Graph. A graph
More informationUnit 2: Graphs and Matrices. ICPSR University of Michigan, Ann Arbor Summer 2015 Instructor: Ann McCranie
Unit 2: Graphs and Matrices ICPSR University of Michigan, Ann Arbor Summer 2015 Instructor: Ann McCranie Four main ways to notate a social network There are a variety of ways to mathematize a social network,
More informationNetwork Mathematics - Why is it a Small World? Oskar Sandberg
Network Mathematics - Why is it a Small World? Oskar Sandberg 1 Networks Formally, a network is a collection of points and connections between them. 2 Networks Formally, a network is a collection of points
More informationAlessandro Del Ponte, Weijia Ran PAD 637 Week 3 Summary January 31, Wasserman and Faust, Chapter 3: Notation for Social Network Data
Wasserman and Faust, Chapter 3: Notation for Social Network Data Three different network notational schemes Graph theoretic: the most useful for centrality and prestige methods, cohesive subgroup ideas,
More informationAlgorithmic and Economic Aspects of Networks. Nicole Immorlica
Algorithmic and Economic Aspects of Networks Nicole Immorlica Syllabus 1. Jan. 8 th (today): Graph theory, network structure 2. Jan. 15 th : Random graphs, probabilistic network formation 3. Jan. 20 th
More informationExample 1: An algorithmic view of the small world phenomenon
Lecture Notes: Social Networks: Models, Algorithms, and Applications Lecture 1: Jan 17, 2012 Scribes: Preethi Ambati and Azar Aliyev Example 1: An algorithmic view of the small world phenomenon The story
More informationNetwork Basics. CMSC 498J: Social Media Computing. Department of Computer Science University of Maryland Spring Hadi Amiri
Network Basics CMSC 498J: Social Media Computing Department of Computer Science University of Maryland Spring 2016 Hadi Amiri hadi@umd.edu Lecture Topics Graphs as Models of Networks Graph Theory Nodes,
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 a
More informationIntroduction To Graphs and Networks. Fall 2013 Carola Wenk
Introduction To Graphs and Networks Fall 203 Carola Wenk On the Internet, links are essentially weighted by factors such as transit time, or cost. The goal is to find the shortest path from one node to
More informationSocial Networks, Social Interaction, and Outcomes
Social Networks, Social Interaction, and Outcomes Social Networks and Social Interaction Not all links are created equal: Some links are stronger than others Some links are more useful than others Links
More informationModeling and Simulating Social Systems with MATLAB
Modeling and Simulating Social Systems with MATLAB Lecture 8 Introduction to Graphs/Networks Olivia Woolley, Stefano Balietti, Lloyd Sanders, Dirk Helbing Chair of Sociology, in particular of Modeling
More informationThe Network Analysis Five-Number Summary
Chapter 2 The Network Analysis Five-Number Summary There is nothing like looking, if you want to find something. You certainly usually find something, if you look, but it is not always quite the something
More informationComplex-Network Modelling and Inference
Complex-Network Modelling and Inference Lecture 8: Graph features (2) Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/notes/ Network_Modelling/ School
More informationCentralities (4) By: Ralucca Gera, NPS. Excellence Through Knowledge
Centralities (4) By: Ralucca Gera, NPS Excellence Through Knowledge Some slide from last week that we didn t talk about in class: 2 PageRank algorithm Eigenvector centrality: i s Rank score is the sum
More informationChapter 1. Social Media and Social Computing. October 2012 Youn-Hee Han
Chapter 1. Social Media and Social Computing October 2012 Youn-Hee Han http://link.koreatech.ac.kr 1.1 Social Media A rapid development and change of the Web and the Internet Participatory web application
More informationSocial Network Analysis With igraph & R. Ofrit Lesser December 11 th, 2014
Social Network Analysis With igraph & R Ofrit Lesser ofrit.lesser@gmail.com December 11 th, 2014 Outline The igraph R package Basic graph concepts What can you do with igraph? Construction Attributes Centrality
More informationTie strength, social capital, betweenness and homophily. Rik Sarkar
Tie strength, social capital, betweenness and homophily Rik Sarkar Networks Position of a node in a network determines its role/importance Structure of a network determines its properties 2 Today Notion
More informationTELCOM2125: Network Science and Analysis
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2015 Figures are taken from: M.E.J. Newman, Networks: An Introduction 2
More information1 Homophily and assortative mixing
1 Homophily and assortative mixing Networks, and particularly social networks, often exhibit a property called homophily or assortative mixing, which simply means that the attributes of vertices correlate
More informationGraphs: A graph is a data structure that has two types of elements, vertices and edges.
Graphs: A graph is a data structure that has two types of elements, vertices and edges. An edge is a connection between two vetices If the connection is symmetric (in other words A is connected to B B
More informationAn Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization
An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization Pedro Ribeiro (DCC/FCUP & CRACS/INESC-TEC) Part 1 Motivation and emergence of Network Science
More informationSmallBlue: Unlock Collective Intelligence from Information Flows in Social Networks
SmallBlue: Unlock Collective Intelligence from Information Flows in Social Networks Dashun Wang Northeastern University 110 Forsyth Street, Boston, MA 02115 Zhen Wen, Ching-Yung Lin IBM T. J. Watson Research
More informationEconomics of Information Networks
Economics of Information Networks Stephen Turnbull Division of Policy and Planning Sciences Lecture 4: December 7, 2017 Abstract We continue discussion of the modern economics of networks, which considers
More informationSocial Networks Measures. Single- node Measures: Based on some proper7es of specific nodes Graph- based measures: Based on the graph- structure
Social Networks Measures Single- node Measures: Based on some proper7es of specific nodes Graph- based measures: Based on the graph- structure of the network Graph- based measures of social influence Previously
More informationGraph Theory for Network Science
Graph Theory for Network Science Dr. Natarajan Meghanathan Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Networks or Graphs We typically
More informationGraph and Link Mining
Graph and Link Mining Graphs - Basics A graph is a powerful abstraction for modeling entities and their pairwise relationships. G = (V,E) Set of nodes V = v,, v 5 Set of edges E = { v, v 2, v 4, v 5 }
More informationGraph Theory. Network Science: Graph theory. Graph theory Terminology and notation. Graph theory Graph visualization
Network Science: Graph Theory Ozalp abaoglu ipartimento di Informatica Scienza e Ingegneria Università di ologna www.cs.unibo.it/babaoglu/ ranch of mathematics for the study of structures called graphs
More informationCS 124/LINGUIST 180 From Languages to Information. Social Networks: Small Worlds, Weak Ties, and Power Laws. Dan Jurafsky Stanford University
CS 124/LINGUIST 180 From Languages to Information Dan Jurafsky Stanford University Social Networks: Small Worlds, Weak Ties, and Power Laws Slides from Jure Leskovec, Lada Adamic, James Moody, Bing Liu,
More informationClusters and Communities
Clusters and Communities Lecture 7 CSCI 4974/6971 22 Sep 2016 1 / 14 Today s Biz 1. Reminders 2. Review 3. Communities 4. Betweenness and Graph Partitioning 5. Label Propagation 2 / 14 Today s Biz 1. Reminders
More informationSmall-world networks
Small-world networks c A. J. Ganesh, University of Bristol, 2015 Popular folklore asserts that any two people in the world are linked through a chain of no more than six mutual acquaintances, as encapsulated
More informationNetworks and Discrete Mathematics
Aristotle University, School of Mathematics Master in Web Science Networks and Discrete Mathematics Small Words-Scale-Free- Model Chronis Moyssiadis Vassilis Karagiannis 7/12/2012 WS.04 Webscience: lecture
More informationNetworks in economics and finance. Lecture 1 - Measuring networks
Networks in economics and finance Lecture 1 - Measuring networks What are networks and why study them? A network is a set of items (nodes) connected by edges or links. Units (nodes) Individuals Firms Banks
More informationUsing! to Teach Graph Theory
!! Using! to Teach Graph Theory Todd Abel Mary Elizabeth Searcy Appalachian State University Why Graph Theory? Mathematical Thinking (Habits of Mind, Mathematical Practices) Accessible to students at a
More informationQuick Review of Graphs
COMP 102: Excursions in Computer Science Lecture 11: Graphs Instructor: (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/comp102 Quick Review of Graphs A graph is an abstract representation
More informationIntroduction to network metrics
Universitat Politècnica de Catalunya Version 0.5 Complex and Social Networks (2018-2019) Master in Innovation and Research in Informatics (MIRI) Instructors Argimiro Arratia, argimiro@cs.upc.edu, http://www.cs.upc.edu/~argimiro/
More information6. Overview. L3S Research Center, University of Hannover. 6.1 Section Motivation. Investigation of structural aspects of peer-to-peer networks
, University of Hannover Random Graphs, Small-Worlds, and Scale-Free Networks Wolf-Tilo Balke and Wolf Siberski 05.12.07 * Original slides provided by K.A. Lehmann (University Tübingen, Germany) 6. Overview
More informationMathematics of Networks II
Mathematics of Networks II 26.10.2016 1 / 30 Definition of a network Our definition (Newman): A network (graph) is a collection of vertices (nodes) joined by edges (links). More precise definition (Bollobàs):
More informationSome Graph Theory for Network Analysis. CS 249B: Science of Networks Week 01: Thursday, 01/31/08 Daniel Bilar Wellesley College Spring 2008
Some Graph Theory for Network Analysis CS 9B: Science of Networks Week 0: Thursday, 0//08 Daniel Bilar Wellesley College Spring 008 Goals this lecture Introduce you to some jargon what we call things in
More informationLecture 9: I: Web Retrieval II: Webology. Johan Bollen Old Dominion University Department of Computer Science
Lecture 9: I: Web Retrieval II: Webology Johan Bollen Old Dominion University Department of Computer Science jbollen@cs.odu.edu http://www.cs.odu.edu/ jbollen April 10, 2003 Page 1 WWW retrieval Two approaches
More informationCIP- OSN Online Social Networks as Graphs. Dr. Thanassis Tiropanis -
CIP- OSN Online Social Networks as Graphs Dr. Thanassis Tiropanis - tt2@ecs http://vimeo.com/58729247 http://socialnetworks.soton.ac.uk The narra9ve Web Evolu9on and Online Social Networks Web Evolu9on
More informationSLANG Session 4. Jason Quinley Roland Mühlenbernd Seminar für Sprachwissenschaft University of Tübingen
SLANG Session 4 Jason Quinley Roland Mühlenbernd Seminar für Sprachwissenschaft University of Tübingen Overview Network properties Degree Density and Distribution Clustering and Connections Network formation
More information1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G))
10 Graphs 10.1 Graphs and Graph Models 1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G)) 2. an edge is present, say e = {u,
More informationTELCOM2125: Network Science and Analysis
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2015 Figures are taken from: M.E.J. Newman, Networks: An Introduction 2
More informationGEPHI Introduction to network analysis and visualization
GEPHI Introduction to network analysis and visualization GRANDJEAN, Martin (2015) «GEPHI Introduction to network analysis and visualization», http://www.martingrandjean.ch/gephi-introduction 15 minutes
More informationCSE 258 Lecture 12. Web Mining and Recommender Systems. Social networks
CSE 258 Lecture 12 Web Mining and Recommender Systems Social networks Social networks We ve already seen networks (a little bit) in week 3 i.e., we ve studied inference problems defined on graphs, and
More informationMidterm Review NETS 112
Midterm Review NETS 112 Part 1: Network Structure Is this a network? A B C D Part 1: Network Structure Is this a network? A B C D Yes -- G = (V, E), one or both can be empty Part 1: Network Structure What
More informationNetwork Thinking. Complexity: A Guided Tour, Chapters 15-16
Network Thinking Complexity: A Guided Tour, Chapters 15-16 Neural Network (C. Elegans) http://gephi.org/wp-content/uploads/2008/12/screenshot-celegans.png Food Web http://1.bp.blogspot.com/_vifbm3t8bou/sbhzqbchiei/aaaaaaaaaxk/rsc-pj45avc/
More informationPeer-to-Peer Data Management
Peer-to-Peer Data Management Wolf-Tilo Balke Sascha Tönnies Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 10. Networkmodels 1. Introduction Motivation
More informationRobustness of Centrality Measures for Small-World Networks Containing Systematic Error
Robustness of Centrality Measures for Small-World Networks Containing Systematic Error Amanda Lannie Analytical Systems Branch, Air Force Research Laboratory, NY, USA Abstract Social network analysis is
More informationSocial, Information, and Routing Networks: Models, Algorithms, and Strategic Behavior
Social, Information, and Routing Networks: Models, Algorithms, and Strategic Behavior Who? Prof. Aris Anagnostopoulos Prof. Luciana S. Buriol Prof. Guido Schäfer What will We Cover? Topics: Network properties
More informationCSE 158 Lecture 11. Web Mining and Recommender Systems. Social networks
CSE 158 Lecture 11 Web Mining and Recommender Systems Social networks Assignment 1 Due 5pm next Monday! (Kaggle shows UTC time, but the due date is 5pm, Monday, PST) Assignment 1 Assignment 1 Social networks
More informationIntroduction to Networks and Business Intelligence
Introduction to Networks and Business Intelligence Prof. Dr. Daning Hu Department of Informatics University of Zurich Sep 16th, 2014 Outline n Network Science A Random History n Network Analysis Network
More informationIntroduction to Machine Learning
Introduction to Machine Learning Clustering Varun Chandola Computer Science & Engineering State University of New York at Buffalo Buffalo, NY, USA chandola@buffalo.edu Chandola@UB CSE 474/574 1 / 19 Outline
More informationSocial Network Analysis
Social Network Analysis Extracção de Conhecimento de Dados II Márcia Oliveira marcia@liaad.up.pt João Gama jgama@fep.up.pt Outline PART I 1. Background 2. Practical applications 3. Graph Theory: 1. Types
More informationExtracting Information from Complex Networks
Extracting Information from Complex Networks 1 Complex Networks Networks that arise from modeling complex systems: relationships Social networks Biological networks Distinguish from random networks uniform
More informationSI Networks: Theory and Application, Fall 2008
University of Michigan Deep Blue deepblue.lib.umich.edu 2008-09 SI 508 - Networks: Theory and Application, Fall 2008 Adamic, Lada Adamic, L. (2008, November 12). Networks: Theory and Application. Retrieved
More informationIntroduction to Engineering Systems, ESD.00. Networks. Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow
Introduction to Engineering Systems, ESD.00 Lecture 7 Networks Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow The Bridges of Königsberg The town of Konigsberg in 18 th century
More informationBiological Networks Analysis
Biological Networks Analysis Introduction and Dijkstra s algorithm Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein The clustering problem: partition genes into distinct
More informationMIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns
MIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns This is a closed-book exam. You should have no material on your desk other than the exam itself and a pencil or pen.
More informationCAPACITY BUILDING WORKSHOP ON ACTORS AND SOCIAL NETWORK ANALYSES (Jena, Germany, 5-6 July 2006)
CAPACITY BUILDING WORKSHOP ON ACTORS AND SOCIAL NETWORK ANALYSES (Jena, Germany, 5-6 July 2006) NetSyMoD Network Analysis Creative System Modelling Decision Support Step I Actor Analysis 3. Analysing Network
More informationSocial Network Analysis (SNA) including a tutorial on concepts and methods
Social Network Analysis (SNA) including a tutorial on concepts and methods Social Media Dr. Giorgos Cheliotis (gcheliotis@nus.edu.sg) Communications and New Media, National University of Singapore Source
More informationLink Analysis and Web Search
Link Analysis and Web Search Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna http://www.moreno.marzolla.name/ based on material by prof. Bing Liu http://www.cs.uic.edu/~liub/webminingbook.html
More informationParty hard! The maths of connections. Colva Roney-Dougal. March 23rd, University of St Andrews
The maths of connections University of St Andrews March 23rd, 2013 Connection 1: Friendship The party problem Question How many people need to come to a party, to guarantee that at least three of them
More informationMining Social Network Graphs
Mining Social Network Graphs Analysis of Large Graphs: Community Detection Rafael Ferreira da Silva rafsilva@isi.edu http://rafaelsilva.com Note to other teachers and users of these slides: We would be
More informationLesson 18. Laura Ricci 08/05/2017
Lesson 18 WATTS STROGATZ AND KLEINBERG MODELS 08/05/2017 1 SMALL WORLD NETWORKS Many real networks are characterized by a diameter very low. In several social networks, individuals tend to group in clusters
More informationPaths, Circuits, and Connected Graphs
Paths, Circuits, and Connected Graphs Paths and Circuits Definition: Let G = (V, E) be an undirected graph, vertices u, v V A path of length n from u to v is a sequence of edges e i = {u i 1, u i} E for
More information2.2. Data Format Save as UCINET files in Netdraw Import from VNA format Node Level Analysis Degree...
Contents 0. Processing the Tie Data and Create a VNA File for Binary Network... 2 1. Appearance of UCINET... 4 2. UCINET dataset... 5 2.1 Set Default Folder... 5 2.2. Data Format... 5 2.3 Save as UCINET
More informationCollaborative filtering based on a random walk model on a graph
Collaborative filtering based on a random walk model on a graph Marco Saerens, Francois Fouss, Alain Pirotte, Luh Yen, Pierre Dupont (UCL) Jean-Michel Renders (Xerox Research Europe) Some recent methods:
More informationCase Studies in Complex Networks
Case Studies in Complex Networks Introduction to Scientific Modeling CS 365 George Bezerra 08/27/2012 The origin of graph theory Königsberg bridge problem Leonard Euler (1707-1783) The Königsberg Bridge
More informationCopyright 2000, Kevin Wayne 1
Chapter 3 - Graphs Undirected Graphs Undirected graph. G = (V, E) V = nodes. E = edges between pairs of nodes. Captures pairwise relationship between objects. Graph size parameters: n = V, m = E. Directed
More informationEcon 430 Lecture 3: Significance and Structural Properties of N
Econ 430 Lecture 3: Significance and Structural Properties of Networks Alper Duman Izmir University Economics, March 8, 2013 Prevalence of Networks Networks are everywhere! Even in this class. We can classify
More informationGraph Theory for Network Science
Graph Theory for Network Science Dr. Natarajan Meghanathan Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Networks or Graphs We typically
More informationSocial Network Analysis
Chirayu Wongchokprasitti, PhD University of Pittsburgh Center for Causal Discovery Department of Biomedical Informatics chw20@pitt.edu http://www.pitt.edu/~chw20 Overview Centrality Analysis techniques
More informationAnalysis of Biological Networks. 1. Clustering 2. Random Walks 3. Finding paths
Analysis of Biological Networks 1. Clustering 2. Random Walks 3. Finding paths Problem 1: Graph Clustering Finding dense subgraphs Applications Identification of novel pathways, complexes, other modules?
More informationLink Analysis from Bing Liu. Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data, Springer and other material.
Link Analysis from Bing Liu. Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data, Springer and other material. 1 Contents Introduction Network properties Social network analysis Co-citation
More information1 Starting around 1996, researchers began to work on. 2 In Feb, 1997, Yanhong Li (Scotch Plains, NJ) filed a
!"#$ %#& ' Introduction ' Social network analysis ' Co-citation and bibliographic coupling ' PageRank ' HIS ' Summary ()*+,-/*,) Early search engines mainly compare content similarity of the query and
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/4/2011 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu
More informationWeb Structure Mining Community Detection and Evaluation
Web Structure Mining Community Detection and Evaluation 1 Community Community. It is formed by individuals such that those within a group interact with each other more frequently than with those outside
More informationCENTRALITIES. Carlo PICCARDI. DEIB - Department of Electronics, Information and Bioengineering Politecnico di Milano, Italy
CENTRALITIES Carlo PICCARDI DEIB - Department of Electronics, Information and Bioengineering Politecnico di Milano, Italy email carlo.piccardi@polimi.it http://home.deib.polimi.it/piccardi Carlo Piccardi
More information