A strength and sparsity preserving algorithm for generating weighted, directed networks with predetermined assortativity
Published in Physica A: Statistical Mechanics and its Applications, 2024
In this paper, we proposed an efficient algorithm for generating weighted, directed networks with given assortativity measures. The determination of target networks was done by solving a linear programming problem, followed by a rewiring algorithm preserving node strenghts and network sparsity. The method implementation was done through Python. <DOI | ArXiv>
Recommended citation: Yuan, Y., Yan, J. and Zhang, P. (2024). "A strength and sparsity preserving algorithm for generating weighted, directed networks with predetermined assortativity." Physica A: Statistical Mechanics and its Applications, 638, 129634. https://doi.org/10.1016/j.physa.2024.129634