相关论文: A Unified Framework for Consensus and Synchronizat…

Lie symmetry group method is applied to study Newtonian incompressible fluid's equations flow in turbulent boundary layers. The symmetry group and its optimal system are given, and group invariant solutions associated to the symmetries are…

Rigorous conditions for cluster synchronization of Kuramoto oscillators are presented. The method of averaging plays an important role in stability analysis, but the standard Lyapunov's second method is not applicable due to the lack of…

We discuss the following proposition: Renormalization Group flow of quantum theory with a biased symmetry exhibits a fixed hypersurface at which the symmetry is exact. Such emergent symmetries may have important phenomenological…

We propose that the broad architecture of the renormalization group flow in quantum field theories is, at least in part, fixed by unitarity. The precise statement is summarized in the Unitarity Flow Conjecture, which states that the…

We define a class of machine-learned flow-based sampling algorithms for lattice gauge theories that are gauge-invariant by construction. We demonstrate the application of this framework to U(1) gauge theory in two spacetime dimensions, and…

Imagine a group of oscillators, each endowed with their own rhythm or frequency, be it the ticking of a biological clock, the swing of a pendulum, or the glowing of fireflies. While these individual oscillators may seem independent of one…

Consider the geodesic flow on a real-analytic closed hypersurface $M$ of $\mathbb{R}^n$, equipped with the standard Euclidean metric. The flow is entirely determined by the manifold and the Riemannian metric. Typically, geodesic flows are…

We propose a general framework to extend Flow Matching to homogeneous spaces, i.e. quotients of Lie groups. Our approach reformulates the problem as a flow matching task on the underlying Lie group by lifting the data distributions. This…

We study the emergence of synchronization in the Kuramoto model on a digraph in the presence of time delays. Assuming the digraph is strongly connected, we first establish a uniform bound on the phase diameter and subsequently prove the…

Multi-agent coordination algorithms with randomized interactions have seen use in a variety of settings in the multi-agent systems literature. In some cases, these algorithms can be random by design, as in a gossip-like algorithm, and in…

We investigate the emergence of synchronization in the second-order Kuramoto model with adaptive simplicial interactions on a globally connected network. This inertial Kuramoto framework describes systems, where oscillator frequencies…

In majority dynamics, agents located at the vertices of an undirected simple graph update their binary opinions synchronously by adopting those of the majority of their neighbors. On infinite unimodular transitive graphs (e.g., Cayley…

This paper investigates the asymptotic behavior of some common opinion dynamic models in a continuum of agents. We show that as long as the interactions among the agents are symmetric, the distribution of the agents' opinion converges. We…

Perhaps because of the elegance of the central limit theorem, it is often assumed that distributions in nature will approach singly-peaked, unimodal shapes reminiscent of the Gaussian normal distribution. However, many systems behave…

We analyze the asymptotic behavior of general first order Laplacian processes on digraphs. The most important ones of these are diffusion and consensus with both continuous and discrete time. We treat diffusion and consensus as dual…

Classical mechanics unfolds within absolute time and Euclidean space, yet our knowledge of where events occur, when they occur, and how motion evolves is inherently uncertain. The special Galilean group provides a natural setting for…

This paper is devoted to the study of multi-agent deterministic optimal control problems. We initially provide a thorough analysis of the Lagrangian, Eulerian and Kantorovich formulations of the problems, as well as of their relaxations.…

This paper is concerned with the consensus problem for multi-agent systems subject to communication delays between the neighboring agents. We consider a scenario where each agent is characterized by a general high-order linear system and…

In this paper, we consider multiple mobile agents moving in Euclidean space with point mass dynamics. Using a coordination control scheme, we can make the group generate stable flocking motion. The control laws are a combination of…

It is shown that the problem of reduction can be formulated in a uniform way using the theory of invariants. This provides a powerful tool of analysis and it opens the road to new applications of these algebras, beyond the context of…