Isospectral reductions of non-negative matrices
From MaRDI portal
Cites work
- Characterizing cospectral vertices via isospectral reduction
- Complex networks. Structure, robustness and function.
- Digraphs
- Eigenvectors of isospectral graph transformations
- Evolutionary dynamics. Exploring the equations of life.
- Finding hidden structures, hierarchies, and cores in networks via isospectral reduction
- Foundations of ergodic theory
- Generalized eigenvectors of isospectral transformations, spectral equivalence and reconstruction of original networks
- Hidden symmetries in real and theoretical networks
- scientific article; zbMATH DE number 3002670 (Why is no real title available?)
- scientific article; zbMATH DE number 1866312 (Why is no real title available?)
- scientific article; zbMATH DE number 3195751 (Why is no real title available?)
- Improved estimates of survival probabilities via isospectral transformations
- Isospectral graph reductions and improved estimates of matrices' spectra
- Isospectral reduction in infinite graphs
- Link prediction in networks using effective transitions
- Methods and models in mathematical biology. Deterministic and stochastic approaches
- Numerical methods for large eigenvalue problems
- Relative perturbation results for eigenvalues and eigenvectors of diagonalisable matrices
- Spectrum of large random Markov chains: Heavy-tailed weights on the oriented complete graph
- Stationary measures on infinite graphs
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- The structure and dynamics of networks
This page was built for publication: Isospectral reductions of non-negative matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6954948)