2023/10/13 by Shuo Zou, Bo Zhou, Zou, Shuo +3
Computer Science · Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #FOS: Computer and information sciences #FOS: Physical sciences #Graph theory and applications #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI) #Software-Defined Networks and 5G
paper · pdf · doi:10.48550/arxiv.2310.08924
openalex publication_date 2023/10/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Degree correlation is an important characteristic of networks, which is usually quantified by the assortativity coefficient. However, concerns arise about changing the assortativity coefficient of a network when networks suffer from adversarial attacks. In this paper, we analyze the factors that affect the assortativity coefficient and study the optimization problem of maximizing or minimizing the assortativity coefficient (r) in rewired networks with k pairs of edges. We propose a greedy algorithm and formulate the optimization problem using integer programming to obtain the optimal solution for this problem. Through experiments, we demonstrate the reasonableness and effectiveness of our proposed algorithm. For example, rewired edges 10% in the ER network, the assortativity coefficient improved by 60%.