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
How to let Claude Code and Codex talk directly across two computers without copy-pasting logs
0dev.to
Why Is There a Delay When I’m Typing? (I Tested the Bottlenecks So You Don’t Have To)
0dev.to

Moving City GIS Into Unreal Engine: Coordinate Systems, LOD, and the Boring Parts
0dev.to
My AI Agent Said 'Done.' It Wasn't. A Field Guide to Trusting Nothing an Agent Tells You
0dev.to
Bridging Context and Execution: An Engineering Assessment of Connected AI Workflows
0dev.to
把 AI CLI 包成 OpenAI 相容 API:從 stdin、JSON 輸出到逾時處理(附可跑範例)
0dev.to