Graph spectral analysis/

Slides:



Advertisements
Similar presentations
Chapter 8 Topics in Graph Theory
Advertisements

Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale Network Theory: Computational Phenomena and Processes Social Network.
Chapter 28 – Part II Matrix Operations. Gaussian elimination Gaussian elimination LU factorization LU factorization Gaussian elimination with partial.
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Chapter 6 Eigenvalues and Eigenvectors
CHRISTOPHER M. P. TOMASZEWSKI 30 JULY MMIX A Spectral Analysis of Cyclic and Elementary Abelian Subgroup Lattices.
Introduction to Network Theory: Modern Concepts, Algorithms
Modularity and community structure in networks
Clustering II CMPUT 466/551 Nilanjan Ray. Mean-shift Clustering Will show slides from:
GOLOMB RULERS AND GRACEFUL GRAPHS
10/11/2001Random walks and spectral segmentation1 CSE 291 Fall 2001 Marina Meila and Jianbo Shi: Learning Segmentation by Random Walks/A Random Walks View.
Threshold selection in gene co- expression networks using spectral graph theory techniques Andy D Perkins*,Michael A Langston BMC Bioinformatics 1.
Spectral Clustering Scatter plot of a 2D data set K-means ClusteringSpectral Clustering U. von Luxburg. A tutorial on spectral clustering. Technical report,
Symmetric Matrices and Quadratic Forms
CS 584. Review n Systems of equations and finite element methods are related.
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts
Fast algorithm for detecting community structure in networks.
Segmentation Graph-Theoretic Clustering.
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.
Chapter 3 Determinants and Matrices
Graph, Search Algorithms Ka-Lok Ng Department of Bioinformatics Asia University.
Three Algorithms for Nonlinear Dimensionality Reduction Haixuan Yang Group Meeting Jan. 011, 2005.
Application of Graph Theory to OO Software Engineering Alexander Chatzigeorgiou, Nikolaos Tsantalis, George Stephanides Department of Applied Informatics.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
Systematic Analysis of Interactome: A New Trend in Bioinformatics KOCSEA Technical Symposium 2010 Young-Rae Cho, Ph.D. Assistant Professor Department of.
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
Lecture 4 Reaction system as ordinary differential equations Reaction system as stochastic process Metabolic network and stoichiometric matrix Graph spectral.
Lecture7 Topic1: Graph spectral analysis/Graph spectral clustering and its application to metabolic networks Topic 2: Concept of Line Graphs Topic 3: Introduction.
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
Spectral coordinate of node u is its location in the k -dimensional spectral space: Spectral coordinates: The i ’th component of the spectral coordinate.
ANALYZING PROTEIN NETWORK ROBUSTNESS USING GRAPH SPECTRUM Jingchun Chen The Ohio State University, Columbus, Ohio Institute.
An introduction to expander families and Ramanujan graphs
Segmentation Course web page: vision.cis.udel.edu/~cv May 7, 2003  Lecture 31.
Lecture7 Topic1: Graph spectral analysis/Graph spectral clustering and its application to metabolic networks Topic 2: Different centrality measures of.
Lecture 4 Reaction system as ordinary differential equations Reaction system as stochastic process Metabolic network and stoichiometric matrix Graph spectral.
1 Burning a graph as a model of social contagion Anthony Bonato Ryerson University Institute of Software Chinese Academy of Sciences.
Lecture 5: Mathematics of Networks (Cont) CS 790g: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Lecture 5 Reaction system as ordinary differential equations Reaction system as stochastic process Metabolic network and stoichiometric matrix Graph spectral.
Vector Norms and the related Matrix Norms. Properties of a Vector Norm: Euclidean Vector Norm: Riemannian metric:
5.2 Trees  A tree is a connected graph without any cycles.
Spectral Analysis based on the Adjacency Matrix of Network Data Leting Wu Fall 2009.
1 Some Inequalities on Weighted Vertex Degrees, Eigenvalues, and Laplacian Eigenvalues of Weighted Graphs Behzad Torkian Dept. of Mathematical Sciences.
10. Lecture WS 2014/15 Bioinformatics III1 V10 Metabolic networks - Graph connectivity Graph connectivity is related to analyzing biological networks for.
Lecture 3 1.Different centrality measures of nodes 2.Hierarchical Clustering 3.Line graphs.
Spectral Graph Theory and the Inverse Eigenvalue Problem of a Graph Leslie Hogben Department of Mathematics, Iowa State University, Ames, IA 50011
Graphs, Vectors, and Matrices Daniel A. Spielman Yale University AMS Josiah Willard Gibbs Lecture January 6, 2016.
 In the previews parts we have seen some kind of segmentation method.  In this lecture we will see graph cut, which is a another segmentation method.
How to Analyse Social Network? Social networks can be represented by complex networks.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Network Theory: Community Detection Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale.
A Tutorial on Spectral Clustering Ulrike von Luxburg Max Planck Institute for Biological Cybernetics Statistics and Computing, Dec. 2007, Vol. 17, No.
Expanders and Ramanujan Graphs Mike Krebs, Cal State LA For slideshow: click “Research and Talks” from
Random Walk for Similarity Testing in Complex Networks
Network analysis.
Centralities (2) Ralucca Gera,
Degree and Eigenvector Centrality
Network Science: A Short Introduction i3 Workshop
Segmentation Graph-Theoretic Clustering.
Numerical Analysis Lecture 16.
Graph Operations And Representation
V11 Metabolic networks - Graph connectivity
3.3 Network-Centric Community Detection
Symmetric Matrices and Quadratic Forms
Great Theoretical Ideas In Computer Science
V11 Metabolic networks - Graph connectivity
Detecting Important Nodes to Community Structure
V11 Metabolic networks - Graph connectivity
Symmetric Matrices and Quadratic Forms
Presentation transcript:

