Related papers: On the accuracy of simulating mixing by random-wal…
This paper deals also with a problem of gas absorption accompanied by an instantaneous, irreversible reaction in the liquid layer. The well-known methods for calculating such processes are based usually on the certain amendments to…
Generating random variates from high-dimensional distributions is often done approximately using Markov chain Monte Carlo. In certain cases, perfect simulation algorithms exist that allow one to draw exactly from the stationary…
We investigate three different methods for systematically approximating the diffusion coefficient of a deterministic random walk on the line which contains dynamical correlations that change irregularly under parameter variation. Capturing…
Hit-and-Run is known to be one of the best random sampling algorithms, its mixing time is polynomial in dimension. Nevertheless, in practice the number of steps required to achieve uniformly distributed samples is rather high. We propose…
The migration of active particles in slowly moving, crowded, and heterogeneous media is fundamental to various biological processes and technological applications, such as cargo transport. In this study, we numerically investigate the…
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we focus on the problem of sampling random walks efficiently in a…
Shaped laser pulses are a powerful tool to induce population transfer between electronic molecular states, and time-dependent perturbation theory is suitable for a description of such a transfer in weak external fields. The application of…
Particle-in-cell merging algorithms aim to resample dynamically the six-dimensional phase space occupied by particles without distorting substantially the physical description of the system. Whereas various approaches have been proposed in…
Many algorithms have been developed for enumerating various combinatorial objects in time exponentially less than the number of objects. Two common classes of algorithms are dynamic programming and the transfer matrix method. This paper…
A theoretical analysis is given of the equation of motion method, due to Alben et al., to compute the eigenvalue distribution (density of states) of very large matrices. The salient feature of this method is that for matrices of the kind…
The separability of clusters is one of the most desired properties in clustering. There is a wide range of settings in which different clusterings of the same data set appear. We are interested in applications where there is a need for an…
We present a new algorithm to optimize distributions defined implicitly by parameterized stochastic diffusions. Doing so allows us to modify the outcome distribution of sampling processes by optimizing over their parameters. We introduce a…
A molecule traveling in a realistic propagation environment can experience stochastic interactions with other molecules and the environment boundary. The statistical behavior of some isolated phenomena, such as dilute unbounded molecular…
A powerful method to interface quantum light with matter is to propagate the light through an ensemble of atoms. Recently, a number of such interfaces have emerged, most prominently Rydberg ensembles, that enable strong nonlinear…
We show that particle transport in a uniform, quantum multi-baker map, is generically ballistic in the long time limit, for any fixed value of Planck's constant. However, for fixed times, the semi-classical limit leads to diffusion. Random…
We develop the first exact Bayesian methodology for the problem of inference in discretely observed regime switching diffusions. Switching diffusion models extend ordinary diffusions by allowing for jumps in instantaneous drift and…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
We define a new mass transport model on a one-dimensional lattice of size $N$ with continuous masses at each site. The lattice is connected to mass reservoirs of different `chemical potentials' at the two ends. The mass transfer dynamics in…
Plastic deformation of most crystalline materials is due to the motion of lattice dislocations. Therefore, the simulation of the interaction and dynamics of these defects has become state-of-the-art method to study work hardening, size…
Deep learning is known to be data-hungry, which hinders its application in many areas of science when datasets are small. Here, we propose to use transfer learning methods to migrate knowledge between different physical scenarios and…