A new method optimizing the subgraph centrality of large networks

DOI10.1016/J.PHYSA.2015.10.034MaRDI QIDQ1619035zbMATHOpenAlexFDO

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

zbMATH Keywords

optimizationspectral densityspectral radiusnetwork connectivitystructural properties

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Eigenvalues, singular values, and eigenvectors (15A18) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

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

Cites work

• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• Characteristic vectors of bordered matrices with infinite dimensions
• Eigenvalue spectra of complex networks
• Eigenvector perturbations of complex networks
• Graph spectra for complex networks
• Graphs with given diameter maximizing the algebraic connectivity
• Metric structure of random networks
• Old and new results on algebraic connectivity of graphs
• On the distribution of the roots of certain symmetric matrices
• Robustness of random graphs based on graph spectra
• The eigenvalues of random symmetric matrices

Cited in

(3)

• MEASURING OPTIMAL CONNECTIONS IN LARGE NETWORKS: A NEW ALGORITHM AND ITS APPLICATIONS
• New results and open problems on subgraph centrality
• Network structure optimization for social networks by minimizing the average path length

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)