Related papers: Topological Characterization of Stabilizing Consen…
In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous systems, approximate…
The recently introduced continuous Hopfield network (see Ramsauer et al.) exhibits large memorization capabilities, which manifest as attractive fixed points of its update rule -- a differentiable function consisting of two linear mappings…
We introduce a fairly general concept of functional equation for $k$-tuples of functions $f_1,\dots,f_k\colon X \to Y$ between arbitrary sets. The homomorphy equations for mappings between groups and other algebraic systems, as well as…
The famous asynchronous computability theorem (ACT) relates the existence of an asynchronous wait-free shared memory protocol for solving a task with the existence of a simplicial map from a subdivision of the simplicial complex…
The paper proposes a surprisingly simple characterization of a large class of models of distributed computing, via an agreement function: for each set of processes, the function determines the best level of set consensus these processes can…
This work interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization of some vector variables with respect to the actions of a finite group. We show how the symmetrization framework we develop…
Two types of general nonlinear consensus protocols are considered in this paper, namely the systems with nonlinear measurement and communication of the agents' states, respectively. The solutions of the systems are understood in the sense…
The safe-consensus task was introduced by Afek, Gafni and Lieber (DISC' 09) as a weakening of the classic consensus. When there is concurrency, the consensus output can be arbitrary, not even the input of any process. They showed that…
In this note, we discuss the problem of consensus finding in communication networks of agents with dynamically switching topologies. In particular, we consider the case of directed networks with unbalanced matrices of communication rates.…
The theory of optimal choice sets is a solution theory that has a long and well-established tradition in social choice and game theories. Some of important general solution concepts of choice problems when the set of best alternatives does…
In this paper, we study finite-time state consensus problems for continuous nonlinear multi-agent systems. Building on the theory of finite-time Lyapunov stability, we propose sufficient criteria which guarantee the system to reach a…
While the very first consensus protocols for the synchronous model were designed to match the worst-case lower bound, deciding in exactly t+1 rounds in all runs, it was soon realized that they could be strictly improved upon by early…
Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic…
This paper investigates the problem of securing exponentially fast consensus (exponential consensus for short) for identical agents with finite-dimensional linear system dynamics over dynamic network topology. Our aim is to find the weakest…
This paper introduces semiopen and semiclosed soft sets in soft topological spaces. The notions of interior and closure are generalized using these sets. A detail study is carried out on properties of semiopen, semiclosed soft sets, semi…
Based on the convergence of their infinitesimal generators in the mixed topology, we provide a stability result for strongly continuous convex monotone semigroups on spaces of continuous functions. In contrast to previous results, we do not…
Automatic software remodularisation is typically cast as a single-objective optimization problem. While recent metaheuristics have improved search efficiency, real-world architecture recovery must reconcile the conflicting attributes of…
A substantial portion of distributed computing research is dedicated to terminating problems like consensus and similar agreement problems. However, non-terminating problems have been intensively studied in the context of self-stabilizing…
In this paper, we study the consensus problem for networked dynamic systems with arbitrary initial states, and present some structural characterization and direct construction of consensus functions. For the consensus problem under similar…
This paper establishes a general topological condition under which the semilocal stability of a set-valued mapping can be exactly determined by its local stability properties. Specifically, we investigate the relationship between the…