Influence of assortativity and degree-preserving rewiring on the spectra of networks

DOI10.1140/epjb/e2010-00219-xzbMath1202.05131MaRDI QIDQ614567

Sumit K. Garg

Publication date: 4 January 2011

Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Full work available at URL: http://resolver.tudelft.nl/uuid:19e89859-7c67-4f52-931a-30fba16953b1

zbMATH Keywords

adjacency matrix; largest eigenvalue; algebraic connectivity; assortativity; disassortativity; rewiring algorithm

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Spectral properties of complex networks, Realization of consensus of multi-agent systems with stochastically mixed interactions, Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming, The \(N\)-intertwined SIS epidemic network model, Degree distribution and assortativity in line graphs of complex networks, Higher order assortativity in complex networks, Optimizing network robustness by edge rewiring: a general framework, Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree, The role of graphlets in viral processes on networks, The Bass diffusion model on finite Barabasi-Albert networks, The minimum spectral radius of an edge-removed network: a hypercube perspective, The correlation of metrics in complex networks with applications in functional brain networks

Cites Work

• Unnamed Item
• Unnamed Item
• Number of walks and degree powers in a graph
• Another look at the degree constrained subgraph problem
• A degree sequence problem related to network design
• Sparsification—a technique for speeding up dynamic graph algorithms
• Graph Spectra for Complex Networks
• Performance Analysis of Communications Networks and Systems