Related papers: The second will be first: competition on directed …
Many community detection algorithms require the introduction of a measure on the set of nodes. Previously, a lot of efforts have been made to find the top-performing measures. In most cases, experiments were conducted on several datasets or…
In contrast to dyadic interactions, higher-order interactions may contain one another, with subgroups naturally embedded within larger groups. These containment patterns arise empirically in ecology, sociology, computer science and the…
This paper examines resilient dynamic leader-follower consensus within multi-agent systems, where agents share first-order or second-order dynamics. The aim is to develop distributed protocols enabling nonfaulty/normal followers to…
Our interest here is to find the invader in a two species, diffusive and competitive Lotka-Volterra system in the particular case of travelling wave solutions. We investigate the role of diffusion in homogeneous domains. We might expect a…
Transport and mixing properties of passive particles advected by an array of vortices are investigated. Starting from the integrable case, it is shown that a special class of perturbations allows one to preserve separatrices which act as…
Intercepting a criminal using limited police resources presents a significant challenge in dynamic crime environments, where the criminal's location continuously changes over time. The complexity is further heightened by the vastness of the…
In this paper, the leading term of the asymptotics of the number of possible final positions of a random walk on a directed Hamiltonian metric graph is found. Consideration of such dynamical systems could be motivated by problems of…
We study an Ising model in a network with disorder induced by the presence of both attractive and repulsive links. This system is subjected to a subthreshold signal, and the goal is to see how the response is enhanced for a given fraction…
We consider the competition of two mechanisms for adoption processes: a so-called complex threshold dynamics and a simple Susceptible-Infected-Susceptible (SIS) model. Separately, these mechanisms lead, respectively, to first order and…
In this work, we study the topological transition on the associated networks in a model proposed by Saeedian et al. (Scientific Reports 2019 9:9726), which considers a coupled dynamics of node and link states. Our goal was to better…
The structure of pipe networks minimizing the total energy dissipation rate is studied analytically. Among all the possible pipe networks that can be built with a given total pipe volume (or pipe lateral surface area), the network which…
We present a physically-inspired model and an efficient algorithm to infer hierarchical rankings of nodes in directed networks. It assigns real-valued ranks to nodes rather than simply ordinal ranks, and it formalizes the assumption that…
Power grids are undergoing major changes from a few large producers to smart grids build upon renewable energies. Mathematical models for power grid dynamics have to be adapted to capture, when dynamic nodes can achieve synchronization to a…
This paper examines how data inputs shape competition among artificial intelligences (AIs) in pricing games. The dataset assigns labels to consumers and divides them into different markets, thereby inducing multimarket contact among AIs. We…
In the bin covering problem, the goal is to fill as many bins as possible up to a certain minimal level with a given set of items of different sizes. Online variants, in which the items arrive one after another and have to be packed…
This paper considers the distributed robust suboptimal consensus control problem of linear multi-agent systems, with both H2 and H_infty performance requirements. A novel two-step complementary design approach is proposed. In the first…
Mechanisms of pattern formation---of which the Turing instability is an archetype---constitute an important class of dynamical processes occurring in biological, ecological and chemical systems. Recently, it has been shown that the Turing…
The graph layouts used for complex network studies have been mainly been developed to improve visualization. If we interpret the layouts in metric spaces such as Euclidean ones, however, the embedded spatial information can be a valuable…
Randomising networks using a naive `accept-all' edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities for…
We study resilient leader-follower consensus of multi-agent systems (MASs) in the presence of adversarial agents, where agents' communication is modeled by time-varying topologies. The objective is to develop distributed algorithms for the…