# Hierarchical Change Point Detection on Dynamic Networks

**Authors:** Yu Wang, Aniket Chakrabarti, David Sivakoff, Srinivasan Parthasarathy

arXiv: 1706.02186 · 2017-06-20

## TL;DR

This paper introduces a generic framework for change point detection in dynamic networks with community structures, capable of identifying local and global changes efficiently and accurately, with significant speed improvements.

## Contribution

It presents a novel, flexible framework that unifies various change point detection algorithms for dynamic networks, distinguishing local and global changes effectively.

## Key findings

- Accurately detects change points in synthetic and real networks.
- Achieves up to 800X speedup over existing methods.
- Effectively distinguishes between local and global network changes.

## Abstract

This paper studies change point detection on networks with community structures. It proposes a framework that can detect both local and global changes in networks efficiently. Importantly, it can clearly distinguish the two types of changes. The framework design is generic and as such several state-of-the-art change point detection algorithms can fit in this design. Experiments on both synthetic and real-world networks show that this framework can accurately detect changes while achieving up to 800X speedup.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1706.02186/full.md

## Figures

29 figures with captions in the complete paper: https://tomesphere.com/paper/1706.02186/full.md

## References

25 references — full list in the complete paper: https://tomesphere.com/paper/1706.02186/full.md

---
Source: https://tomesphere.com/paper/1706.02186