Dominant eigenvalue-eigenvector pair estimation via graph infection

DOI10.1007/978-3-031-36709-0_13MaRDI QIDQ6535519zbMATH OpenFDO

Authors Kaiyuan Yang, Li Xia, Y. C. Tay

Publication date 12 January 2024

zbMATH Keywords

Euler methodeigenvector centralitydominant eigenvaluefirst-order matrix ODEgraph infection

Mathematics Subject Classification ID

Epidemiology (92D30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Recommendations

• The power method and beyond
• Statistical complexity of dominant eigenvector calculation
• Survey of power, QR, and iterative methods for solution of largest eigenvalue of essentially positive matrices
• scientific article; zbMATH DE number 1193040
• Matrix balancing and robust Monte Carlo algorithm for evaluating dominant eigenpair

Cites work

• A study of graph spectra for comparing graphs and trees
• Eigenvalue computation in the 20th century
• Mathematics of epidemics on networks. From exact to approximate models
• Numerical mathematics.
• On the definition and the computation of the basic reproduction ratio \(R_ 0\) in models for infectious diseases in heterogeneous populations
• On the eigen‐functions of dynamic graphs: Fast tracking and attribution algorithms
• Perturbations of matrices: A theorem on the Perron vector and its applications to input-output models
• Stochastic processes. Theory for applications.

This page was built for publication: Dominant eigenvalue-eigenvector pair estimation via graph infection

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