English
Related papers

Related papers: Graphic requirements for multistationarity

200 papers

For a directed acyclic graph, there are two known criteria to decide whether any specific conditional independence statement is implied for all distributions factorized according to the given graph. Both criteria are based on special types…

Statistics Theory · Mathematics 2009-04-03 Giovanni M. Marchetti , Nanny Wermuth

Many dynamical systems arising in biology and other areas exhibit multistationarity (two or more positive steady states with the same conserved quantities). Although deciding multistationarity for a polynomial dynamical system is an…

Molecular Networks · Quantitative Biology 2019-02-08 Alicia Dickenstein , Mercedes Perez Millan , Anne Shiu , Xiaoxian Tang

Gene interaction graphs aim to capture various relationships between genes and represent decades of biology research. When trying to make predictions from genomic data, those graphs could be used to overcome the curse of dimensionality by…

We present parity conditions under which a toy rail network is one-way, i.e., whether a direction can be assigned across the network so that all train journeys are completely consistent with it or completely consistent with its opposite. We…

Combinatorics · Mathematics 2025-09-16 Dai Akita , Daniel Thorsten Schenz

The real Jacobian conjecture claims that if $F=\left(f^1,\ldots,f^n\right):\mathbb{R}^n\rightarrow \mathbb{R}^n$ is a polynomial map such that $\det DF$ is nowhere zero, then $F$ is a global injective. The first part is to study the…

Dynamical Systems · Mathematics 2021-01-19 Yuzhou Tian , Yulin Zhao

A graph $G$ contains a strong parity factor $F$ if for every subset $X\subseteq V(G)$ with $|X|$ even, $G$ has a spanning subgraph $F$ satisfying $\delta(F)\geq1$, $d_F(u)\equiv1$ (mod 2) for any $u\in X$, and $d_F(v)\equiv0$ (mod 2) for…

Combinatorics · Mathematics 2024-10-10 Sizhong Zhou , Tao Zhang , Qiuxiang Bian

We study the multistationarity for the reaction networks with one-dimensional stoichiometric subspaces, and we focus on the networks admitting finitely many positive steady states. We prove that if a network admits multistationarity, then…

Dynamical Systems · Mathematics 2021-08-24 Kexin Lin , Xiaoxian Tang , Zhishuo Zhang

Recent genomic and bioinformatic advances have motivated the development of numerous random network models purporting to describe graphs of biological, technological, and sociological origin. The success of a model has been evaluated by how…

Molecular Networks · Quantitative Biology 2007-05-23 Manuel Middendorf , Etay Ziv , Carter Adams , Jen Hom , Robin Koytcheff , Chaya Levovitz , Gregory Woods , Linda Chen , Chris Wiggins

The central theme of complex systems research is understanding the emergent macroscopic properties of a system from the interplay of its microscopic constituents. Here, we ask what conditions a complex network of microscopic dynamical units…

Dynamical Systems · Mathematics 2012-07-25 Anne-Ly Do , Stefano Boccaletti , Jeremias Epperlein , Stefan Siegmund , Thilo Gross

Biomolecular networks have already found great utility in characterizing complex biological systems arising from pair-wise interactions amongst biomolecules. Here, we review how graph theoretical approaches can be applied not only for a…

Molecular Networks · Quantitative Biology 2018-12-03 Heeralal Janwa , Steven E. Massey , Julian Velev , Bud Mishra

Research shows that gene duplication followed by either repurposing or removal of duplicated genes is an important contributor to evolution of gene and protein interaction networks. We aim to identify which characteristics of a network can…

Molecular Networks · Quantitative Biology 2021-07-27 Peter Crawford-Kahrl , Robert R. Nerem , Bree Cummins , Tomas Gedeon

The structure of the network underlying many complex systems, whether artificial or natural, plays a significant role in how these systems operate. As a result, much emphasis has been placed on accurately describing networks using network…

Physics and Society · Physics 2015-03-29 Peter Overbury , Luc Berthouze

A graphon satisfies the $H$-property if graphs sampled from it contain a Hamiltonian decomposition almost surely, which in turn implies that the corresponding network topologies are, e.g., structurally stable and structurally ensemble…

Optimization and Control · Mathematics 2024-02-16 Mohamed-Ali Belabbas , Xudong Chen

Gaussian Graphical Models provide a convenient framework for representing dependencies between variables. Recently, this tool has received a high interest for the discovery of biological networks. The literature focuses on the case where a…

Methodology · Statistics 2010-05-13 Julien Chiquet , Yves Grandvalet , Christophe Ambroise

In this work, we propose a global model selection criterion to estimate the graph of conditional dependencies of a random vector based on a finite sample. By global criterion, we mean optimizing a function over the entire set of possible…

Statistics Theory · Mathematics 2023-11-06 Florencia Leonardi , Magno T. F Severino

An important problem in biological modeling is choosing the right model. Given experimental data, one is supposed to find the best mathematical representation to describe the real-world phenomena. However, there may not be a unique model…

Dynamical Systems · Mathematics 2024-07-03 Cashous Bortner , Nicolette Meshkat

Given a Bayesian network structure (directed acyclic graph), the celebrated d-separation algorithm efficiently determines whether the network structure implies a given conditional independence relation. We show that this changes drastically…

Computational Complexity · Computer Science 2024-05-14 Cheuk Ting Li

We study linear systems of equations with coefficients in a generic partially ordered ring $R$ and a unique solution, and seek conditions for the solution to be nonnegative, that is, every component of the solution is a quotient of two…

Algebraic Geometry · Mathematics 2017-09-07 Meritxell Sáez , Elisenda Feliu , Carsten Wiuf

The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…

Combinatorics · Mathematics 2013-02-19 Simon M. Smith , Thomas W. Tucker , Mark E. Watkins

We analyze pattern formation on a network of cells where each cell inhibits its neighbors through cell-to-cell contact signaling. The network is modeled as an interconnection of identical dynamical subsystems each of which represents the…

Dynamical Systems · Mathematics 2014-07-25 Ana S. Rufino Ferreira , Murat Arcak