Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses

DOI10.1016/S0024-3795(03)00368-9MaRDI QIDQ1881069zbMATH OpenFDO

Authors Daniel A. Griffith

Publication date 4 October 2004

Published in Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

determinanteigenvaluestochastic matrixplanar graphincidence matrixJacobianadjacency matricestesselationextreme eigenfunctionsgeographic weights matrices

Mathematics Subject Classification ID

Inference from spatial processes (62M30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Determinants, permanents, traces, other special matrix functions (15A15) Stochastic matrices (15B51)

Recommendations

• Eigenfunction properties and approximations of selected incidence matrices employed in spatial analyses
• scientific article; zbMATH DE number 3959658
• Eigenvalue distribution of large weighted random graphs
• Eigensolution for adjacency and Laplacian matrices of large repetitive structural models
• Spectral properties of matrices associated with some directed graphs

Cites work

• scientific article; zbMATH DE number 432500 (Why is no real title available?)
• scientific article; zbMATH DE number 3968787 (Why is no real title available?)
• scientific article; zbMATH DE number 3717339 (Why is no real title available?)
• scientific article; zbMATH DE number 52492 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 3311857 (Why is no real title available?)
• A fast eigenvalue algorithm for Hankel matrices
• Eigenfunction properties and approximations of selected incidence matrices employed in spatial analyses
• Eigenspaces of graphs
• Eigenvalue interlacing and weight parameters of graphs
• Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix
• Estimation Methods for Models of Spatial Interaction
• Geometric bounds for eigenvalues of Markov chains
• Monte Carlo estimates of the log determinant of large sparse matrices
• On the distribution of eigenvalues of a simple undirected graph
• Sharp lower bounds of the least eigenvalue of planar graphs
• Spectral Radius and Degree Sequence
• The largest eigenvalue of a graph: A survey

Cited in

(2)

• Eigenfunction properties and approximations of selected incidence matrices employed in spatial analyses
• Approximate implementation of the logarithm of the matrix determinant in Gaussian process regression

This page was built for publication: Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881069)