{'fraction_non_alphanumeric': 0.013386880856760375, 'fraction_numerical': 0.0, 'mean_word_length': 5.448275862068965, '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}}
A first step towards resilient graph partitioning for electrical grids

We study a graph partitioning problem for electrical grids such that a given grid is partitioned into multiple ones that are self-contained concerning electricity balance. Our goal is to find a resilient partition against time-changing power demand and supply over the year. In this paper, we investigate two graph partitioning algorithms applying them to a synthesized dataset based on realistic assumptions about Yokohama, Japan. Our initial results show that a simple algorithm, which only considers horizontal or vertical partitions, possibly produces more resilient partitions than a more general algorithm whose partitions divide a graph into subgraphs of any topology.