Related papers: Unison as a Self-Stabilizing Wave Stream Algorithm…
Transient or partial synchronization can be used to do computations, although a fully synchronized network is frequently related to epileptic seizures. Here, we propose a homeostatic mechanism that is capable of maintaining a neuronal…
Anonymous voting is a voting method of hiding the link between a vote and a voter, the context of which ranges from governmental elections to decision making in small groups like councils or companies. In this paper, we propose a quantum…
Overlay management is the cornerstone of building robust and dependable Peer-to-Peer systems. A key component for building such overlays is the peer-sampling service, a mechanism that continuously supplies each node with a set of up-to-date…
Embodied agents require robust navigation systems to operate in unstructured environments, making the robustness of Simultaneous Localization and Mapping (SLAM) models critical to embodied agent autonomy. While real-world datasets are…
In this paper we present the self-stabilizing implementation of a class of token based algorithms. In the current work we only consider interactions between weak nodes. They are uniform, they do not have unique identifiers, are static and…
This work develops novel algorithms for high-performance networking in the presence of obstacles based on a method for communicating via ultrasonic rays reflected at the obstacles. The rays are curves determined by the variable speed of…
Data collected nowadays by social-networking applications create fascinating opportunities for building novel services, as well as expanding our understanding about social structures and their dynamics. Unfortunately, publishing…
We consider the task of anonymously transmitting a quantum message in a network. We present a protocol that accomplishes this task using the W state and we analyze its performance in a quantum network where some form of noise is present. We…
The basic inverse problem in spectral graph theory consists in determining the graph given its eigenvalue spectrum. In this paper, we are interested in a network of technological agents whose graph is unknown, communicating by means of a…
Enormous amounts of data collected from social networks or other online platforms are being published for the sake of statistics, marketing, and research, among other objectives. The consequent privacy and data security concerns have…
This study provides a foundational theoretical investigation into the mathematical existence and asymptotic properties of Ulanowicz's structural resilience. While ecological evidence suggests that sustainable systems gravitate toward an…
In this short note we provide a proof of boundedness of solutions for a network system composed of heterogeneous nonlinear autonomous systems interconnected over a directed graph. The sole assumptions imposed are that the systems are…
The stability (or instability) of synchronization is important in a number of real world systems, including the power grid, the human brain and biological cells. For identical synchronization, the synchronizability of a network, which can…
Mirror symmetry of a wave system imposes corresponding even or odd parity on its eigenmodes. For a discrete system, eigenmode parity on a specific subset of sites may also originate from so-called latent symmetry. This symmetry is hidden,…
Rather than anonymizing social graphs by generalizing them to super nodes/edges or adding/removing nodes and edges to satisfy given privacy parameters, recent methods exploit the semantics of uncertain graphs to achieve privacy protection…
We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous…
In this paper we consider a network of processors aiming at cooperatively solving linear programming problems subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…
Symbolic Regression (SR) is a powerful technique for automatically discovering mathematical expressions from input data. Mainstream SR algorithms search for the optimal symbolic tree in a vast function space, but the increasing complexity…
Deep operator networks (DeepONets) are trained to predict the linear amplification of instability waves in high-speed boundary layers and to perform data assimilation. In contrast to traditional networks that approximate functions,…
In this paper, we present an algorithm for optimizing synchronizability of complex dynamical networks. Based on some network properties, rewirings, i.e. eliminating an edge and creating a new edge elsewhere, are performed iteratively…