Skip to main content
Have a personal or library account? Click to login
On The Eigenvalue Distribution Of Adjacency Matrices For Connected Planar Graphs Cover

On The Eigenvalue Distribution Of Adjacency Matrices For Connected Planar Graphs

Open Access
|Dec 2015

References

  1. Adler M., van Moerbeke P., 2001. Hermitian, symmetric and symplectic random ensembles: PDEs for the distribution of the spectrum.153: 149–189.
  2. Barry R., Pace R., 1999. Monte Carlo estimates of the log determinant of large sparse matrices.289: 41–54.
  3. Box G., Jenkins G., 1976.:Holden Day, San Francisco.
  4. Brouwer A., Haemers W., 2012.. Springer, New York.
  5. Cao D., Yuan H., 1993. Graphs characterized by the second eigenvalue.17: 25–331.
  6. Cao D., Yuan H., 1995. The distribution of eigenvalues of graphs.216: 211–224.
  7. Chung F., 1997.. American Mathematical Society, Providence, RI.
  8. Chung F., Lu L., Vu V., 2003. Spectra of random graphs with given expected degrees.100: 6313–6318.
  9. Cressie N., 1993.. Wiley, New York.
  10. Faloutsos M., Faloutsos P., Faloutsos C., 1999. On power-law relationships of the internet topology.29: 251–262.
  11. Farrell P., Ehsanes Saleh A., Zhang Z., 2011. Methods of moments estimation in finite mixtures.:73-A, Part 2: 218–230.
  12. Fefferman C., Phong D., 1980. On the asymptotic eigenvalue distribution of a pseudo-differential operation.77: 5622–5625.
  13. Golub G., van der Vorst H., 2000. Numerical progress in eigenvalue computation in the 20century.123: 35–65.
  14. Griffith D., 2000. Eigenfunction properties and approximations of selected incidence matrices employed in spatial analyses.321: 95–112.
  15. Griffith D., 2003.:. Springer, New York.
  16. Griffith D., 2004. Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses.388: 201–219.
  17. Griffith D., Luhanga U., 2011. Approximating the inertia of the adjacency matrix of a connected planar graph that is the dual of a geographic surface partitioning.43: 383–402.
  18. Hams A., de Raedt H., 2000. Fast algorithm for finding the eigenvalue distribution of very large matrices.:62 (#3): 4365–4377.
  19. Henson J., Reise S., Kim K., 2007. Detecting mixtures from structural model differences using latent variable mixture modeling: A comparison of relative model fit statistics.14 (2): 202–226.
  20. Huffer F., Wu H., 1998. Markov chain Monte Carlo for autologistic regression models with application to the distribution of plant species.54: 509–524.
  21. Hyndman J., Kostenko A., 2007. Minimum sample size requirements for seasonal forecasting models.6: 12–15.
  22. Khorunzhy O., Shcherbina M., Vengerovsky V., 2004. Eigenvalue distribution of large weighted random graphs.45 (#4): 1648–1672.
  23. Liu B., Bo Z., 2000. On the third largest eigenvalue of a graph.317: 193–200.
  24. Martin R., Griffith D., 1998. Fast methods for fitting one-parameter spatial models. Department of Geography, Syracuse University Syracuse, NY (unpublished paper).
  25. Sylvester J., 1852. A demonstration of the theorem that every homogeneous quadratic polynomial is reducible by real orthogonal substitutions to the form of a sum of positive and negative squares.Series 4, 4 (23): 138–142.
  26. Tse R., 1997. An application of the ARIMA model to real estate prices in Hong Kong.8: 152–163.
  27. Yong X., 1999. On the distribution of eigenvalues of a simple undirected graph.295: 73–80.
DOI: https://doi.org/10.1515/quageo-2015-0035 | Journal eISSN: 2081-6383 | Journal ISSN: 2082-2103 (formerly 0137-477X)
Language: English
Page range: 39 - 60
Submitted on: Feb 2, 2015
Published on: Dec 30, 2015
Published by: Adam Mickiewicz University
In partnership with: Paradigm Publishing Services
Related subjects:

© 2015 Daniel A. Griffith, published by Adam Mickiewicz University
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.