Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS240A: Classes of Graphs and Their Properties slides under construction – see the Matlab transcript for what I actually did in class.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "CS240A: Classes of Graphs and Their Properties slides under construction – see the Matlab transcript for what I actually did in class."— Presentation transcript:

1 CS240A: Classes of Graphs and Their Properties slides under construction – see the Matlab transcript for what I actually did in class

2 Some graph statistics (and Matlab tools) Vertex degree histogram: dhist.m Avg shortest path length or BFS level profile: bfslevels.m Clustering coefficient: ccoeff.m c = 3*(# triangles) / (# connected triples) Laplacian eigenvalues (and vectors): meshpart toolbox Separator size: meshpart toolbox Fill (chordal completion size): analyze.m and amd.m

3 Some classes of graphs Graphs observed in the wild (see Florida collection for many examples) : Finite element meshes: CGmats.m Circuit simulation graphs: circuit_3.mat Relationship networks: coAuthorsDBLP.mat, PGPgiantcompo.mat … many others! Classifications of graphs: Power-law graphs Small-world graphs Planar graphs Overlap graphs Generators for classes of graphs: Erdos-Renyi (flat) random graphs: sprandsym.m RMAT random graph generator: rmat.m 2-D and 3-D mesh generators: grid5.m etc. in meshpart toolbox

4 RMAT Approximate Power-Law Graph

5 Strongly Connected Components

Download ppt "CS240A: Classes of Graphs and Their Properties slides under construction – see the Matlab transcript for what I actually did in class."

Similar presentations

Complex Networks Luis Miguel Varela COST meeting, Lisbon March 27 th 2013.

Complex Networks Luis Miguel Varela COST meeting, Lisbon March 27 th 2013.
Collective Dynamics of ‘Small World’ Networks C+ Elegans: Ilhan Savut, Spencer Telford, Melody Lim 29/10/13.

Collective Dynamics of ‘Small World’ Networks C+ Elegans: Ilhan Savut, Spencer Telford, Melody Lim 29/10/13.
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.

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.
Network Properties 1.Global Network Properties ( Chapter 3 of the course textbook “Analysis of Biological Networks” by Junker and Schreiber) 1)Degree distribution.

Network Properties 1.Global Network Properties ( Chapter 3 of the course textbook “Analysis of Biological Networks” by Junker and Schreiber) 1)Degree distribution.
Visualisation of head.txt. Data capture Data for the head figure was captured by a laser scanner. The object is mounted on a turntable, and illuminated.

Visualisation of head.txt. Data capture Data for the head figure was captured by a laser scanner. The object is mounted on a turntable, and illuminated.
LYRIC-BASED ARTIST NETWORK METHODOLOGY Derek Gossi CS 765 Fall 2014.

LYRIC-BASED ARTIST NETWORK METHODOLOGY Derek Gossi CS 765 Fall 2014.
Advanced Topics in Data Mining Special focus: Social Networks.

Advanced Topics in Data Mining Special focus: Social Networks.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.

1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.

Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.

Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Network Models Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Models Why should I use network models? In may 2011, Facebook.

Network Models Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Models Why should I use network models? In may 2011, Facebook.
Mining and Searching Massive Graphs (Networks)

Mining and Searching Massive Graphs (Networks)
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.

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.
UNDERSTANDING VISIBLE AND LATENT INTERACTIONS IN ONLINE SOCIAL NETWORK Presented by: Nisha Ranga Under guidance of : Prof. Augustin Chaintreau.

UNDERSTANDING VISIBLE AND LATENT INTERACTIONS IN ONLINE SOCIAL NETWORK Presented by: Nisha Ranga Under guidance of : Prof. Augustin Chaintreau.
Spectral Clustering Scatter plot of a 2D data set K-means ClusteringSpectral Clustering U. von Luxburg. A tutorial on spectral clustering. Technical report,

Spectral Clustering Scatter plot of a 2D data set K-means ClusteringSpectral Clustering U. von Luxburg. A tutorial on spectral clustering. Technical report,
Network Statistics Gesine Reinert. Yeast protein interactions.

Network Statistics Gesine Reinert. Yeast protein interactions.
CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.

CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.
Common Properties of Real Networks. Erdős-Rényi Random Graphs.

Common Properties of Real Networks. Erdős-Rényi Random Graphs.
Advanced Topics in Data Mining Special focus: Social Networks.

Advanced Topics in Data Mining Special focus: Social Networks.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006

1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006

Similar presentations

Ads by Google