Related papers: Exploring Multiple Converged States of Network Con…
Graph spanners are fundamental graph structures with a wide range of applications in distributed networks. We consider a standard synchronous message passing model where in each round $O(\log n)$ bits can be transmitted over every edge (the…
The rapid advancement of technology underscores the critical importance of robustness in complex network systems. This paper presents a framework for investigating the structural robustness of interconnected network models. This paper…
We study here the problem of determining the majority type in an arbitrary connected network, each vertex of which has initially two possible types. The vertices may have a few additional possible states and can interact in pairs only if…
We consider stationary consensus protocols for networks of dynamic agents with switching topologies. The measure of the neighbors' state is affected by Unknown But Bounded disturbances. Here the main contribution is the formulation and…
A procedure is developed and tested to enforce synchronicity in a family of Stuart-Landau oscillators, coupled through a symmetric network. The proposed method exploits network plasticity, as an inherent non autonomous drive. More…
A hybrid network is a static (electronic) network that is augmented with optical switches. The Reconfigurable Routing Problem (RRP) in hybrid networks is the problem of finding settings for the optical switches augmenting a static network…
We study pretty good quantum state transfer (i.e., state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an…
The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand…
In this paper we establish a necessary and sufficient stability condition for a stochastic ring network. Such networks naturally appear in a variety of applications within communication, computer, and road traffic systems. They typically…
For reliable and consistent quantum information processing carried out on a quantum network, the network structure must be fully known and a desired initial state must be accurately prepared on it. In this paper, for a class of spin…
Signed networks have been a topic of recent interest in the network control community as they allow studying antagonistic interactions in multi-agent systems. Although dynamical characteristics of signed networks have been well-studied,…
We consider generic pure $n$-qubit states and a general class of pure states of arbitrary dimensions and arbitrarily many subsystems. We characterize those states which can be reached from some other state via Local Operations assisted by…
Robustness of network of networks (NON) has been studied only for dependency coupling (J.X. Gao et. al., Nature Physics, 2012) and only for connectivity coupling (E.A. Leicht and R.M. D Souza, arxiv:0907.0894). The case of network of n…
We describe a new method for the random sampling of connected networks with a specified degree sequence. We consider both the case of simple graphs and that of loopless multigraphs. The constraints of fixed degrees and of connectedness are…
A map $\mathcal{P}$ is tensor stable positive (tsp) if $\mathcal{P}^{\otimes n}$ is positive for all $n$, and essential tsp if it is not completely positive or completely co-positive. Are there essential tsp maps? Here we prove that there…
The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$. For fixed $n$ and $m$, the uniformly most reliable problem asks which graph with $n$ vertices…
Networks are fundamental building blocks for representing data, and computations. Remarkable progress in learning in structurally defined (shallow or deep) networks has recently been achieved. Here we introduce evolutionary exploratory…
Boolean networks (BNs) are discrete-time systems where nodes are inter-connected (here we call such connection rule among nodes as network structure), and the dynamics of each gene node is determined by logical functions. In this paper, we…
Our current world is linked by a complex mesh of networks where information, people and goods flow. These networks are interdependent each other, and present structural and dynamical features different from those observed in isolated…
Much of the past work in network analysis has focused on analyzing discrete graphs, where binary edges represent the "presence" or "absence" of a relationship. Since traditional network measures (e.g., betweenness centrality) utilize a…