A network transformation mapping divides the communication graph into reachable and unreachable parts at each instant, enabling asymptotic synchronization by ensuring convergence amplitude during reachable intervals exceeds divergence during unreachable ones.
A distributed primal-dual push-sum algorithm on open multiagent networks,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Network Transformation Mapping Approach to Synchronization of Multi-Agent Systems With Disconnected Switching Topologies
A network transformation mapping divides the communication graph into reachable and unreachable parts at each instant, enabling asymptotic synchronization by ensuring convergence amplitude during reachable intervals exceeds divergence during unreachable ones.