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

DOI10.1140/epjb/e2010-00219-xzbMath1202.05131OpenAlexW2154177180MaRDI 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 matrixlargest eigenvaluealgebraic connectivityassortativitydisassortativityrewiring algorithm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

Degree distribution and assortativity in line graphs of complex networks ⋮ Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming ⋮ Spectral properties of complex networks ⋮ The minimum spectral radius of an edge-removed network: a hypercube perspective ⋮ Higher order assortativity in complex networks ⋮ Realization of consensus of multi-agent systems with stochastically mixed interactions ⋮ Maximum modular graphs ⋮ Efficient approaches for attaining epidemic-free networks with minimum edge removal set ⋮ The \(N\)-intertwined SIS epidemic network model ⋮ The correlation of metrics in complex networks with applications in functional brain networks ⋮ Optimizing network robustness by edge rewiring: a general framework ⋮ The role of graphlets in viral processes on networks ⋮ Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree ⋮ Exploring the optimal network topology for spreading dynamics ⋮ Undirected congruence model: topological characteristics and epidemic spreading ⋮ The Bass diffusion model on finite Barabasi-Albert 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

This page was built for publication: Influence of assortativity and degree-preserving rewiring on the spectra of networks