NPAP: Network Partitioning and Aggregation Package for Python
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918497138769920 |
|---|---|
| author | Anarmo, Marco Stöckl, Benjamin Werner, Yannick Wogrin, Sonja |
| author_facet | Anarmo, Marco Stöckl, Benjamin Werner, Yannick Wogrin, Sonja |
| contents | NPAP (Network Partitioning and Aggregation Package) is an open-source Python library for reducing the spatial complexity of network graphs. Built on NetworkX, it provides an accessible standalone package designed to be readily integrated with other software and frameworks. Instead of treating the spatial reduction process as a single action, NPAP explicitly splits it into two distinct steps: partitioning, which assigns vertices (nodes) to groups (clusters), and aggregation, which reduces the network based on a given assignment. NPAP's strategy pattern architecture allows users to employ and register custom partitioning and aggregation strategies seamlessly without modifying the core code. Currently, NPAP provides 13 different partitioning strategies and two pre-defined aggregation profiles. Although initially developed with a focus on power systems, its architecture is general-purpose and applicable to any network graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_12137 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | NPAP: Network Partitioning and Aggregation Package for Python Anarmo, Marco Stöckl, Benjamin Werner, Yannick Wogrin, Sonja Social and Information Networks Optimization and Control NPAP (Network Partitioning and Aggregation Package) is an open-source Python library for reducing the spatial complexity of network graphs. Built on NetworkX, it provides an accessible standalone package designed to be readily integrated with other software and frameworks. Instead of treating the spatial reduction process as a single action, NPAP explicitly splits it into two distinct steps: partitioning, which assigns vertices (nodes) to groups (clusters), and aggregation, which reduces the network based on a given assignment. NPAP's strategy pattern architecture allows users to employ and register custom partitioning and aggregation strategies seamlessly without modifying the core code. Currently, NPAP provides 13 different partitioning strategies and two pre-defined aggregation profiles. Although initially developed with a focus on power systems, its architecture is general-purpose and applicable to any network graph. |
| title | NPAP: Network Partitioning and Aggregation Package for Python |
| topic | Social and Information Networks Optimization and Control |
| url | https://arxiv.org/abs/2605.12137 |