Robust network construction against intentional attacks

Building large robust networks against intentional attacks has been well recognized important in designing infrastructure and cyberphysical systems. In some applications, complex networks have to be constructed under some resource constraints, degree sequence constraints on vertices being a popular one. In this paper, we study a novel and challenging problem: constructing large robust networks with degree sequence constraints against intentional attacks. We propose a heuristic approach with several desirable properties. Using both synthetic and real networks we show that our method improves the robustness of large networks substantially.