Attracting Rotations Obstruct Almost-Global Consensus on Spheres over Strongly Connected Graphs
Abstract
We study discrete-time consensus on the Euclidean unit sphere, where weighted combinations of neighboring states are normalized to unit length. For symmetric weights on connected undirected graphs and ambient dimension d≥3, earlier results establish instability of non-consensus fixed points under suitable weight conditions. For directed graphs on the unit circle, earlier results show that fixed points other than consensus and antipodal configurations occur only for a measure-zero set of weights. We show that these conclusions do not extend directly to general strongly connected directed graphs in higher dimensions. First, we construct full-rank non-consensus fixed points whose tangent eigenvalues all equal one, showing that strict linear instability need not hold. In a separate construction, for every d≥3, we present a sparse strongly connected graph admitting full-rank fixed points on an open set of its permitted weights. Our main result establishes robust counterexamples to almost-global consensus: attracting rotating motions exist for d=2 with every n≥3 and for d=3 with every n≥6. These motions are locally asymptotically stable modulo common rotations and have asymptotic phase. They persist on open sets of strictly positive weight matrices. For each such matrix, an open set of initial configurations approaches neither consensus nor any fixed configuration. Thus the absence of full-rank non-consensus fixed points does not ensure almost-global convergence to consensus.
Related
- Sharp bounds and extremal structure of minimally strongly k-connected digraphs
- Eccentric Connectivity Index of Cartesian product and Strong product of Strongly Connected Digraphs
- Generating Functions and the Minimum Spectral Radius in Strongly Connected Digraphs with m+2 Edges
- Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs
- Droplets obstruct Onsager-type solutions of the Ising model in a magnetic field
BibTeX
@misc{sidorenko2026attracting,
title = {{Attracting Rotations Obstruct Almost-Global Consensus on Spheres over Strongly Connected Graphs}},
author = {Galina Sidorenko and Johan Thunberg},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.28341},
eprint = {2610.28341},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.28341},
}
RIS
TY - UNPB
TI - Attracting Rotations Obstruct Almost-Global Consensus on Spheres over Strongly Connected Graphs
AU - Galina Sidorenko
AU - Johan Thunberg
PY - 2026
DA - 2026/10/20
PB - arXiv
DO - 10.48550/arxiv.2610.28341
UR - https://arxiv.org/abs/2610.28341
AB - We study discrete-time consensus on the Euclidean unit sphere, where weighted combinations of neighboring states are normalized to unit length. For symmetric weights on connected undirected graphs and ambient dimension d≥3, earlier results establish instability of non-consensus fixed points under suitable weight conditions. For directed graphs on the unit circle, earlier results show that fixed points other than consensus and antipodal configurations occur only for a measure-zero set of weights. We show that these conclusions do not extend directly to general strongly connected directed graphs in higher dimensions. First, we construct full-rank non-consensus fixed points whose tangent eigenvalues all equal one, showing that strict linear instability need not hold. In a separate construction, for every d≥3, we present a sparse strongly connected graph admitting full-rank fixed points on an open set of its permitted weights. Our main result establishes robust counterexamples to almost-global consensus: attracting rotating motions exist for d=2 with every n≥3 and for d=3 with every n≥6. These motions are locally asymptotically stable modulo common rotations and have asymptotic phase. They persist on open sets of strictly positive weight matrices. For each such matrix, an open set of initial configurations approaches neither consensus nor any fixed configuration. Thus the absence of full-rank non-consensus fixed points does not ensure almost-global convergence to consensus.
ER -