Centrality Measures These measure a nodes importance or prominence in the network. The more central a node is in a network the more significant it is to.

Slides:



Advertisements
Similar presentations
Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale Network Theory: Computational Phenomena and Processes Social Network.
Advertisements

Graph Theory Arnold Mesa. Basic Concepts n A graph G = (V,E) is defined by a set of vertices and edges v3 v1 v2Vertex (v1) Edge (e1) A Graph with 3 vertices.
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.
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Discrete Math for Computer Science. Mathematical Model Real-world Problem Computerized Solution Abstract Model Transformed Model picture of the real worldpicture.
Introduction to Network Theory: Modern Concepts, Algorithms
It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
 Graph Graph  Types of Graphs Types of Graphs  Data Structures to Store Graphs Data Structures to Store Graphs  Graph Definitions Graph Definitions.
V4 Matrix algorithms and graph partitioning
Mining and Searching Massive Graphs (Networks)
Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.
Centrality and Prestige HCC Spring 2005 Wednesday, April 13, 2005 Aliseya Wright.
Segmentation Graph-Theoretic Clustering.
Representing Graphs Wade Trappe. Lecture Overview Introduction Some Terminology –Paths Adjacency Matrix.
A measure of betweenness centrality based on random walks Author: M. E. J. Newman Presented by: Amruta Hingane Department of Computer Science Kent State.
Group work Show that the Sx, Sy and Sz matrices can be written as a linear combination of projection operators. (Projection operators are outer products.
Tirgul 13. Unweighted Graphs Wishful Thinking – you decide to go to work on your sun-tan in ‘ Hatzuk ’ beach in Tel-Aviv. Therefore, you take your swimming.
How is this going to make us 100K Applications of Graph Theory.
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
1 Entropy Waves, The Zigzag Graph Product, and New Constant-Degree Expanders Omer Reingold Salil Vadhan Avi Wigderson Lecturer: Oded Levy.
REVIEW OF MATHEMATICS. Review of Vectors Analysis GivenMagnitude of vector: Example: Dot product:  is the angle between the two vectors. Example:
Dijkstra’s Algorithm. 2 Shortest-path Suppose we want to find the shortest path from node X to node Y It turns out that, in order to do this, we need.
Presentation: Random Walk Betweenness, J. Govorčin Laboratory for Data Technologies, Faculty of Information Studies, Novo mesto – September 22, 2011 Random.
Social Network Analysis: A Non- Technical Introduction José Luis Molina Universitat Autònoma de Barcelona
Network properties Slides are modified from Networks: Theory and Application by Lada Adamic.
Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we can find a path that goes over all.
Graph Algorithms. Definitions and Representation An undirected graph G is a pair (V,E), where V is a finite set of points called vertices and E is a finite.
Lectures 6 & 7 Centrality Measures Lectures 6 & 7 Centrality Measures February 2, 2009 Monojit Choudhury
Lecture7 Topic1: Graph spectral analysis/Graph spectral clustering and its application to metabolic networks Topic 2: Different centrality measures of.
Vertices and Edges Introduction to Graphs and Networks Mills College Spring 2012.
Lecture 5: Mathematics of Networks (Cont) CS 790g: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Lecture 13: Network centrality Slides are modified from Lada Adamic.
Vector Norms and the related Matrix Norms. Properties of a Vector Norm: Euclidean Vector Norm: Riemannian metric:
L – Modelling and Simulating Social Systems with MATLAB Lesson 6 – Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano.
Slides are modified from Lada Adamic
Lecture 3 1.Different centrality measures of nodes 2.Hierarchical Clustering 3.Line graphs.
Linear Algebra Diyako Ghaderyan 1 Contents:  Linear Equations in Linear Algebra  Matrix Algebra  Determinants  Vector Spaces  Eigenvalues.
Linear Algebra Diyako Ghaderyan 1 Contents:  Linear Equations in Linear Algebra  Matrix Algebra  Determinants  Vector Spaces  Eigenvalues.
5.1 Eigenvectors and Eigenvalues 5. Eigenvalues and Eigenvectors.
CS 590 Term Project Epidemic model on Facebook
Selected Topics in Data Networking Explore Social Networks: Center and Periphery.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Informatics tools in network science
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Importance Measures on Nodes Lecture 2 Srinivasan Parthasarathy 1.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
1 Entropy Waves, The Zigzag Graph Product, and New Constant-Degree Expanders Omer Reingold Salil Vadhan Avi Wigderson Lecturer: Oded Levy.
networks and the spread of computer viruses Authors:M. E. J. Newman, S. Forrest, and J. Balthrop. Published:September 10, Physical Review.
Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Lecture 16: Image alignment
Spectral Methods for Dimensionality
Random Walk for Similarity Testing in Complex Networks
Department of Computer and IT Engineering University of Kurdistan
Graph theory Definitions Trees, cycles, directed graphs.
Network analysis.
Degree and Eigenvector Centrality
Network Science: A Short Introduction i3 Workshop
Section 7.12: Similarity By: Ralucca Gera, NPS.
Centrality in Social Networks
Graph Algorithm.
Segmentation Graph-Theoretic Clustering.
Centralities (4) Ralucca Gera,
Graph Operations And Representation
Walks, Paths, and Circuits
Graph Theory By Amy C. and John M..
3.3 Network-Centric Community Detection
Route Inspection Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we introduce a vertex.
Graphs G = (V, E) V are the vertices; E are the edges.
Presentation transcript:

Centrality Measures These measure a nodes importance or prominence in the network. The more central a node is in a network the more significant it is to aid in the spread of infection. Walk: A walk is a sequence of nodes connected by edges. Path: A path is a walk with no repeated nodes. Geodesic: This is the shortest path between two nodes. Distance: This is the length of the shortest path between two nodes.

Degree: The degree of a vertex is the number of other vertices to which it is attached. Normalized Degree (nDegree): Is the degree divided by the maximum possible degree expressed as a percentage. Degree nDegree Farness: This is the sum of the lengths of the geodesics to every other node. (i.e. the sum of the distances to every other every other node). Closeness: The reciprocal of farness is closeness. Normalized Closeness (nCloseness): Is the closeness divided by the minimum possible farness expressed as a percentage. nCloseness

Eigenvector: The equation Mx = x can be viewed as a linear transformation that maps a given vector x into a new vector x, where M is the adjacency matrix. The nonzero solutions of the equation that are obtained by using a value of (known as an eigenvalue) are called the eigenvectors corresponding to that eigenvalue. Normalized Eigenvector (nEigenvector): This is the eigenvector divided by the maximum difference possible expressed as a percentage. Betweenness: This is a measure of the number of times a node occurs on a geodesic. So, to have a large betweenness centrality, the node must be between many of the nodes via their geodesics. Normalized Betweenness (nBetweenness): Is the betweenness divided by the maximum possible betweenness expressed as a percentage. nBetweenness nEigenvector

Correlation A high correlation tells us there may be an easier way of measuring the centalities on a larger scale project. For instance, measuring the degree of a farm by observing that farm is much easier than measuring its betweenness or closeness, as we would then have to observe the entire network of farms. So, if measuring degree means we can make assumptions about the values of another centrality then this saves us measuring both centralities. This is providing that we are not essentially measuring the same thing which would inevitably give a high correlation. AssortativeRandom 1Random 2Random 3Scale-Free nDegree v nCloseness nDegree v nBetweenness nDegree v nEigenvector nCloseness v nBetweenness nCloseness v nEigenvector nBetweenness v nEigenvector

Random

Scale-free

Assortative

Lattice