Related papers: Echo State Condition at the Critical Point
The dynamics of competing opinions in social network play an important role in society, with many applications in diverse social contexts as consensus, elections, morality and so on. Here we study a model of interacting agents connected in…
We initiate the study of the inherent tradeoffs between the size of a neural network and its robustness, as measured by its Lipschitz constant. We make a precise conjecture that, for any Lipschitz activation function and for most datasets,…
The reliability of a network is an important parameter to consider when building a network. Different characteristics of the network can become unreliable over time or from other outside forces. In a simple setting, we model a network as a…
We study a system composed from two interdependent networks A and B, where a fraction of the nodes in network A depends on the nodes of network B and a fraction of the nodes in network B depends on the nodes of network A. Due to the…
Networks with only central force interactions are floppy when their average connectivity is below an isostatic threshold. Although such networks are mechanically unstable, they can become rigid when strained. It was recently shown that the…
The structure of many financial networks is protected by privacy and has to be inferred from aggregate observables. Here we consider one of the most successful network reconstruction methods, producing random graphs with desired link…
We show that the average of the maximum teleportation fidelities between all pairs of nodes in a large quantum repeater network is a measure of the resourcefulness of the network as a whole. We use simple Werner state-based models to…
A quantum phase transition is generally thought to imprint distinctive characteristics on the nonequilibrium dynamics of a closed quantum system. Specifically, the Loschmidt echo after a sudden quench to a quantum critical point $-$…
Current understanding of the critical outbreak condition on temporal networks relies on approximations (time scale separation, discretization) that may bias the results. We propose a theoretical framework to compute the epidemic threshold…
Social networks transmitting covert or sensitive information cannot use all ties for this purpose. Rather, they can only use a subset of ties that are strong enough to be ``trusted''. In this paper we consider transitivity as evidence of…
Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentralized learning. In these security-critical applications, it…
This paper focuses on the issue of network connectedness (NC) in security-constrained optimal transmission switching problems, which is complicated by branch contingencies and corrective line switching. Two criteria are firstly proposed…
Transmission line failures in power systems propagate non-locally, making the control of the resulting outages extremely difficult. In this work, we establish a mathematical theory that characterizes the patterns of line failure propagation…
Classical percolation theory underlies many processes of information transfer along the links of a network. In these standard situations, the requirement for two nodes to be able to communicate is the presence of at least one uninterrupted…
Using miniscope recordings of calcium fluorescence signals in the CA1 region of the hippocampus of mice, we monitor the neural activity of hippocampal regions while the animals are freely moving in an open chamber. Using a data-driven…
We study the phase transition from the persistence phase to the extinction phase for the SIRS (susceptible/ infected/ refractory/ susceptible) model of diseases spreading on small world network. We show the effects of all the parameters…
We study the uniform approximation of echo state networks with randomly generated internal weights. These models, in which only the readout weights are optimized during training, have made empirical success in learning dynamical systems.…
This paper considers the synchronization problem for networks of coupled nonlinear dynamical systems under switching communication topologies. Two types of nonlinear agent dynamics are considered. The first one is non-expansive dynamics…
A condition for reversibility (sufficiency) of a channel with respect to a given countable family of states with bounded rank is obtained. This condition shows that a quantum channel preserving the Holevo quantity of at least one (discrete…
In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a…