You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/unesp/361069
Title: 
The Eigenvectors of a Random Graph
Author(s): 
Twardos, Michael
Language: 
eng
Description: 
  • 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
Issue Date: 
  • 20-Sep-2008
  • 20-Sep-2008
  • 2008
  • 20-Sep-2008
  • 18-Sep-2008
Publisher: 
Wolfram
Keywords: 
  • Álgebra linear
  • Educação Superior::Ciências Exatas::Matemática
Credits: 
This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
Source: 
http://objetoseducacionais2.mec.gov.br/handle/mec/5563
URI: 
http://acervodigital.unesp.br/handle/unesp/361069
Rights: 
Demonstration freeware using Mathematica Player
Type: 
outro
Appears in Collections:MEC - Objetos Educacionais (BIOE) - OE

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.