Linear algebra in geography: Eigenvectors of networks
Date of Publication
1998
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
The discussion of this paper was based on the article Linear Algebra in Geography: Eigenvectors of Networks by Philip D. Straffin, Jr. It discussed a particular index of accessibility for each vertex in the network, in which manipulation through graphs, matrices, eigenvalues and eigenvectors produced numbers which were called the accessibility index . Concepts from linear algebra were used to develop two different models to justify Gould's index. These models are the relative number of paths joining each vertex to all vertices in the graph and the equilibrium distribution of a rumor spreading in the graph from any vertex. In both cases, Gould's index reflected the relative accessibility of the different vertices in the network.
Abstract Format
html
Language
English
Format
Accession Number
TU08782
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
83 leaves
Keywords
Algebras, Linear; Geography--Mathematics; Eigenvectors; Matrices; Geography--Network analysis
Recommended Citation
Pablo, E. A., & Polintan, D. D. (1998). Linear algebra in geography: Eigenvectors of networks. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16508