Computation of Graph Spectra of Protein-Protein Interaction Networks

Date

2011-05-05

Author

Karasözen, Bülent

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

25
views

0
downloads

Complex systems from many areas such as biology, sociology, technology appear in form of large networks. These networks are represented usually in form of graphs and their structural properties are analyzed using the methods of graph theory. The so called Laplacian matrix became an important tool of spectral graph theory for the investigation of structural properties of large biological networks. Many important features of the underlying structure and dynamics of systems can be extracted from the analysis of the spectral density of graphs. The Laplacian matrices of empirical networks are unstructured large sparse matrices. The spectra of the Laplacian matrices of large protein-protein interaction networks (PPIN's) are computed using sparse eigenvalue solvers with high accuracy.

URI

https://hdl.handle.net/11511/53825

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Computation of Spectra of Large Networks Erdem, Özge; Karasözen, Bülent (2010-11-27) Many interacting complex systems in biology, physics, technology and social systems can be represented in a form of large networks. The networks are mathematically represented by graphs. A graph is usually represented by adjacency or Laplacian matrix. Many important features of the underlying structure and dynamics of them can be extracted from the analysis of the spectrum of graphs. Spectral analysis of the so called normalized Laplacian matrix of large networks has become popular in recent years. The Lapl...
Computation and analysis of spectra of large undirected networks Erdem, Özge; Karasözen, Bülent; Jost, Jürgen; Department of Scientific Computing (2010) Many interacting complex systems in biology, in physics, in technology and social systems, can be represented in a form of large networks. These large networks are mathematically represented by graphs. A graph is represented usually by the adjacency or the Laplacian matrix. Important features of the underlying structure and dynamics of them can be extracted from the analysis of the spectrum of the graphs. Spectral analysis of the so called normalized Laplacian of large networks became popular in the recent ...
Computation and analysis of spectra of large networks with directed graphs Sarıaydın, Ayşe; Karasözen, Bülent; Jost, Jürgen; Department of Scientific Computing (2010) Analysis of large networks in biology, science, technology and social systems have become very popular recently. These networks are mathematically represented as graphs. The task is then to extract relevant qualitative information about the empirical networks from the analysis of these graphs. It was found that a graph can be conveniently represented by the spectrum of a suitable difference operator, the normalized graph Laplacian, which underlies diffusions and random walks on graphs. When applied to large...
Evaluating the effects of rescaling parameters in large-scale genomic simulations Kıratlı, Ozan; Birand Özsoy, Ayşegül Ceren; Department of Biology (2016) Computer simulations are widely used in many subdisciplines of biological sciences, which evolutionary biology. Large-scale genomic simulations, where several kb (kilo base) to several Mb (megabase) genomes are modeled, are being increasingly used. These simulations require high computing power. There are some methods proposed in the literature to decrease the time and memory demand of these simulations. This study is concentrated on one of those methods, where both the number of generation, and the number ...
Implementation of crossbar web service for interactive visualizations of biological networks Atakan , Ahmet; Atalay, Mehmet Volkan; Department of Computer Engineering (2020-9) Existing computational tools, resources, and services to assist experimental biomedical research lack data diversity and data connectivity and therefore, they are limited in helping to solve real world problems. Within the framework of CROssBAR project aiming for drug discovery, CROssBAR database (CROssBAR-DB) integrated diverse biomedical resources with the predictions of a comprehensive computing resource developed using machine learning and deep learning-based methods. It is crucial for the users to ...

Citation Formats

B. Karasözen, “Computation of Graph Spectra of Protein-Protein Interaction Networks,” 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53825.