A new method optimizing the subgraph centrality of large networks
From MaRDI portal
Publication:1619035
DOI10.1016/J.PHYSA.2015.10.034zbMATH Open1400.90293OpenAlexW1757839851MaRDI QIDQ1619035FDOQ1619035
Authors: Xin Yan, Chunlin Li, Ling Zhang, Yaogai Hu 
Publication date: 13 November 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2015.10.034
Recommendations
- Finding diverse ways to improve algebraic connectivity through multi-start optimization
- Updating and downdating techniques for optimizing network communicability
- Optimizing network robustness by edge rewiring: a general framework
- Optimizing algebraic connectivity by edge rewiring
- Network structure optimization for social networks by minimizing the average path length
Programming involving graphs or networks (90C35) Eigenvalues, singular values, and eigenvectors (15A18) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- The eigenvalues of random symmetric matrices
- Metric structure of random networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characteristic vectors of bordered matrices with infinite dimensions
- Robustness of random graphs based on graph spectra
- On the distribution of the roots of certain symmetric matrices
- Old and new results on algebraic connectivity of graphs
- Graph spectra for complex networks
- Eigenvector perturbations of complex networks
- Eigenvalue spectra of complex networks
- Graphs with given diameter maximizing the algebraic connectivity
Cited In (3)
This page was built for publication: A new method optimizing the subgraph centrality of large networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1619035)
