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

DOI10.1016/S0024-3795(03)00368-9zbMath1050.05084MaRDI QIDQ1881069

Daniel A. Griffith

Publication date: 4 October 2004

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

zbMATH Keywords

Jacobianeigenvalueincidence matrixdeterminantplanar graphstochastic matrixtesselationadjacency matricesextreme eigenfunctionsgeographic weights matrices

Mathematics Subject Classification ID

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

Related Items (1)

Approximate implementation of the logarithm of the matrix determinant in Gaussian process regression

Cites Work

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

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