Influence of assortativity and degree-preserving rewiring on the spectra of networks
From MaRDI portal
(Redirected from Publication:614567)
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
Cites work
- scientific article; zbMATH DE number 5552899 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A degree sequence problem related to network design
- Another look at the degree constrained subgraph problem
- Graph Spectra for Complex Networks
- Number of walks and degree powers in a graph
- Performance Analysis of Communications Networks and Systems
- Sparsification—a technique for speeding up dynamic graph algorithms
Cited in
(24)- Realization of consensus of multi-agent systems with stochastically mixed interactions
- Disparity-persistence and the multistep friendship paradox
- 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 in complex networks
- Higher-order assortativity for directed weighted networks and Markov chains
- Two-walks degree assortativity in graphs and 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
- Analytical results for the distribution of first return times of non-backtracking random walks on configuration model networks
- Centrality measures to control epidemic spreading on uniform hypergraphs or hypernetworks
- 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)
