Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses
DOI10.1016/S0024-3795(03)00368-9zbMATH Open1050.05084MaRDI QIDQ1881069FDOQ1881069
Publication date: 4 October 2004
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
determinanteigenvaluestochastic matrixplanar graphincidence matrixJacobianadjacency matricestesselationextreme eigenfunctionsgeographic weights matrices
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Estimation Methods for Models of Spatial Interaction
- Eigenspaces of graphs
- 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
- 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
- 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
Cited In (1)
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)
