Synchronization on Riemannian manifolds: Multiply connected implies multistable
Johan Markdahl

TL;DR
This paper investigates how the topology of Riemannian manifolds influences the stability of multi-agent synchronization, revealing that multiply connected manifolds can lead to multistability in network dynamics.
Contribution
It extends existing synchronization results to Riemannian manifolds with complex topology, showing that large cycles induce multistability in multi-agent systems.
Findings
Networks with large cycles exhibit multistability on multiply connected manifolds.
Results generalize stability of splay and twist states from Kuramoto and quantum sync models.
Multistability occurs when the manifold contains a closed geodesic of minimal length.
Abstract
This note concerns the evolution of multi-agent systems on networks over Riemannian manifolds. The motion of each agent is governed by the gradient descent flow of a disagreement function that is a sum of (squared) distances between pairs of communicating agents. Two metrics are considered: geodesic distances and chordal distances for manifolds that are embedded in an ambient Euclidean space. We show that networks which, roughly speaking, are dominated by a large cycle yield a multistable systems if the manifold is multiply connected or contains a closed geodesic that is of locally minimum length in a space of closed curves. This result summarizes previous results on the stability of splay or twist state equilibria of the Kuramoto model on the circle and its generalization, the quantum sync model on SO(n). It also extends them to the Lohe model on U(n).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Synchronization on Riemannian manifolds:
Multiply connected implies multistable
Johan Markdahl Johan Markdahl ([email protected]) is with the Luxembourg Centre for Systems Biomedicine at the University of Luxembourg.Manuscript received Month XY, 2019; revised Month XY, 2019.
Abstract
This note concerns the evolution of multi-agent systems on networks over Riemannian manifolds. The motion of each agent is governed by the gradient descent flow of a disagreement function that is a sum of (squared) distances between pairs of communicating agents. Two metrics are considered: geodesic distances and chordal distances for manifolds that are embedded in an ambient Euclidean space. We show that networks which, roughly speaking, are dominated by a large cycle yield a multistable systems if the manifold is multiply connected or contains a closed geodesic that is of locally minimum length in a space of closed curves. This result summarizes previous results on the stability of splay or twist state equilibria of the Kuramoto model on and its generalization, the quantum sync model on . It also extends them to the Lohe model on .
Index Terms:
Synchronization, Consensus, Agents and autonomous systems, Network analysis and control, Nonlinear systems, Optimization.
I Introduction
This note studies how the stability properties of multi-agent systems on networks over a Riemannian manifold relates to its geometry and topology. The focus is on two algorithms which we refer to as refer to as geodesic consensus and chordal consensus [1, 2, 3]. Both algorithms are gradient descent flows of quadratic disagreement functions, defined in terms of geodesic distances and chordal distances respectively. We show that if the manifold is multiply connected, then both algorithms yield multistable closed-loop systems under communication topologies that are dominated by one large cycle. The equilibrium configurations are characterized by local coherence between neighboring agents but global incoherence of the system as a whole. This result is interesting since it summarizes previous results in mathematical physics on the multistability of the Kuramoto model and some of its high-dimensional generalizations [4, 5]. Moreover, it suggests some rough guidelines for the control problem of which synchronization algorithm to execute on a given manifold.
To gain an intuitive understanding of these results, imagine a network consisting of a single cycle where the agents are beads that have been threaded on a string. The string consists of piecewise geodesic curves, each connecting a pair of neighboring agents. Any configuration where the beads are equidistantly distributed over the string is refered to as a splay state. We can select initial conditions that guarantee the string to be a continuous curve forwards in time. If the manifold is simply connected, then a continuous shortening of the string to a point results in consensus. If the manifold is multiply connected, then, for strings that are not homeomorphic to a point, reaching synchronization requires two neighboring agents to be threaded away from each other. This goes against the design principles of both the chordal and geodesic consensus algorithms. Instead of reaching consensus, the agents will tend to a set of splay states that is asymptotically stable.
There are several differences between the two algorithms [3]. Chordal consensus requires the Riemannian manifold to be embedded in an ambient Euclidean space whereby the Euclidean distance metric can be used. Geodesic consensus can be defined intrinsically without reference to an embedding space. The algorithms are identical when is an Euclidean space. For agent configurations such that all agents are close to their neighbors, the algorithms can be expected to behave similarly since short chordal distances approximate geodesics. In practice, chordal consensus is prefered over geodesic consensus since chordal distances are easier to calculate than geodesics and squared geodesic distances are non-smooth even on nice manifolds like the circle [6].
Consider the Kuramoto model on networks over the circle in the special case that all frequencies (drift terms) are equal. It is well-known that cycle graphs yield multistability [4, 7]. They result in a splay or twisted state where the phases of the agents are spread equidistantly over the circle. The chordal consensus algorithm extends the Kuramoto model with equal frequencies to Riemannian manifolds. Generalized twist states are unstable on the high-dimensional Kuramoto model on Stiefel manifolds for which [8]. However, generalized twist states are stable on [5], which is a submanifold of . This apparent disparity is partly explained by our result that multiply connectedness implies multistability. Indeed, the circle and are multiply connected whereas is simply connected for . We introduce splay states for geodesic consensus as equidistant partitions of closed geodesics and show that they are asymptotically stable.
The geodesic and chordal consensus algorithms are multistable, wherefore ad-hoc control designs that yield almost global asymptotical stable (agas) sync on manifolds were proposed [2, 9]. However, those algorithms are more demanding in terms of computation and sensing. The author showed that the chordal consensus algorithm yields agas sync on some specific manifolds [10, 8]. This paper shows that a manifold being simply connected is a necessary condition for the geodesic and chordal algorithm to yield agas sync. However, as we show by counter-example, simple connectedness is not sufficient. As such the paper provides the following rough guideline for agas sync: if the manifold is simply connected then the geodesic and chordal consensus algorithms can be considered. Otherwise, an ad-hoc algorithm is preferable.
The main contribution of this note is summarized as follows: (i) we introduce generalized splay states which are equilibria of the geodesic consensus system and show their asymptotical stability under a condition on the geometry of , (ii) we show that the geodesic and chordal consensus algorithms are multistable for a certain class of graphs under a condition on the topology of . These are the first results on the geodesic and chordal consensus algorithms (in their full generality [1, 2, 3]) which concerns equilibria different from consensus. Moreover, they summarize several known results. Multistability of geodesic consensus on has been shown by simulation [9]. Multistability of the chordal consensus has been established in special cases such as [4] and [5]. This paper unifies such results and extends them to other systems, most notably to the Lohe model on [11].
II Preliminaries
Let be a complete Riemannian manifold. The set is a real, smooth manifold and the metric tensor is an inner product on the tangent space at . A closed manifold is compact and without boundary. All closed manifolds are complete. A manifold is simply connected if each closed curve can be continuously deformed to a point. A multiply connected manifold is path connected but contains at least one closed curve which cannot be continuously deformed to a point. See [12, 13] for more details on Riemannian geometry.
The arc length of any curve is
[TABLE]
Let denote the set of piecewise smooth curves on . The length of a geodesic curve is the geodesic distance
[TABLE]
A curve , of minimal length is a geodesic (up to parametrization) from to . Completeness ensures that at least one geodesic exists between any pair of points. The concatenation of and with is the curve , . In this paper, whenever we concatenate two or more curves, it is assumed that the parametrizations match up.
Let denote the set of closed curves on , i.e., curves such that . Let denote the image of a curve. Introduce an equivalence relation on , where if and . Denote
[TABLE]
The Hausdorff distance between two sets , where is a metric space, is
[TABLE]
We let be the metric space. Define another metric
[TABLE]
such that for all . Then is a metric space which admits the notions of optimization.
Proposition 1** (Klingenberg [14]).**
Assume that the Riemannian manifold is closed and multiply connected. Then contains a closed geodesic that is a local minimizer of the curve length function over .
Example 2**.**
The manifold is multiply connected, yet it does not contain a closed geodesic of locally minimum length. Proposition 1 does not apply since is open.
Example 3**.**
The torus is multiply connected. A closed curve around the torus tube cannot be continuously deformed to a point. If that curve is a circle, then it is a local minimizer of in the space of closed curves. The sphere is simply connected. The closed geodesics on are great circles, e.g., the equator. The equator is not a local minimizer of since there are closed curves of constant latitude arbitrarily close to the equator that are shorter than it, see Fig. 1. On the capsule, in the regions where the cylinder and hemispheres meet, there are curves which are saddle points of . They are minimizers of on the cylinder but not on the hemispheres. On both the torus and the peanut there is a single closed curve which is a strict local minimizer of . The torus is multiply connected but the peanut is simply connected. Simple connectedness does not rule out the existence of a closed curve of minimum length.
Assume that the manifold is geodesically complete which implies that there exists at least one geodesic path between any two points . Moreover, assume that for some open neighborhood of , , there exists a unique geodesic from to each . The largest value for which this holds is the injectivity radius at . We assume that .
Let denote the exponential map. Given a point and a tangent vector , yields the point that lies at a distance from along the geodesic through with as a tangent vector. Let be the largest open, path connected set containing [math] on which is a diffeomorphism. Denote . Note that the injectivity radius is the radius of the largest geodesic ball contained in . The inverse of the exponential map is well-defined on . It is the logarithm map given by .
The directional derivative of a smooth function at along is given by , where satisfies , . The intrinsic gradient of is defined as the vector which satisfies
[TABLE]
for all . In particular, it holds that for all .
III Gradient flows on Riemannian manifolds
Let be a function on a Riemannian manifold. The gradient descent flow of on is given by
[TABLE]
for any . The solutions , , to (3) are refered to as flow lines. Note that the equilibria of (3) are the critical points of , i.e., the points for which . It may hence be advantageous to adopt an optimization perspective. The relation between the stability properties of the equilibria of a gradient descent flow and the critical points of the potential function is somewhat complicated, so we need to define precise notions to specify it. See [15] for more details about these issues for gradient descent flows on .
Definition 4**.**
A set of minimizers of a real function from a metric space is said to be a local minimizer if for some there is an open neighborhood such that for all . Moreover, if the inequality is strict for all , then is said to be a strict local minimizer.
Definition 5**.**
A set of minimizers of a real function from a metric space is said to be isolated critical if for some there is an open neighborhood such that is void of critical points.
Example 6** (continues=exa:cont).**
Consider the manifolds in Fig. 1. The torus and peanut have closed geodesics that are strict minimizers of on . The sphere and capsule do not.
Proposition 7**.**
Let be closed and take any that is . The flow has a unique solution which exists for all . The potential function decreases along flow lines of . For any flow line, as .
Proof.
See [13]. ∎
Proposition 8** (Lyapunov theorem).**
Let be closed and take any that is . Let be a compact set of local minimizers of . If is a strict local minimizer, then is a Lyapunov stable equilibrium set of . If is also isolated critical, then it is asymptotically stable.
Proof.
By definition of being a strict local minimizer, for any sufficiently small , there exists a closed geodesic ball of radius such that for all . Let denote the boundary of . Let . Let
[TABLE]
There exists a such that . The potential function decreases along flow lines by Proposition 7. If a flow line starting in passed through , then would have had to have increased, a contradiction.
Assume that is also an isolated critical set. The flow lines are contained in a compact set . Each line approaches a set of critical points by Proposition 7. All of the critical points in belong to by assumption.∎
A subset has measure zero if for every smooth chart in an atlas of , the set has Lebesgue measure zero in . A subset has strictly positive Riemannian measure if it does not have measure zero. Let denote the flow of (3), i.e., the solution of (3) at time for the initial condition . Define
[TABLE]
Definition 9** (Multistable).**
Let be a closed manifold. The gradient flow (3) is multistable if there exists two sets of strictly positive Riemannian measure such that no points of can be path connected to via a path in .
IV Synchronization on Riemannian manifolds
Consider a network of interacting agents. The interaction topology is modeled by an undirected graph where the nodes represent agents and an edge indicates that agent and can communicate. Assume that the graph is connected, whereby there is at least an indirect path of communication between any two agents. In this note, we mainly focus on the cycle graph
[TABLE]
For notational convenience we use modular arithmetic when adding the indices of , i.e., .
The state of agent belongs to the manifold . The states are grouped together in a tuple, . The consensus manifold of a Riemannian manifold is the diagonal space of given by the set
[TABLE]
where it is assumed that is connected. The consensus set is a Riemannian manifold; in fact, it is diffeomorphic to by the map . The terms synchronization and consensus are interchangeable in this note:
Definition 10**.**
The gradient flow (3) is said to synchronize, or equivalently, to reach consensus, if .
This note mainly concerns the local behaviour of a multi-agent system where the distance between any pair of interacting agents can be made arbitrarily small by increasing . As such, we work on subsets of the manifold where all geodesics are uniquely defined. Under these circumstances, define the notion of a closed broken geodesic:
Definition 11** (Closed broken geodesic).**
Let denote agent positions and be a geodesic curve with , (using the convention ). By a closed broken geodesic interpolating we refer to the closed curve given by the concatenation .
A closed broken geodesic can be intuitively grasped by imagining the agents as being beads on string, see Section I. Closed broken geodesics will be used to represent cycle networks .
IV-A Two gradient descent flows
This paper concerns two synchronization algorithms, which we refer to as geodesic consensus and chordal consensus. Both algorithms are gradient descent flows of disagreement functions, i.e., potential functions of the form
[TABLE]
where are weights, , is a metric, is a smoothing function to be specifed, and is an undirected graph which represents the network. The geodesic algorithm uses the geodesic distance as metric whereas the chordal algorithm uses the chordal distance , i.e., the Euclidean distance in an ambient Euclidean space.
The consensus-seeking multi-agent system on obtained from the gradient descent flow is
[TABLE]
where and denotes the gradient with respect to obtained by holding the other agent states constant. Agent does not have access to , but can calculate
[TABLE]
where is the set of neighbors of . Symmetry of gives whereby it follows that .
From a control design perspective, we assume that the dynamics of each agent take the form with . Furthermore, we assume that agent is equipped with sensors that allow it to calculate in some small neighborhood around its current position. It follows that agent can also calculate . Note that it requires more information and is more computationally demanding to calculate compared to [3].
Non-uniqueness of geodesic curves results in a loss of smoothness and the gradient of being undefined. Following [3], in Section IV-B we design to make a function everywhere. Note that this issue does not arise in chordal consensus. For chordal consensus we choose whereby the potential simplifies as
[TABLE]
The potential is smooth for any smooth manifold. The chordal metric is sometimes preferable over the geodesic metric for this reason, see [6] for further discussion.
Another distinction can be made between intrinsic consensus and extrinsic consensus, referring to the concepts of intrinsic and extrinsic geometry. By intrinsic consensus, we refer to a consensus algorithm defined on a manifold that is an abstract topological space. By extrinsic consensus we refer to an algorithm that is defined on a manifold that is embedded in an ambient Euclidean space . The geodesic consensus algorithm can be either intrinsic or extrinsic. The chordal consensus algorithm can only be used in an extrinsic setting where the chordal distance is defined.
IV-B Geodesic consensus
Recall that denotes the injectivity radius of . Define
[TABLE]
where is a small constant and is a smooth function that interpolates and in a manner such that is on . Define:
Algorithm 12** (Geodesic consensus).**
The closed-loop system for under the feedback is given by
[TABLE]
Algorithm 12 is a bounded confidence opinion consensus model [16], i.e., agent and cannot influence each other when . Note that Algorithm 12 simplifies as
[TABLE]
for . In Section V we show that there exists a forward invariant set such that if , then the dynamics (10) are of the form (11) and remain on that form at all future times. Because of this result, in the rest of this note, our focus with respect to the geodesic consenus algorithm is on the dynamics (11) and the potential
[TABLE]
which we refer to as the simplified forms.
IV-C Chordal consensus
Let the manifold be embedded in an ambient Euclidean space , where is the induced metric. Denote , where is the inclusion map. Denote . Given , any matrix can be uniquely decomposed as , where and are orthogonal projections on the tangent space and normal space , respectively.
Define , where is an open neighborhood of in , based on the Euclidean or chordal distance
[TABLE]
Let , where . The gradient is
[TABLE]
where denotes the gradient on with respect to and is the extrinsic gradient in the ambient Euclidean space with respect to [17].
The gradient descent flow on is given by:
Algorithm 13** (Chordal consensus).**
The closed-loop system for under the feedback is given by
[TABLE]
Note that if all have constant norm, , then , whereby the dynamics (14) simplify to
[TABLE]
The assumption of implies that the manifold can be embedded in as a subset of a sphere with radius . This is trivially true of the -sphere. Some important such spaces are the Stiefel and Grassmannian manifolds. Examples of systems of the form (15) includes: the Kuramoto model on in Cartesian coordinates (see Example 16), the Lohe model on the -sphere [11, 18, 10], the quantum sync model on [5], the Kuramoto model on the Stiefel manifold [10], and the Lohe model on (see Example 14).
Example 14**.**
Consider the Lohe model of synchronization on [11],
[TABLE]
where , is a Hermitian matrix, , and denotes complex conjugation. The case of can be reduced to after a linear change of coordinates.
Embed in using the realification map
[TABLE]
which is a linear homomorphism, i.e.,
[TABLE]
for any and [19]. Let . Note that since for any , whereby and by continuity of and .
Consider the dynamics of in the case of ,
[TABLE]
where and . The last equality can be established based on the fact that [19]. Note that (17) is the gradient descent flow (15) of on .
V Main results
This section consists of two parts, V-A and V-B. First, we define splay states of the geodesic consensus system over cycle graphs and show that they are asymptotically stable. Second, we show that the geodesic and chordal systems are multistable over a larger family of graphs if is multiply connected.
V-A Splay states
Splay or twisted states are two terms used to refer to one set of equilibria of the Kuramoto model [4, 7]. In this note we use splay states when referring to configurations of the geodesic consensus system and twisted states when referring to configurations of the chordal consensus algorithm.
Definition 15** (Splay state).**
Consider the system (10) on the cycle graph (4). Assume there is a unique geodesic from to . Assume is a closed geodesic. The system is said to be in a splay state if
[TABLE]
for some .
Note that if does not depend on , then any splay state satisfies . The interpretation is that the positions of the agents partitions the closed geodesic into consecutive segments of equal length.
Example 16**.**
The Lohe model on with , is
[TABLE]
where , [11]. The Kuramoto model in polar coordinates is obtained for with , , as
[TABLE]
If (or ), then the change of variables (or ) transforms the system to (15). The sets of -twisted states where , are given by
[TABLE]
where is a rotation by radians.
Twisted states are equilibria of the chordal consensus system on . Twisted states are unstable for [10], but asymptotically stable on [4]. Those results are consistent with this note since is simply connected for , but is multiply connected. Twisted states and other related configurations are of relevance for applications in neuroscience, deep-brain stimulation, and vehicle coordination [7].
Note that definition (15), which concerns the geodesic consensus system, does not use a parameter like . If a closed curve wraps around the area in its interior times, then the total length is times the length of a single loop.
Proposition 17**.**
Splay states as given by Definition 15 are equilibria of the geodesic consensus system (11) over the cycle graph defined by (4).
Proof.
The dynamics of agent are
[TABLE]
Note that
[TABLE]
Because is a closed geodesic, the tangent vectors and are negatively aligned. There hence exists a such that
[TABLE]
Proposition 17 shows that splay states are critical points of the disagreement function . If the closed geodesic is a local minimizer of the curve length function in the space given by (2), then we can say more: the set of splay states over are local minimizers of . Consider two types of local variations of around : (i) variations along and (ii) variations that take the agents off . In case (i), minimality of is given by the equidistant partition of when the weights are constant. This follows from the fact that for a given mean , the value of is the least when all are equal, which is a special instance of a much more general symmetry principle in optimization [20]. In case (ii), minimality of is given by the fact that is a local minimizer of the curve length function. The proof of our main result, Theorem 18, shows that we can combine these observations to cover all local variations of .
Theorem 18**.**
Let be a geodesically complete Riemannian manifold. Suppose contains a closed geodesic of locally minimum length in the space given by (2). Let denote a geodesic from to and let
[TABLE]
denote a set of splay states on . Any element of is a local minimizer of given by (8) with . If is a strict local minimizer of , then is a strict local minimizer of .
Proof.
Because the closed geodesic is a local minimizer of the curve length in the space , there is an open ball such that for all it holds that . Let . By continuity of the exponential map, due to for all , all closed broken geodesics interpolating points in a neighborhood of are continuous. There is a neighborhood such that for all it holds that the closed broken geodesic , where is a geodesic from to , and . Hence and given by (8) simplifies to the form (12) for all .
It suffices to prove local optimality of in . The problem we wish to solve is
[TABLE]
The constraint
[TABLE]
holds on . Since this constaint is redundant on we can add it to (20) without any loss of optimality, forming
[TABLE]
Let a fixed be a feasible solution to (V-A). Introduce a quadratic program,
[TABLE]
Note that a feasible solution to (QPy) is given by the vector
[TABLE]
and that this solution has the same objective value on (QPy) as the solution has on (V-A).
We will show that is, in general, a suboptimal solution to (QPy). Let denote the value of the optimal solution to (QPy) as a function of . We will show that
[TABLE]
which implies optimality of . So far we have only shown the first relation. The second relation is true by the definition of . It remains to establish the last two relations.
The positivity constraint in (QPy) can be relaxed. To see this, note that if for some , then does not help to satisfy the constraint while simultaneously incurring a cost to the objective function value. An infeasible solution can be constructed where is replaced with [math], which reduces the cost. To obtain a feasible solution, continue decreasing the values of other variables until the constraint holds. This results in the objective function value decreasing a second time, thus yielding a superior solution.
By relaxing the positivity constraints we obtain the equality constrained quadratic program
[TABLE]
The optimal solution to (V-A) is optimal to (QPy) and vice versa. There is no loss of generality in focusing on (V-A).
The optimization problem (V-A) can be solved using the Karush-Kuhn-Tucker conditions for optimality [21],
[TABLE]
where is given by , , with is diagonal, and is a Lagrange multiplier. The solution is optimal by convexity of (V-A).
Denote
[TABLE]
It can easily be verified that
[TABLE]
and solving (23) yields . The value of the optimal solution to (V-A) is
[TABLE]
Recall that is a local minimizer of and denotes the optimal value to (V-A) and (QPy). From (24) it follows that
[TABLE]
which is the third relation in (22). The last relation in (22), , follows due to being a closed geodesic whereby any set of points regenerates as their closed broken geodesic. This property allows us to construct a solution to (V-A) from the solution to (V-A). The optimal solution to the problem (V-A) tells us how to position the agent on . The set of such points is by inspection of . Assume that is a strict minimizer of in , then the inequality in (25) is strict. ∎
Corollary 19**.**
Let be closed and suppose Theorem 18 applies. If is a strict local minimizer of in , then is a Lyapunov stable equilibrium set of (10). If is also an isolated critical point, then is asympotically stable.
Proof.
Lyapunov stability follows from Proposition 8.
Asymptotical stability also follows from Proposition 8 if is an isolated critical set of . Assume that is not isolated. Let and be a neighborhood of as detailed in the proof of Theorem 18. Let , be a nonincreasing sequence of such neighborhoods of with . Since is not an isolated critical set, each contains at least one critical point of . Then satisfies
[TABLE]
Let and denote the geodesics which connect , and . Equation (26) implies that the tangent vectors of and are (negatively) aligned at . As such, the curve is a geodesic. Moreover, is a closed geodesic by induction. Closed geodesics are critical points of in . A geodesic being arbitrarily close to contradicts the assumption that is isolated. ∎
V-B Multistability
Multistability as given by Definition 9 requires two sets of limits to be disjoint. The first is the consensus manifold:
Proposition 20**.**
Suppose that is closed. The consensus manifold given by (5) is a Lyapunov stable equilibrium manifold of Algorithm 12 and 13.
Proof.
Consider the disagreement function given by (6) and assume is either defined as in (9) or by . Then and if and only if . The fact that is closed implies that is compact. The consensus manifold is Lyapunov stable by Proposition 8. ∎
Note that geodesic consensus, Algorithm 12, is trivially multistable since it is a bounded confindence model [16]. It is also multistable due to the presence of splay states, as described in Section V-A. Next, we show that this multistability extends from the cycle graph to networks that are, roughly speaking, dominated by a large cycle.
Recall that denotes the injectivity radius at , i.e., the radius of the largest geodesic ball such that the exponential map is a diffeomorphism at . Moreover, recall . Suppose is embedded in and let . Let denote the radius of the largest ball defined in terms of the chordal distance,
[TABLE]
such that . Let . The following result relates to .
Lemma 21**.**
Let be a Riemannian manifold. For every pair , any ball defined in terms of the geodesic distance,
[TABLE]
contains a ball defined in terms of the chordal distance
[TABLE]
where the radius is strictly positive. Suppose is closed, then implies .
Proof.
Suppose the first statement is false. Then, for some and every , there exists an with . Form a sequence of such points where . It follows that , but . This contradicts the continuity of .
Suppose , then there is a sequence such that . If is closed, then has a subsequence which converges to some . That contradicts the first result of this theorem. ∎
Theorem 22**.**
Let be a closed, multiply connected, smooth Riemannian manifold such that . Suppose there is a cycle subgraph, , , and an such that the closed broken geodesic generated by is not homotopic to a point on . Then the following two implications hold:
- i)
For geodesic consensus, suppose at satisfies
[TABLE]
where , then the flow (10) does not converge to .
- ii)
For chordal consensus, , suppose at satisfies
[TABLE]
then the flow (14) does not converge to .
Proof.
Note that in the intrinsic case,
[TABLE]
wherefore is of the simplified form (12) at . Moreover, remains of the simplified form for all future times since it decreases along flow lines.
Likewise, for chordal consensus, the inequality holds for all . By the definition of , this implies that for all .
For both geodesic and chordal consensus, it follows that is a diffeomorphism on a set that includes for all . In particular, the geodesic connecting and is a continuous function of . Moreover, the closed broken geodesic interpolating is a continuous function of time for . The system evolution hence corresponds to a continuous deformation of . Suppose that the system reaches consensus, i.e., that converges to a single point. This contradicts the assumption of the theorem that is not homotopic to a point at time [math].∎
Corollary 23**.**
The geodesic and chordal consensus systems, (10) and (14), are multistable in the sense of Definition 9 under the assumptions of Theorem 22.
Proof.
By Proposition 20 there is some ball from which the system cannot escape an arbitrarily small ball . If we view the system as a set of points on , then, at any time , there is a ball around some point such that all .
If the system is not multistable, then, by Definition 9 and Theorem 22, there is some time such that contains a closed curve that is not homotopic to a point. Note that as . For , the open ball is homotopy equivalent to , where is the dimension of . However, cannot contain a curve that is not homotopic to a point, so we have a contradiction.∎
Example 24**.**
The cycle graph satisfies the requirements of Theorem 22, as do generalizations thereof such as the circulant graphs, , with
[TABLE]
where we use addition modulo . Note that being linear in is important. Position the agents so that the closed broken geodesic generated by is an approximation of . More precisely, let the agents be approximately equidistantly spaced on small tubular neighborhood of on whereby . Then
[TABLE]
The assumptions of Theorem 22 are satisfied for pairs with since as for any fixed under the assumption that \sum_{\{i,j\}\in\mathcal{E}_{N,k}}w_{ij}\in\mathchoice{{\scriptstyle\mathcal{O}}}{{\scriptstyle\mathcal{O}}}{{\scriptscriptstyle\mathcal{O}}}{\scalebox{0.7}{\scriptscriptstyle\mathcal{O}}}(N^{2}) due to . For example, with we get \sum_{\{i,j\}\in\mathcal{E}_{N,k}}w_{ij}=kN\in\mathcal{O}(N)\subset\mathchoice{{\scriptstyle\mathcal{O}}}{{\scriptstyle\mathcal{O}}}{{\scriptscriptstyle\mathcal{O}}}{\scalebox{0.7}{\scriptscriptstyle\mathcal{O}}}(N^{2}). Intuitively speaking, if we fix , then we can keep increasing by and move the agents a little closer to each other each time until the assumptions hold.
Example 25**.**
The Lohe models (16) and (17) are multistable since and are multiply connected.
Note that Example 25 is a novel result that extends some findings in [5] from to . This extension is not trivial since is a subset of zero measure in .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Tron, B. Afsari, and R. Vidal. Riemannian consensus for manifolds with bounded curvature. IEEE Transactions on Automatic Control , 58(4):921–934, 2013.
- 2[2] A. Sarlette and R. Sepulchre. Consensus optimization on manifolds. SIAM Journal on Control and Optimization , 48(1):56–76, 2009.
- 3[3] A. Aydogdu, S.T. Mc Quade, and N.P. Duteil. Opinion dynamics on a general compact Riemannian manifold. Networks & Heterogeneous Media , 12(3):489–523, 2017.
- 4[4] D.A. Wiley, S.H. Strogatz, and M. Girvan. The size of the sync basin. Chaos: An Interdisciplinary Journal of Nonlinear Science , 16(1):015103, 2006.
- 5[5] L. De Ville. Synchronization and stability for quantum Kuramoto. Journal of Statistical Physics , 174(1):160–187, 2018.
- 6[6] J.H. Conway, R.H. Hardin, and N.J.A. Sloane. Packing lines, planes, etc.: Packings in Grassmannian spaces. Experimental mathematics , 5(2):139–159, 1996.
- 7[7] F. Dörfler and F. Bullo. Synchronization in complex networks of phase oscillators: A survey. Automatica , 50(6):1539–1564, 2014.
- 8[8] J. Markdahl, J. Thunberg, and J. Gonçalves. High-dimensional Kuramoto models on the Stiefel manifold synchronize complex networks almost globally. Automatica , page to appear, 2020.
