Related papers: Exploring Multiple Converged States of Network Con…
Credit networks rely on decentralized, pairwise trust relationships (channels) to exchange money or goods. Credit networks arise naturally in many financial systems, including the recent construct of payment channel networks in blockchain…
The functions of many networked systems in physics, biology or engineering rely on a coordinated or synchronized dynamics of its constituents. In power grids for example, all generators must synchronize and run at the same frequency and…
Targeted attacks against network infrastructure are notoriously difficult to guard against. In the case of communication networks, such attacks can leave users vulnerable to censorship and surveillance, even when cryptography is used. Much…
Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…
This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed…
In this paper, we provide a theoretical analysis for nonlinear discontinuous consensus protocols in networks of multiagents over weighted directed graphs. By integrating the analytic tools from nonsmooth stability analysis and graph theory,…
Entangled quantum networks provide great flexibilities and scalabilities for quantum information processing or quantum Internet. Most of results are focused on the nonlocalities of quantum networks. Our goal in this work is to explore new…
We study the collective dynamics of oscillator networks with phase-repulsive coupling, considering various network sizes and topologies. The notion of link frustration is introduced to characterize and quantify the network dynamical states.…
Although conditional branching between possible behavioural states is a hallmark of intelligent behavior, very little is known about the neuronal mechanisms that support this processing. In a step toward solving this problem we demonstrate…
A dynamical system approaching the first-order transition can exhibit a specific type of critical behavior known as self-organized bistability (SOB). It lies in the fact that the system can permanently switch between the coexisting states…
Software Defined Networking (SDN) is a novel network management technology, which currently attracts a lot of attention due to the provided capabilities. Recently, different works have been devoted to testing / verifying the (correct)…
Extending the quickest path problem to the network reliability, a new problem emerged which aims to assess the network reliability for transmitting at least d units of data from a source node to a sink node through one minimal path (MP)…
Network decomposition is a central tool in distributed graph algorithms. We present two improvements on the state of the art for network decomposition, which thus lead to improvements in the (deterministic and randomized) complexity of…
Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either close to unity, assuming connected paths between all nodes (mobile ad…
Many systems on our planet are known to shift abruptly and irreversibly from one state to another when they are forced across a "tipping point," such as mass extinctions in ecological networks, cascading failures in infrastructure systems,…
In many non-linear systems, such as plasma oscillation, boson condensation, chemical reaction, and even predatory-prey oscillation, the coarse-grained dynamics are governed by an equation containing anti-symmetric transitions, known as the…
We study a network model that couples the dynamics of link states with the evolution of the network topology. The state of each link, either A or B, is updated according to the majority rule or zero-temperature Glauber dynamics, in which…
Consider equal antiferromagnetic Heisenberg interactions between qubits forming a complex, nonbipartite network. We ask the question: How does the network topology determine the net magnetization of the ground state and to what extent is it…
In this paper, a global stability analysis is given for a rate-based congestion control system modeled by a nonlinear delayed differential equation. The model determines the dynamics of a single-source single-link network, with a…