Local Clustering Coefficient

Slides:



Advertisements
Similar presentations
Relatively HIGH Clustering Coefficient Relatively LOW Characteristic Path Length.
Advertisements

Coloring Warm-Up. A graph is 2-colorable iff it has no odd length cycles 1: If G has an odd-length cycle then G is not 2- colorable Proof: Let v 0, …,
Complex Networks Luis Miguel Varela COST meeting, Lisbon March 27 th 2013.
Graphs: basic definitions and notation Definition A (undirected, unweighted) graph is a pair G = (V, E), where V = {v 1, v 2,..., v n } is a set of vertices,
Small-world networks.
Collective Dynamics of ‘Small World’ Networks C+ Elegans: Ilhan Savut, Spencer Telford, Melody Lim 29/10/13.
The Grammar According to West By D.B. West. 5. Expressions as units. There exists i < j with x i = x j. ( Double-Duty Definition of i, not OK ) There.
CS 253: Algorithms Chapter 22 Graphs Credit: Dr. George Bebis.
 Graph Graph  Types of Graphs Types of Graphs  Data Structures to Store Graphs Data Structures to Store Graphs  Graph Definitions Graph Definitions.
Friendly Partitions of Graphs Jenna Huston Advised by Dr. David Offner.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.
Search in a Small World JIN Xiaolong Based on [1].
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
Connectivity and the Small World Overview Background: de Pool and Kochen: Random & Biased networks Rapoport’s work on diffusion Travers and Milgram Argument.
Random Graph Models of Social Networks Paper Authors: M.E. Newman, D.J. Watts, S.H. Strogatz Presentation presented by Jessie Riposo.
Author: M.E.J. Newman Presenter: Guoliang Liu Date:5/4/2012.
Section 8 – Ec1818 Jeremy Barofsky March 31 st and April 1 st, 2010.
Network properties Slides are modified from Networks: Theory and Application by Lada Adamic.
Connectivity and the Small World Overview Background: de Pool and Kochen: Random & Biased networks Rapoport’s work on diffusion Travers and Milgram Argument.
Warm-up 1) Find the measure of angles a, b and c. 2) Find the slope between the points (-2, 8) and (14, 40)
1-1a Slide 1 of 2 (over Lesson 3-3). 1-1b Slide 1 of 2 (over Lesson 3-3)
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
aka “Undirected Graphs”
Topology and Evolution of the Open Source Software Community Advisors: Dr. Vincent W. Freeh Dr. Kevin Bowyer Supported in part by the National Science.
Lecture 13: Network centrality Slides are modified from Lada Adamic.
1.4 Pairs of Angles Adjacent angles- two angles with a common vertex and common side. (Side by side) Linear pair- a pair of adjacent angles that make a.
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
1-3 Pairs of Angles.
Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Special Angle Pairs. Definitions Adjacent Angles: Angles that have a common ray or side and a common vertex, but points inside either one of the angles.
Project 1 : Phase 1 22C:021 CS II Data Structures.
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.
Finding The Slope of a Line Slopes are commonly associated with mountains.
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Find the Inverse and Graph the Functions
Network analysis.
Network Science: A Short Introduction i3 Workshop
Section 8.6 of Newman’s book: Clustering Coefficients
The Watts-Strogatz model
Can you draw this picture without lifting up your pen/pencil?
Section 8.2: Shortest path and small world effect
Shortest path and small world effect
and 2 units to the left of point B. Count down 5 units from point B
Arealization and Memory in the Cortex
Algebra 1 Section 8.4.
Department of Computer Science University of York
Connectivity Section 10.4.
Walks, Paths, and Circuits
Clustering Coefficients
Graph Theory By Amy C. and John M..
A graphing calculator is required for some problems or parts of problems 2000.
of Linear Inequalities
A _________________ is a ratio that compares the amount of change in a dependent variable to the amount of change in an independent variable. Rate of Change.
Lecture 9: Network models CS 765: Complex Networks
Hamiltonian Cycles.
DiGraph Definitions Adjacency Matrix Adjacency List
Graphs G = (V, E) V are the vertices; E are the edges.
Practical Applications Using igraph in R Roger Stanton
Algorithms Lecture # 27 Dr. Sohail Aslam.
Warm Up – Tuesday Find the critical times for each vertex.
Graphs, Paths, and Circuits
Graph Vocabulary.
Other Random Graph Models
Ellipse.
Presentation transcript:

Local Clustering Coefficient Clustering coefficient for a specific vertex, C(i) Mean probability that a pair of i’s friends are friends of one another Average local clustering coefficient over all vertices This definition (by Watts and Strogatz) came before Global Clustering Coefficient definition Slide courtesy of Dr. Tim Chung

Global Clustering Coefficient Fraction of the paths of length two in the graph that are closed A “closed triad” is a closed path of length three through vertices i, j, and k Calculation Count all paths of length two, count how many of these are closed, and take their ratio i j k closed triad Probability that two vertices with a common adjacent vertex are themselves adjacent Slide courtesy of Dr. Tim Chung