Related papers: Source-only realizations, weakly reversible defici…
Networks observed in real world like social networks, collaboration networks etc., exhibit temporal dynamics, i.e. nodes and edges appear and/or disappear over time. In this paper, we propose a generative, latent space based, statistical…
Deep neural networks achieve unprecedented performance levels over many tasks and scale well with large quantities of data, but performance in the low-data regime and tasks like one shot learning still lags behind. While recent work…
We consider steady states of dynamics that have an underlying network structure. We study how a steady state responds to small perturbations in the network parameters and how this sensitivity is connected to the network structure. We…
A main theoretical interest in biology and physics is to identify the nonlinear dynamical system (DS) that generated observed time series. Recurrent Neural Networks (RNNs) are, in principle, powerful enough to approximate any underlying DS,…
We propose a family of models to study the evolution of ties in a network of interacting agents by reinforcement and penalization of their connections according to certain local laws of interaction. The family of stochastic dynamical…
We study a system of interacting particles that randomly react to form new particles. The reaction flux is the rescaled number of reactions that take place in a time interval. We prove a dynamic large-deviation principle for the reaction…
The automated inference of physically interpretable (bio)chemical reaction network models from measured experimental data is a challenging problem whose solution has significant commercial and academic ramifications. It is demonstrated,…
In this paper, we propose a new method to identify biochemical reaction networks (i.e. both reactions and kinetic parameters) from heterogeneous datasets. Such datasets can contain (a) data from several replicates of an experiment performed…
We define catalytic networks as chemical reaction networks with an essentially catalytic reaction pathway: one which is on in the presence of certain catalysts and off in their absence. We show that examples of catalytic networks include…
Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search in small-world networks, we conduct an experimental analysis of a dynamic algorithm that produces small-world networks. We find that the algorithm…
Gene expression dynamics satisfying given input-output relationships were investigated by evolving the networks for an optimal response. We found three types of networks and corresponding dynamics, depending on the sensitivity of gene…
In this paper we consider a class of interacting particle systems on dynamic random networks, in which the joint dynamics of vertices and edges acts as one-way feedback, i.e., edges appear and disappear over time depending on the state of…
Networks of dynamical systems play an important role in various domains and have motivated many studies on the control and analysis of linear dynamical networks. For linear network models considered in these studies, it is typically…
Network scientists often use complex dynamic processes to describe network contagions, but tools for fitting contagion models typically assume simple dynamics. Here, we address this gap by developing a nonparametric method to reconstruct a…
We study a family of networks of autocatalytic reactions, which we call hyperchains, that are a generalization of hypercycles. Hyperchains, and the associated dynamical system called replicator equations, are a possible mechanism for…
Hundreds of defenses have been proposed to make deep neural networks robust against minimal (adversarial) input perturbations. However, only a handful of these defenses held up their claims because correctly evaluating robustness is…
An approach to find a weak form of shadowing is developed. We consider homeomorphisms of a compact metric space. It is proved that every pseudotrajectory with sufficiently small errors contains at least one subsequence that can be shadowed…
In a recent paper, it was shown that (i) any reciprocal system with a proper transfer function possesses a signature-symmetric realization in which each state has either even or odd parity; and (ii) any reciprocal and passive behavior can…
We investigate the problem of learning to generate complex networks from data. Specifically, we consider whether deep belief networks, dependency networks, and members of the exponential random graph family can learn to generate networks…
We consider a natural class of reaction networks which consist of reactions where either two species can inactivate each other (i.e., sequestration), or some species can be transformed into another (i.e., transmutation), in a way that gives…