Related papers: Computing knock out strategies in metabolic networ…
We present a method to decompose biochemical networks into subnetworks based on the global geometry of the network. This method enables us to analyse the full hierarchical organisation of biochemical networks and is applied to 43 organisms…
Inspired by scenarios where the strategic network design and defense or immunisation are of the central importance, Goyal et al. [3] defined a new Network Formation Game with Attack and Immunisation. The authors showed that despite the…
The branching process (BP) approach has been successful in explaining the avalanche dynamics in complex networks. However, its applications are mainly focused on unipartite networks, in which all nodes are of the same type. Here, motivated…
In this paper, we present algorithms for designing networks that are robust to node failures with minimal or limited number of links. We present algorithms for both the static network setting and the dynamic network setting; setting where…
The understanding of molecular cell biology requires insight into the structure and dynamics of networks that are made up of thousands of interacting molecules of DNA, RNA, proteins, metabolites, and other components. One of the central…
Maximizing the damage by attacking specific nodes of the combat network can efficiently disrupt enemies' defense capability, protect our critical units, and enhance the resistance to the destruction of system-of-system~(SOS). However, the…
Genome-scale metabolic models have become a fundamental tool for examining metabolic principles. However, metabolism is not solely characterized by the underlying biochemical reactions and catalyzing enzymes, but also affected by regulatory…
A highly efficient formulation of moment equations for stochastic reaction networks is introduced. It is based on a set of binomial moments that capture the combinatorics of the reaction processes. The resulting set of equations can be…
In this paper, we propose a distributed algorithm for the minimum dominating set problem. For some especial networks, we prove theoretically that the achieved answer by our proposed algorithm is a constant approximation factor of the exact…
We show that deep learning models, and especially architectures like the Transformer, originally intended for natural language, can be trained on randomly generated datasets to predict to very high accuracy both the qualitative and…
We consider a network design problem with random arc capacities and give a formulation with a probabilistic capacity constraint on each cut of the network. To handle the exponentially-many probabilistic constraints a separation procedure…
Deep learning has become the state-of-art tool in many applications, but the evaluation and training of deep models can be time-consuming and computationally expensive. The conditional computation approach has been proposed to tackle this…
Most deep architectures for image classification--even those that are trained to classify a large number of diverse categories--learn shared image representations with a single model. Intuitively, however, categories that are more similar…
Systems Biology is a fundamental field and paradigm that introduces a new era in Biology. The crux of its functionality and usefulness relies on metabolic networks that model the reactions occurring inside an organism and provide the means…
The advent of sensor networks presents untapped opportunities for synthesis. We examine the problem of synthesis of behavioral specifications into networks of programmable sensor blocks. The particular behavioral specification we consider…
Control theory has seen recently impactful applications in network science, especially in connections with applications in network medicine. A key topic of research is that of finding minimal external interventions that offer control over…
This paper analyses of a stochastic model of a chemical reaction network with three types of chemical species ${\cal R}$, ${\cal M}$ and ${\cal U}$ that interact to transform a flow of external resources, the chemical species ${\cal Q}$, to…
Binding and unbinding of ligands to specific sites of a macromolecule are one of the most elementary molecular interactions inside the cell that embody the computational processes of biological regulations. The interaction between…
We present a symbolic algorithmic approach that allows to compute invariant manifolds and corresponding reduced systems for differential equations modeling biological networks which comprise chemical reaction networks for cellular…
Networks are ubiquitous throughout science and engineering. A number of methods, including some from our own group, have explored how one goes about computing or predicting the dynamics of networks given information about internal models of…