| Title: |
Beyond algebraic connectivity of graphs - evaluation of topology, based on spectral clustering. |
| Alternate Title: |
Отвъд алгебричната свързаност на графа - спектрално клъстериране като оценка на топологията. (Bulgarian) |
| Authors: |
Mirchev, Mircho J. |
| Source: |
Electrotechnica & Electronica (E+E); 2016, Vol. 51 Issue 9/10, p11-16, 6p, 2 Charts |
| Subject Terms: |
Graph theory; Vector algebra; Eigenvectors; Telecommunication; Vector topology |
| Abstract: |
This paper presents a method for graph topology evaluation based on the Spectral graph theory, which is based on the analysis of Eigen values and Eigen vectors of the graph matrices. When doing Spectral graph analysis, the first is to calculate the Eigen values and Eigen vectors of the Laplacian matrix of the graph, which gives the important value λ2 –the algebraic connectivity of a graph and the Fiedler vector. This vector has values for each node of the graph. On the base of this analysis, a variant of adding a new edge, which gives the highest gain in the algebraic connectivity, is made. Based on this works, a system for automated analysis of graphs and self-learning algorithm for graph analysis and optimization can be made. [ABSTRACT FROM AUTHOR] |
| : |
Copyright of Electrotechnica & Electronica (E+E) is the property of Union of Electronics, Electrical Engineering & Telecommunications (CEEC) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |