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

DOI10.1140/EPJB/E2010-00219-XzbMATH Open1202.05131OpenAlexW2154177180MaRDI QIDQ614567FDOQ614567

Authors: 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

Recommendations

• Optimizing network robustness by edge rewiring: a general framework
• Two-walks degree assortativity in graphs and networks
• Assortativity in complex networks
• Higher order assortativity in complex networks
• Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree

zbMATH Keywords

adjacency matrixlargest eigenvaluealgebraic connectivityassortativitydisassortativityrewiring algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Sparsification—a technique for speeding up dynamic graph algorithms
• Title not available (Why is that?)
• Number of walks and degree powers in a graph
• Another look at the degree constrained subgraph problem
• Performance Analysis of Communications Networks and Systems
• A degree sequence problem related to network design
• Graph Spectra for Complex Networks

Cited In (20)

• Realization of consensus of multi-agent systems with stochastically mixed interactions
• The adaptive coupling scheme and the heterogeneity in intrinsic frequency and degree distributions of the complex networks
• The Bass diffusion model on finite Barabasi-Albert networks
• Higher-order assortativity for directed weighted networks and Markov chains
• Higher order assortativity in complex networks
• The role of graphlets in viral processes on networks
• The \(N\)-intertwined SIS epidemic network model
• Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming
• Efficient approaches for attaining epidemic-free networks with minimum edge removal set
• A study on the relationship between connecting different types of nodes and disassortativity by degree
• Maximum modular graphs
• Exploring the optimal network topology for spreading dynamics
• Spectral properties of complex networks
• Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
• Degree distribution and assortativity in line graphs of complex 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
• Undirected congruence model: topological characteristics and epidemic spreading
• A strength and sparsity preserving algorithm for generating weighted, directed networks with predetermined assortativity
• Optimizing network robustness by edge rewiring: a general framework

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q614567)