相关论文: Time-Reversible Random Number Generators : Solutio…

I provide the algorithm that solves the challenge proposed by Wm. G. Hoover and Carol G. Hoover in their recent paper "Time-Reversible Random Number Generators", arXiv:1305.0961, with an explanation on how to derive it analytically.

In PDE-constrained optimization, one aims to find design parameters that minimize some objective, subject to the satisfaction of a partial differential equation. A major challenges is computing gradients of the objective to the design…

We study the possibility to undo the quantum mechanical evolution in a time reversal experiment. The naive expectation, as reflected in the common terminology ("Loschmidt echo"), is that maximum compensation results if the reversed dynamics…

Numerical solutions to Newton's equations of motion for chaotic self gravitating systems of more than 2 bodies are often regarded to be irreversible. This is due to the exponential growth of errors introduced by the integration scheme and…

We consider a class of reflected backward doubly stochastic differential equations with time delayed generator (in short RBDSDE with time delayed generator), in this case generator at time $t$ can depend on the values of a solution in the…

For decades, researchers have sought to understand how the irreversibility of the surrounding world emerges from the seemingly time symmetric, fundamental laws of physics. Quantum mechanics conjectured a clue that final irreversibility is…

Recurrent neural networks (RNNs) provide state-of-the-art performance in processing sequential data but are memory intensive to train, limiting the flexibility of RNN models which can be trained. Reversible RNNs---RNNs for which the…

The distribution of reversible programs tends to a limit as their size increases. For problems with a Hamming distance fitness function the limiting distribution is binomial with an exponentially small chance (but non~zero) chance of…

The traditional approach of hand-crafting priors (such as sparsity) for solving inverse problems is slowly being replaced by the use of richer learned priors (such as those modeled by deep generative networks). In this work, we study the…

We propose to solve inverse problems involving the temporal evolution of physics systems by leveraging recent advances from diffusion models. Our method moves the system's current state backward in time step by step by combining an…

The time reversibility characteristic of Hamiltonian mechanics has long been extended to nonHamiltonian dynamical systems modeling nonequilibrium steady states with feedback-based thermostats and ergostats. Typical solutions are…

Although the laws of classical physics are deterministic, thermodynamics gives rise to an arrow of time through irreversible processes. In quantum mechanics the unitary nature of the time evolution makes it intrinsically reversible, however…

The "backward simulation" of a stochastic process is defined as the stochastic dynamics that trace a time-reversed path from the target region to the initial configuration. If the probabilities calculated by the original simulation are…

In this article, we analyze three classes of time-reversal of a Markov process with Gaussian noise on a manifold. We first unveil a commutativity constraint for the most general of these time-reversals to be well defined. Then we give a…

Reversal of the time direction in stochastic systems driven by white noise has been central throughout the development of stochastic realization theory, filtering and smoothing. Similar ideas were developed in connection with certain…

A dynamical system is said to be reversible if, given an output, the input can always be recovered in a well-posed manner. Nevertheless, we argue that reversible systems that have a time-reversal symmetry, such as the Nonlinear…

In the mathematical tradition, reversibility requires that the evolution of a dynamical system be a bijective function. In the context of graph rewriting, however, the evolution is not even a function, because it is not even deterministic…

Pseudo-random number generators are widely used in many branches of science, mainly in applications related to Monte Carlo methods, although they are deterministic in design and, therefore, unsuitable for tackling fundamental problems in…

We deal with backward stochastic differential equations with time delayed generators. In this new type of equations, a generator at time t can depend on the values of a solution in the past, weighted with a time delay function for instance…

Causal reversibility blends reversibility and causality for concurrent systems. It indicates that an action can be undone provided that all of its consequences have been undone already, thus making it possible to bring the system back to a…