A strength and sparsity preserving algorithm for generating weighted, directed networks with predetermined assortativity

DOI10.1016/J.PHYSA.2024.129634MaRDI QIDQ6539632FDOQ6539632

Authors: Yelie Yuan, Jun Yan, Panpan Zhang 

Publication date: 15 May 2024

Published in: Physica A (Search for Journal in Brave)

zbMATH Keywords

directed assortativitymixed Integer programmingattainable assortativityweighted network rewiring

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Programming involving graphs or networks (90C35) Statistical mechanics, structure of matter (82-XX) Mixed integer programming (90C11)

Cites Work

• Optimizing network robustness by edge rewiring: a general framework
• Assortativity measures for weighted and directed networks
• Generating directed networks with predetermined assortativity measures
• Fitting the linear preferential attachment model
• Emergence of Scaling in Random Networks
• Title not available (Why is that?)
• Random Graphs
• Influence of assortativity and degree-preserving rewiring on the spectra of networks
• Network science. With Márton Pósfai

This page was built for publication: A strength and sparsity preserving algorithm for generating weighted, directed networks with predetermined assortativity

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