Graphlet Laplacians: graphlet-based neighbourhoods highlight topology-function and topology-disease relationships
Abstract
MotivationLaplacian matrices capture the global structure of networks and are widely used to study biological networks. However, the local structure of the network around a node can also capture biological information. Local wiring patterns are typically quantified by counting how often a node touches different graphlets (small, connected, induced sub-graphs). Currently available graphlet-based methods do not consider whether nodes are in the same network neighbourhood.\n\nContributionTo combine graphlet-based topological information and membership of nodes to the same network neighbourhood, we generalize the Laplacian to the Graphlet Laplacian, by considering a pair of nodes to be adjacent if they simultaneously touch a given graphlet.\n\nResultsWe utilize Graphlet Laplacians to generalize spectral embedding, spectral clustering and network diffusion. Applying our generalization of spectral clustering to model networks and biological networks shows that Graphlet Laplacians capture different local topology corresponding to the underlying graphlet. In biological networks, clusters obtained by using different Graphlet Laplacians capture complementary sets of biological functions. By diffusing pan-cancer gene mutation scores based on different Graphlet Laplacians, we find complementary sets of cancer driver genes. Hence, we demonstrate that Graphlet Laplacians capture topology-function and topology-disease relationships in biological networks
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 2
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Proximity Measures as Graph Convolution Matrices for Link Prediction in Biological Networks
Mustafa Coşkun, Mehmet Koyutürk·bioRxiv·Nov 14, 2020
- Large Scale and Stable Graph Differential Analysis via Multi-Layer Node Embeddings and Ranking
Panagiotis Mandros, Ian Gallagher, … John F Quackenbush·bioRxiv·Jun 16, 2024
- Metrics for Graph Comparison: A Practitioner’s Guide
Peter Wills, François G. Meyer·PLoS ONEPeer-reviewed·Feb 12, 2020
- Accurately modeling biased random walks on weighted networks using node2vec+
Renming Liu, Matthew Hirn, Arjun Krishnan·BioinformaticsPeer-reviewed·Jan 1, 2023
- Graph Laplacian Spectrum, topological properties, and high-order interactions of Structural Brain Networks are Subject-Specific, Repeatable but Highly Dependent on Graph Construction Scheme
Stavros I. Dimitriadis·bioRxiv·May 31, 2023
- Multiplex Embedding of Biological Networks Using Topological Similarity of Different Layers
Mustafa Coşkun, Mehmet Koyutürk·bioRxiv·Nov 5, 2021