Network Reconstruction in Consensus Algorithms with Hidden Agents
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913010283446272 |
|---|---|
| author | Tyloo, Melvyn |
| author_facet | Tyloo, Melvyn |
| contents | Reconstructing the parameters that encode the influence between model variables based on time-series measurements represents an outstanding question in the theory of complex network-coupled systems. Here, we propose a solution to this problem for a class of noisy leader-follower consensus algorithm, where one has access to measurements only from the followers but not from the leaders. Leveraging the directed Laplacian coupling of such systems, we present an autoregressive expansion of the observed dynamics which can be truncated at different orders, depending on the memory of the leaders. When their memory is short, this allows one to correctly reconstruct the full dynamical matrix with hidden leader agents, provided some additional assumption on the system to lift the degeneracy in the reconstruction. We illustrate and check the theory using numerical simulations for the cases of both a single and multiple hidden leaders. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_05709 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Network Reconstruction in Consensus Algorithms with Hidden Agents Tyloo, Melvyn Systems and Control Adaptation and Self-Organizing Systems Physics and Society Reconstructing the parameters that encode the influence between model variables based on time-series measurements represents an outstanding question in the theory of complex network-coupled systems. Here, we propose a solution to this problem for a class of noisy leader-follower consensus algorithm, where one has access to measurements only from the followers but not from the leaders. Leveraging the directed Laplacian coupling of such systems, we present an autoregressive expansion of the observed dynamics which can be truncated at different orders, depending on the memory of the leaders. When their memory is short, this allows one to correctly reconstruct the full dynamical matrix with hidden leader agents, provided some additional assumption on the system to lift the degeneracy in the reconstruction. We illustrate and check the theory using numerical simulations for the cases of both a single and multiple hidden leaders. |
| title | Network Reconstruction in Consensus Algorithms with Hidden Agents |
| topic | Systems and Control Adaptation and Self-Organizing Systems Physics and Society |
| url | https://arxiv.org/abs/2604.05709 |