Backend
Topology Identification of Directed Signed Networks via Repelling Laplacians
arXiv cs.SY0 views
arXiv:2611.06327v1 Announce Type: new Abstract: We address the problem of simultaneously identifying the interaction topology and synchronizing a network interconnected over a directed graph that exhibits both cooperative and antagonistic interactions, modeled via a repelling Laplacian matrix. We propose an adaptive control protocol built on a node-centric regressor formulation, in which the network is driven to track a persistently exciting auxiliary network. We then propose a time-varying adaptive gain to remove the need for global knowledge of the network. We establish uniform semiglobal practical asymptotic stability of the estimation errors when the excitation depends only on measurable errors. Numerical simulations validate the theoretical results.
Source：https://arxiv.org/abs/2611.06327PreviousTransversal Passivity: Dissipation Relative to Input and Output ManifoldsNextOn the Optimality of Implicit Feedback in Markov Decision Processes over Imperfect Links
Related posts
Quantum estimates for classical polynomial optimization
0arXiv cs.NA
A Tensor-Network Chebyshev--Galerkin Method for Boundary-Value Problems in Computational Mechanics
0arXiv cs.NA
Linear adaptive variable time step schemes for the anisotropic phase field dendritic crystal growth model
0arXiv cs.NA
Magnetic Bloch eigenvalue problems in nonuniform periodic magnetic fields: a Fourier-finite difference approach
0arXiv cs.NA
Phantoms and Disclosures: A Statistical Framework for Auditing Privacy in Synthetic Data
0arXiv stat.ML
When the Agent Learns Too: Learning to Incentivize with Unobserved Rewards
0arXiv stat.ML