Algebraic network reconstruction of discrete dynamical systems
From MaRDI portal
Combinatorial aspects of commutative algebra (05E40) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Dynamical systems in biology (37N25) Applications of functional analysis in biology and other sciences (46N60) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) General biology and biomathematics (92B05) Systems biology, networks (92C42) Discrete mathematics (educational aspects) (97N70)
Abstract: We present a computational algebra solution to reverse engineering the network structure of discrete dynamical systems from data. We use monomial ideals to determine dependencies between variables that encode constraints on the possible wiring diagrams underlying the process generating the discrete-time, continuous-space data. Our work assumes that each variable is either monotone increasing or decreasing. We prove that with enough data, even in the presence of small noise, our method can reconstruct the correct unique wiring diagram.
This page was built for publication: Algebraic network reconstruction of discrete dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419624)
