Algebraic network reconstruction of discrete dynamical systems
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.
PDF AbstractTasks
Datasets
Add Datasets
introduced or used in this paper
Results from the Paper
Submit
results from this paper
to get state-of-the-art GitHub badges and help the
community compare results to other papers.
Methods
No methods listed for this paper. Add
relevant methods here
