Related papers: From Consensus to Robust Clustering: Multi-Agent S…
Conventional cluster-robust inference can be invalid when data contain clusters of unignorably large size. We formalize this issue by deriving a necessary and sufficient condition for its validity, and show that this condition is frequently…
Recently, there has been substantial interest in clustering research that takes a beyond worst-case approach to the analysis of algorithms. The typical idea is to design a clustering algorithm that outputs a near-optimal solution, provided…
When dissipative particles are left alone, their fluctuation energy decays due to collisional interactions, clusters build up and grow with time until the system size is reached. When the effective dissipation is strong enough, this may…
A method to study strongly interacting quantum many-body systems at and away from criticality is proposed. The method is based on a MERA-like tensor network that can be efficiently and reliably contracted on a noisy quantum computer using a…
Structural balance theory has been developed in sociology and psychology to explain how interacting agents, e.g., countries, political parties, opinionated individuals, with mixed trust and mistrust relationships evolve into polarized…
We study the behaviour of catalytically active droplets in multi-component conserved mixtures affected by noise. Working in the thin interface limit, we analytically determine the state diagram of the system, characterized by multiple…
This paper considers the resilient multi-dimensional consensus problem in networked systems, where some of the agents might be malicious (or faulty). We propose a multi-dimensional consensus algorithm, where at each time step each healthy…
The inclusion of a fragmentation mechanism in population balance equations introduces complex interactions that make the analytical or even computational treatment much more difficult than for the pure aggregation case. This is specially…
Consensus clustering, a fundamental task in machine learning and data analysis, aims to aggregate multiple input clusterings of a dataset, potentially based on different non-sensitive attributes, into a single clustering that best…
We investigate the spatio-temporal dynamics of coupled chaotic systems with nonlocal interactions, where each element is coupled to its nearest neighbors within a finite range. Depending upon the coupling strength and coupling radius, we…
Consensusability is an important property for many multi-agent systems (MASs) as it implies the existence of networked controllers driving the states of MAS subsystems to the same value. Consensusability is of interest even when the MAS…
Stability is a desirable property of complex ecosystems. If a community of interacting species is at a stable equilibrium point then it is able to withstand small perturbations to component species' abundances without suffering adverse…
The vast majority of real-world networks are scale-free, loopy, and sparse, with a power-law degree distribution and a constant average degree. In this paper, we study first-order consensus dynamics in binary scale-free networks, where…
Clustering is one of the mayor collective phenomena observed in active matter. We study the overdamped motion of interacting active Brownian particles in two dimensions. An instability in the pair correlation function causes the onset of…
Social mobilization often fails not for a lack of collective interest, but because of fierce competition between rival movements for the same limited pool of participants. We generalize the classic threshold model of collective behavior to…
We study cluster assignment in homogeneous diffusive multi-agent networks. Given the number of clusters and agents within each cluster, we design the network graph ensuring the system will converge to the prescribed cluster configuration.…
Input-to-state stability (ISS) unifies global asymptotic stability with respect to variations of initial conditions with robustness with respect to external disturbances. First, we present Lyapunov characterizations for input-to-state…
The coexistence of sparsity and clustering (non-vanishing average fraction of triangles per node) is one of the few structural features that, irrespective of finer details, are ubiquitously observed across large real-world networks. This…
We study the consensus problem in a synchronous distributed system of $n$ nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the…
Consensus of autonomous agents is a benchmark problem in cooperative control. In this paper, we consider standard continuous-time averaging consensus policies (or Laplacian flows) over time-varying graphs and focus on robustness of…