Graph spectral analysis/Graph spectral clustering and its application to metabolic networks

Graph spectral analysis/ Graph spectral clustering

PROTEIN STRUCTURE: INSIGHTS FROM GRAPH THEORY SARASWATHI VISHVESHWARA, K. V. BRINDA and N. KANNANy Molecular Biophysics Unit, Indian Institute of Science Bangalore 560012, India

Adjacency Matrix Degree Matrix Laplacian matrix L=D-A

Eigenvalues and eigenvectors Eigenvalues of a matrix A are the roots of the following equation |A-λI|=0, where I is an identity matrix Let λ is an eigenvalue of A and x is a vector such that then x is an eigenvector of A corresponding to λ . -----(1) N×N N×1

Node 1 has 3 edges, nodes 2, 3 and 4 have 2 edges each and node 5 has only one edge. The magnitude of the vector components of the largest eigenvalue of the Adjacency matrix reflects this observation.

Node 1 has 3 edges, nodes 2, 3 and 4 have 2 edges each and node 5 has only one edge. The magnitude of the vector components of the largest eigenvalue of the Laplacian matrix reflects this observation.

A corollary to this theorem is that the lev of a clique of n vertices The largest eigenvalue (lev) depends upon the highest degree in the graph. For any k regular graph G (a graph with k degree on all the vertices), the eigenvalue with the largest absolute value is k. A corollary to this theorem is that the lev of a clique of n vertices is n − 1. In a general connected graph, the lev is always ≤ to the largest degree in the graph. In a graph with n vertices, the absolute value of lev decreases as the degree of vertices decreases. The lev of a clique with 11 vertices is 10 and that of a linear chain with 11 vertices is 1.932 a linear chain with 11 vertices

In graphs 5(a)-5(e), the highest degree is 6 In graphs 5(a)-5(e), the highest degree is 6. In graphs 5(f)-5(i), the highest degree is 5, 4, 3 and 2 respectively.

It can be noticed that the lev is generally higher if the graph contains vertices of high degree. The lev decreases gradually from the graph with highest degree 6 to the one with highest degree 2. In case of graphs 5(a){5(e), where there is one common vertex with degree 6 (highest degree) and the degrees on the other vertices are different (less than 6 in all cases), the lev also depends on the degree of the vertices adjoining the highest degree vertex.

We combine graph 4(a) and graph 4(b) and construct a Laplacian matrix with edge weights (1/dij ), where dij is the distance between vertices i and j. The distances between the vertices of graph 4(a) and graph 4(b) are considered to be very large (say 100) and thus the matrix elements corresponding to a vertex from graph 4(a) and the other from graph 4(b) is considered to have a very small value of 0.01. The Laplacian matrix of 8 vertices thus considered is diagonalized and their eigenvalues and corresponding vector components are given in Table 3.

The vector components corresponding to the second smallest eigenvalue contains the desired information about clustering, where the cluster forming residues have identical values. In Fig. 4, nodes 1-5 form a cluster (cluster 1) and 6-8 form another cluster (cluster 2).

Metabolome Based Reaction Graphs of M. tuberculosis and M. leprae: A Comparative Network Analysis Ketki D. Verkhedkar1, Karthik Raman2, Nagasuma R. Chandra2, Saraswathi Vishveshwara1* 1 Molecular Biophysics Unit, Indian Institute of Science, Bangalore, India, 2 Bioinformatics Centre, Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore, India PLoS ONE | www.plosone.org September 2007 | Issue 9 | e881

Construction of network

Analysis of network parameters

Analyses of sub-clusters in the giant component To detect sub-clusters of reactions in the giant component graph spectral analysis was performed. To obtain the eigenvalue spectra of the graph, the adjacency matrix of the graph is converted to a Laplacian matrix (L), by the equation: L=D-A where D, the degree matrix of the graph, is a diagonal matrix in which the ith element on the diagonal is equal to the number of connections that the ith node makes in the graph. It is observed that reactions belonging to fatty acid biosynthesis and the FAS-II cycle of the mycolic acid pathway in M. tuberculosis form distinct, tightly connected sub-clusters.

Identification of hubs in the reaction networks In biological networks, the hubs are thought to be functionally important and phylogenetically oldest. The largest vector component of the highest eigenvalue of the Laplacian matrix of the graph corresponds to the node with high degree as well as low eccentricity. Two parameters, degree and eccentricity, are involved in the identification of graph spectral (GS) hubs. Alternatively, hubs can be ranked based on their connectivity alone (degree hubs). It was observed that the top 50 degree hubs in the reaction networks of the three organisms comprised reactions involving the metabolite L-glutamate as well as reactions involving pyruvate. However, the top 50 GS hubs of M. tuberculosis and M. leprae exclusively comprised reactions involving L-glutamate while the top GS hubs in E. coli only consisted of reactions involving pyruvate. The difference in the degree and GS hubs suggests that the most highly connected reactions are not necessarily the most central reactions in the metabolome of the organism