Compressive Transition Path Sampling
read the original abstract
Algorithms for rare event complex systems simulations are proposed. Compressed Sensing (CS) has {\it revolutionized} our understanding of limits in signal recovery and has forced us to re-define Shannon-Nyquist sampling theorem for sparse recovery. A formalism to reconstruct trajectories and transition paths via CS is illustrated as proposed algorithms. The implication of under-sampling is quite important. This formalism could increase the tractable time-scales {\it immensely} for simulation of statistical mechanical systems and rare event simulations. While, long time-scales are known to be a major hurdle and a challenge for realistic complex simulations for rare events. The outline of how to implement, test and possible challenges on the proposed approach are discussed in detail.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.