Please use this identifier to cite or link to this item:
- The Eigenvectors of a Random Graph
- Twardos, Michael
- A graph can be represented by an adjacency matrix, with an entry of 1 at position i, j if the i^th node is connected to the j^th node, and 0 otherwise. This Demonstration provides a visualization of the eigenvectors of the adjacency matrix of a graph. The eigenvalue is indicated above the graph. The size of the nodes (circles) are proportional to the absolute magnitude of that component of the eigenvector; the eigenvectors are related to the problem of graph partitioning. Yellow nodes indicate positive values and green nodes indicate negative values. The relative sizes of the nodes for a given eigenvalue indicate the relative importance (ranking of those nodes) as well as the community structure of the graph
- Componente Curricular::Educação Superior::Ciências Exatas
- Álgebra linear
- Educação Superior::Ciências Exatas::Matemática
- This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
- Demonstration freeware using Mathematica Player
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.