Resilient Community Clustering: A Graph Theoretical Approach

Kazuhiro Minami, Tomoya Tanjo, Nana Arizumi, Hiroshi Maruyama, Daisuke Murakami, Yoshiki Yamagata

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)


Many complex systems can be modeled as a graph consisting of nodes and connecting edges. Such a graph-based model is useful to study the resilience of decentralized systems that handle a system failure by isolating a subsystem with failed components. In this chapter, we study a graph clustering problem for electrical grids where a given grid is partitioned into multiple microgrids that are self-contained in terms of electricity balance. Our goal is to find an optimal partition that minimizes the cost of constructing a set of self-sufficient microgrids. To obtain a better solution accommodating smaller microgrids, we develop an efficient verification algorithm that determines whether microgrids can balance their electricity surplus through electricity exchange among them. Our experimental results with a dataset about Yokohama city in Japan show that our proposed method can effectively reduce the construction cost of decentralized microgrids.

Original languageEnglish
Title of host publicationAdvanced Sciences and Technologies for Security Applications
Number of pages19
Publication statusPublished - 2016
Externally publishedYes

Publication series

NameAdvanced Sciences and Technologies for Security Applications
ISSN (Print)1613-5113
ISSN (Electronic)2363-9466

ASJC Scopus subject areas

  • Safety, Risk, Reliability and Quality
  • Safety Research
  • Political Science and International Relations
  • Computer Science Applications
  • Computer Networks and Communications
  • Health, Toxicology and Mutagenesis


Dive into the research topics of 'Resilient Community Clustering: A Graph Theoretical Approach'. Together they form a unique fingerprint.

Cite this