Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.03391 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912688600252416 |
|---|---|
| author | da Mata, João Victor Galvão Hansson, Anders Andersen, Martin S. |
| author_facet | da Mata, João Victor Galvão Hansson, Anders Andersen, Martin S. |
| contents | Maximum likelihood estimation is effective for identifying dynamical systems, but applying it to large networks becomes computationally prohibitive. This paper introduces a maximum likelihood estimation method that enables identification of sub-networks within complex interconnected systems without estimating the entire network. The key insight is that under specific topological conditions, a sub-network's parameters can be estimated using only local measurements: signals within the target sub-network and those in the directly connected to the so-called separator sub-network. This approach significantly reduces computational complexity while enhancing privacy by eliminating the need to share sensitive internal data across organizational boundaries. We establish theoretical conditions for network separability, derive the probability density function for the sub-network, and demonstrate the method's effectiveness through numerical examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_03391 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Maximum Likelihood Estimation of Dynamic Sub-Networks with Missing Data da Mata, João Victor Galvão Hansson, Anders Andersen, Martin S. Systems and Control Maximum likelihood estimation is effective for identifying dynamical systems, but applying it to large networks becomes computationally prohibitive. This paper introduces a maximum likelihood estimation method that enables identification of sub-networks within complex interconnected systems without estimating the entire network. The key insight is that under specific topological conditions, a sub-network's parameters can be estimated using only local measurements: signals within the target sub-network and those in the directly connected to the so-called separator sub-network. This approach significantly reduces computational complexity while enhancing privacy by eliminating the need to share sensitive internal data across organizational boundaries. We establish theoretical conditions for network separability, derive the probability density function for the sub-network, and demonstrate the method's effectiveness through numerical examples. |
| title | Maximum Likelihood Estimation of Dynamic Sub-Networks with Missing Data |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2511.03391 |