{'fraction_non_alphanumeric': 0.01717791411042945, 'fraction_numerical': 0.0, 'mean_word_length': 5.135338345864661, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
How to Defend a Network?

Modern economies rely heavily on their infrastructure networks. These networks face threats ranging from natural disasters to human attacks. As networks are pervasive, the investments needed to protect them are very large; this motivates the study of targeted defence. What are the ‘key’ nodes to defend to maximize functionality of the network? What are the incentives of individual nodes to protect themselves in a networked environment and how do these incentives correspond to collective welfare? We provide a characterization of equilibrium attack and defence in terms of two classical concepts in graph theory – separators and transversals. We study the welfare costs of decentralized defence. We apply our results to the defence of the US Airport Network and the London Underground.