Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses
- 1 September 2004
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 388, 201-219
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Eigenfunction properties and approximations of selected incidence matrices employed in spatial analysesLinear Algebra and its Applications, 2000
- A linear regression solution to the spatial autocorrelation problemJournal of Geographical Systems, 2000
- Monte Carlo estimates of the log determinant of large sparse matricesLinear Algebra and its Applications, 1999
- Eigenvalue interlacing and weight parameters of graphsLinear Algebra and its Applications, 1999
- Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrixLinear Algebra and its Applications, 1998
- EFFICIENT ALGORITHMS FOR CONSTRUCTING PROPER HIGHER ORDER SPATIAL LAG OPERATORS*Journal of Regional Science, 1996
- A Conjecture on the Maximum Value of the Principal Eigenvalue of a Planar GraphGeographical Analysis, 1991
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991
- The largest eigenvalue of a graph: A surveyLinear and Multilinear Algebra, 1990
- On Extreme Values of Moran'sIand Geary's cGeographical Analysis, 1984