Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Computation of Graph Spectra of Protein-Protein Interaction Networks
Date
2011-05-05
Author
Karasözen, Bülent
Erdem, Oezge
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
0
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