English
Related papers

Related papers: Stochastic resetting in the Kramers problem: A Mon…

200 papers

Brownian diffusion subject to stochastic resetting to a fixed position has been widely studied for applications to random search processes. In an unbounded domain, the mean first-passage time at a target site can be minimized for a…

Statistical Mechanics · Physics 2025-10-08 Pedro Julián-Salgado , Leonardo Dagdug , Denis Boyer

Over the last few years there have been dramatic advances in our understanding of mathematical and computational models of complex systems in the presence of uncertainty. This has led to a growth in the area of uncertainty quantification as…

Numerical Analysis · Mathematics 2013-06-05 Maziar Raissi , Padmanabhan Seshaiyer

The effects of a stochastic reset, to its initial configuration, is studied in the exactly solvable one-dimensional coagulation-diffusion process. A finite resetting rate leads to a modified non-equilibrium stationary state. If in addition…

Statistical Mechanics · Physics 2014-02-04 Xavier Durang , Malte Henkel , Hyunggyu Park

Molecular dynamics simulations are widely used across chemistry, physics, and biology, providing quantitative insight into complex processes with atomic detail. However, their limited timescale of a few microseconds is a significant…

Chemical Physics · Physics 2025-04-10 Ofir Blumer , Barak Hirshberg

We extend the theoretical framework used to study search processes with stochastic resetting to the case of partially absorbing targets. Instead of an absorption event occurring when the search particle reaches the boundary of a target, the…

Statistical Mechanics · Physics 2021-04-20 Ryan D. Schumm , Paul C. Bressloff

Stochastic collocation methods for approximating the solution of partial differential equations with random input data (e.g., coefficients and forcing terms) suffer from the curse of dimensionality whereby increases in the stochastic…

Numerical Analysis · Mathematics 2014-05-23 Aretha L. Teckentrup , Peter Jantsch , Clayton G. Webster , Max Gunzburger

Improving efficiency of importance sampler is at the center of research in Monte Carlo methods. While adaptive approach is usually difficult within the Markov Chain Monte Carlo framework, the counterpart in importance sampling can be…

Methodology · Statistics 2007-12-11 Heng Lian

The paper addresses an escape of a classical particle from a potential well under harmonic forcing. Most dangerous/efficient escape dynamics reveals itself in conditions of 1:1 resonance and can be described in the framework of isolated…

Dynamical Systems · Mathematics 2022-03-02 Pavel Kravetc , Oleg Gendelman

A resampling scheme provides a way to switch low-weight particles for sequential Monte Carlo with higher-weight particles representing the objective distribution. The less the variance of the weight distribution is, the more concentrated…

Computation · Statistics 2023-09-19 Xiongming Dai , Gerald Baumgartner

We present a new Monte Carlo Tree Search (MCTS) algorithm to solve the stochastic orienteering problem with chance constraints, i.e., a version of the problem where travel costs are random, and one is assigned a bound on the tolerable…

Robotics · Computer Science 2024-09-06 Stefano Carpin

We introduce a new Monte Carlo method by incorporating a guided distribution function to the conventional Monte Carlo method. In this way, the efficiency of Monte Carlo methods is drastically improved. To further speed up the algorithm, we…

Computational Physics · Physics 2009-11-07 S. P. Li

The Markov chain Monte Carlo method is a versatile tool in statistical physics to evaluate multi-dimensional integrals numerically. For the method to work effectively, we must consider the following key issues: the choice of ensemble, the…

Statistical Mechanics · Physics 2014-01-07 Synge Todo , Hidemaro Suwa

Many random processes can be simulated as the output of a deterministic model accepting random inputs. Such a model usually describes a complex mathematical or physical stochastic system and the randomness is introduced in the input…

Machine Learning · Statistics 2012-11-21 A. Gokcen Mahmutoglu , Alper T. Erdogan , Alper Demir

Resetting a stochastic process is an important problem describing the evolution of physical, biological and other systems which are continually returned to their certain fixed point. We consider the motion of a subdiffusive particle with a…

Statistical Mechanics · Physics 2024-01-18 Aleksander A. Stanislavsky

We consider the mean first passage time (MFPT) for a diffusive particle in a potential landscape with the extra condition that the particle is reset to its original position with some rate r. We study non-smooth and non-convex potentials…

Statistical Mechanics · Physics 2025-09-16 Johannes Aspman , Daniel Mastropietro , Jakub Marecek

Sample-based Bayesian inference provides a route to uncertainty quantification in the geosciences, and inverse problems in general, though is very computationally demanding in the naive form that requires simulating an accurate computer…

Computation · Statistics 2019-04-12 Tiangang Cui , Colin Fox , Michael J O'Sullivan

Poisson restart assumes that a stochastic process is interrupted and starts again at random time moments. A number of studies have demonstrated that this strategy may minimize the expected completion time in some classes of random search…

Statistical Mechanics · Physics 2024-05-15 Sergey Belan

We introduce the Quantization Monte Carlo method to solve thermal radiative transport equations with possibly several collision regimes, ranging from few collisions to massive number of collisions per time unit. For each particle in a given…

Computational Physics · Physics 2024-09-13 Laetitia Laguzet , Gabriel Turinici

Stochastic processes offer a fundamentally different paradigm of dynamics than deterministic processes, the most prominent example of the latter being Newton's laws of motion. Here, we discuss in a pedagogical manner a simple and…

Statistical Mechanics · Physics 2022-04-15 Shamik Gupta , Arun M. Jayannavar

With the goal to provide absolute lower bounds for the best possible running times that can be achieved by $(1+\lambda)$-type search heuristics on common benchmark problems, we recently suggested a dynamic programming approach that computes…

Neural and Evolutionary Computing · Computer Science 2021-02-24 Kirill Antonov , Maxim Buzdalov , Arina Buzdalova , Carola Doerr