Related papers: Absolute concentration robustness: Algebra and geo…
Causal Abstraction (CA) theory provides a principled framework for relating causal models that describe the same system at different levels of granularity while ensuring interventional consistency between them. Recent methods for learning…
Pure infiniteness (in sense of E.Kirchberg and M.R{\o}rdam) is considered for C*-algebras arising from singly generated dynamical systems. In particular, Cuntz-Krieger algebras and their generalizations, i.e., graph-algebras and O_A of an…
In a recent paper, J. Chem. Phys. 162, 214101 (2025), a novel approach for the rigidification of a molecular cluster was proposed, in which starting with an all-atom (AA) potential, a coarse-grained (CG) potential for the associated cluster…
The study of dynamical systems on complex networks is of paramount importance in engineering, given that many natural and artificial systems find a natural embedding on discrete topologies. For instance, power grids, chemical reactors and…
Understanding how biochemical systems settle into stable states, such as how protein concentrations reach equilibrium, is central to explaining cellular behavior and designing synthetic biological circuits. However, existing analytical…
This paper concerns the long-term behavior of population systems, and in particular of chemical reaction systems, modeled by deterministic mass-action kinetics. We approach two important open problems in the field of Chemical Reaction…
We present conditions which guarantee a parametrization of the set of positive equilibria of a generalized mass-action system. Our main results state that (i) if the underlying generalized chemical reaction network has an effective…
Criticality is a behavioral state in dynamical systems that is known to present the highest computation capabilities, i.e., information transmission, storage, and modification. Therefore, such systems are ideal candidates as a substrate for…
Steady states of alternating-current (AC) circuits have been studied in considerable detail. In 1982, Baillieul and Byrnes derived an upper bound on the number of steady states in a loss-less AC circuit [IEEE TCAS, 29(11): 724--737] and…
We identify the thermodynamic conditions necessary to observe indefinite growth in homogeneous open chemical reaction networks (CRNs) satisfying mass action kinetics. We also characterize the thermodynamic efficiency of growth by…
Quantifying the evolution and complexity of materials is of importance in many areas of science and engineering, where a central open challenge is developing experimental complexity measurements to distinguish random structures from evolved…
Randomly packing spheres of equal size into a container consistently results in a static configuration with a density of ~64%. The ubiquity of random close packing (RCP) rather than the optimal crystalline array at 74% begs the question of…
The mechanisms for explaining how a stable asymmetric chemical system can be formed from a symmetric chemical system, in the absence of any asymmetric influence other than statistical fluctuations, have been developed during the last…
Chemical reaction network theory provides powerful tools for rigorously understanding chemical reactions and the dynamical systems and differential equations that represent them. A frequent issue with mathematical analyses of these networks…
Embedding computation in biochemical environments incompatible with traditional electronics is expected to have wide-ranging impact in synthetic biology, medicine, nanofabrication and other fields. Natural biochemical systems are typically…
We introduce a novel self-supervised deep clustering approach tailored for unstructured data without requiring prior knowledge of the number of clusters, termed Adaptive Self-supervised Robust Clustering (ASRC). In particular, ASRC…
We develop a new density-based clustering algorithm named CRAD which is based on a new neighbor searching function with a robust data depth as the dissimilarity measure. Our experiments prove that the new CRAD is highly competitive at…
Information geometry is based on classical Legendre duality but allows to incorporate additional structure such as algebraic constraints and Bregman divergence functions. It is naturally suited, and has been successfully used, to describe…
Matrix completion is one of the crucial tools in modern data science research. Recently, a novel sampling model for matrix completion coined cross-concentrated sampling (CCS) has caught much attention. However, the robustness of the CCS…
We study the set of output stable configurations of chemical reaction deciders (CRDs). It turns out that CRDs with only bimolecular reactions (which are almost equivalent to population protocols) have a special structure that allows for an…