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

DOI10.1016/S0024-3795(03)00368-9zbMATH Open1050.05084MaRDI QIDQ1881069FDOQ1881069

Authors: Daniel A. Griffith 

Publication date: 4 October 2004

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

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

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)

Cites Work

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

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)