Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2404.18734

Interplay between Contractivity and Monotonicity for Reaction Networks

Alon Duvall·M. Ali Al-Radhawi·Dhruv D. Jatkar·Eduardo Sontag
View original source ↗Read source document ↗Export metadata ↓

Abstract

We establish a new relationship between monotonicity and contractivity and use this connection to describe a new general class of weakly contractive reaction networks. The new class is characterized by the stoichiometry matrix of the reaction network admitting a precise matrix factorization that can be verified computationally. Reaction networks in this class are weakly contractive, implying global convergence to equilibria under appropriate technical conditions. Furthermore, we describe the novel subclass of cross-polytope networks. We also show that our results provide a unified proof of global convergence for several classes of networks previously studied in the literature. The practical relevance of the results is demonstrated by examples from systems biology and signaling pathways.

Explore related subjects

math.DSq-bio.MN

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alon Duvall, M. Ali Al-Radhawi, Dhruv D. Jatkar, Eduardo Sontag. 2025-06-21. Interplay between Contractivity and Monotonicity for Reaction Networks. https://arxiv.org/abs/2404.18734

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗
arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗
arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