Related papers: Short reachability networks
Cortical networks are hypothesized to rely on transient network activity to support short term memory (STM). In this paper we study the capacity of randomly connected recurrent linear networks for performing STM when the input signals are…
We consider the parameterized complexity of the problem of tracking shortest s-t paths in graphs, motivated by applications in security and wireless networks. Given an undirected and unweighted graph with a source s and a destination t,…
In this paper, we address the formal characterization of targets triggering cellular trans-differentiation in the scope of Boolean networks with asynchronous dynamics. Given two fixed points of a Boolean network, we are interested in all…
In this article, we take a closer look at the reliability of large minimal networks constructed by repeated compositions of the simplest possible networks. For a given number of devices $n=2^m$ we define the set of all the possible…
We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a…
Consider networks on $n$ vertices at average density 1 per unit area. We seek a network that minimizes total length subject to some constraint on journey times, averaged over source-destination pairs. Suppose journey times depend on both…
We consider the problem of determining the maximum number of moves required to sort a permutation of $[n]$ using cut-and-paste operations, in which a segment is cut out and then pasted into the remaining string, possibly reversed. We give…
We study the stability of network communication after removal of $q=1-p$ links under the assumption that communication is effective only if the shortest path between nodes $i$ and $j$ after removal is shorter than $a\ell_{ij} (a\geq1)$…
We establish that any even permutation from A_n moving at least [3n/4] + o(n) points is the commutator of a generating pair of A_n and a generating pair of S_n. From this we deduce an exponential lower bound on the number of systems of…
In this paper we study the time complexity of the single-source reachability problem and the single-source shortest path problem for directed unweighted graphs in the Broadcast CONGEST model. We focus on the case where the diameter $D$ of…
Recent work has made great progress in verifying the forwarding correctness of networks . However, these approaches cannot be used to verify networks containing middleboxes, such as caches and firewalls, whose forwarding behavior depends on…
Proximity networks are time-varying graphs representing the closeness among humans moving in a physical space. Their properties have been extensively studied in the past decade as they critically affect the behavior of spreading phenomena…
We study spatial networks constructed by randomly placing nodes on a manifold and joining two nodes with an edge whenever their distance is less than a certain cutoff. We derive the general expression for the connectivity distribution of…
Many real-world networks, ranging from subway systems to polymer structures and fungal mycelia, do not form by the incremental addition of individual nodes but instead grow through the successive extension and intersection of lines or…
Most networks of interest do not live in isolation. Instead they form components of larger systems in which multiple networks with distinct topologies coexist and where elements distributed amongst different networks may interact directly.…
What is the smallest number of random transpositions (meaning that we swap given pairs of elements with given probabilities) that we can make on an $n$-point set to ensure that each element is uniformly distributed -- in the sense that the…
Temporal graphs represent interactions between entities over the time. These interactions may be direct (a contact between two nodes at some time instant), or indirect, through sequences of contacts called temporal paths (journeys).…
Let $G_n$ be an $n$-dimensional recursive network. The $h$-embedded connectivity $\zeta_h(G_n)$ (resp. edge-connectivity $\eta_h(G_n)$) of $G_n$ is the minimum number of vertices (resp. edges) whose removal results in disconnected and each…
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to improve spatial throughput. In such networks, given a source…
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. The rest of the nodes are hidden, and do not provide any…