Reduced Arc-Weight Heterogeneity for Master Stability Analysis of Directed Networks
Abstract
Master stability analysis can be applied to directed networks even when their Laplacian matrices are not diagonalizable. Nevertheless, a diagonalizable Laplacian is easier to analyse because the perturbations governing synchronization separate into independent modes. This paper asks how many different positive coupling strengths are needed to obtain this simplification without adding or removing any directed connections. We first give an elementary construction showing that suitable positive weights exist for every weakly connected directed network and explain its relationship to stronger genericity results in the literature. We then introduce a measure of the smallest number of distinct coupling strengths required for diagonalizability. If a common coupling strength already produces a diagonalizable Laplacian, only one value is needed. For directed acyclic networks, we give a constructive upper bound based on the length of the longest directed path from a source. This bound is exact for rooted outward directed trees. Consequently, an outward star requires only one coupling value, whereas a directed path requires a different value on every arc. These results reduce coupling heterogeneity while retaining the simpler modal form of master stability analysis. Diagonalizability is treated as an analytical convenience, not as a sufficient condition for synchronization.
Related
- Global synchronization in time-varying directed higher-order networks
- DeGroot Dynamics on Multiplex Networks with Directed and Acyclic Interlayer Connectivities
- Unifying non-Markovian Dynamics and Agent Heterogeneity in Scalable Stochastic Networks
- Spreading the Damage: How Heterogeneity Delocalizes Fracture in Polymer Networks
- From Heterogeneity to Function: Enhanced Modular Dynamic Range in Hierarchical Brain Networks
BibTeX
@misc{arokiadoss2026reduced,
title = {{Reduced Arc-Weight Heterogeneity for Master Stability Analysis of Directed Networks}},
author = {Aandrew Baggio Sahaya Arokiadoss and G. Arunkumar},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2608.14439},
eprint = {2608.14439},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.14439},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Reduced Arc-Weight Heterogeneity for Master Stability Analysis of Directed Networks
AU - Aandrew Baggio Sahaya Arokiadoss
AU - G. Arunkumar
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2608.14439
UR - https://arxiv.org/abs/2608.14439
AB - Master stability analysis can be applied to directed networks even when their Laplacian matrices are not diagonalizable. Nevertheless, a diagonalizable Laplacian is easier to analyse because the perturbations governing synchronization separate into independent modes. This paper asks how many different positive coupling strengths are needed to obtain this simplification without adding or removing any directed connections. We first give an elementary construction showing that suitable positive weights exist for every weakly connected directed network and explain its relationship to stronger genericity results in the literature. We then introduce a measure of the smallest number of distinct coupling strengths required for diagonalizability. If a common coupling strength already produces a diagonalizable Laplacian, only one value is needed. For directed acyclic networks, we give a constructive upper bound based on the length of the longest directed path from a source. This bound is exact for rooted outward directed trees. Consequently, an outward star requires only one coupling value, whereas a directed path requires a different value on every arc. These results reduce coupling heterogeneity while retaining the simpler modal form of master stability analysis. Diagonalizability is treated as an analytical convenience, not as a sufficient condition for synchronization.
ER -