A truncated autoregressive expansion of follower dynamics reconstructs the complete coupling matrix in consensus algorithms with hidden leaders when leaders have short memory and an extra non-degeneracy assumption holds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Network Reconstruction in Consensus Algorithms with Hidden Agents
A truncated autoregressive expansion of follower dynamics reconstructs the complete coupling matrix in consensus algorithms with hidden leaders when leaders have short memory and an extra non-degeneracy assumption holds.