Related papers: Markov Chain Approximation of One-Dimensional Stic…

Discrete diffusion models (DDMs) are a powerful class of generative models for categorical data, but they typically require many function evaluations for a single sample, making inference expensive. Existing acceleration methods either rely…

We consider conditional tests for non-negative discrete exponential families. We develop two Markov Chain Monte Carlo (MCMC) algorithms which allow us to sample from the conditional space and to perform approximated tests. The first…

Discrete diffusion models have recently emerged as a promising alternative to the autoregressive approach for generating discrete sequences. Sample generation via gradual denoising or demasking processes allows them to capture hierarchical…

Markov Chain Monte Carlo (MCMC) methods are algorithms for sampling probability distributions, commonly applied to the Boltzmann distribution in physical and chemical models such as protein folding and the Ising model. These methods enable…

At first, we solve a problem of finding a risk-minimizing hedging strategy on a general market with ratings. Next, we find a solution to this problem on Markovian market with ratings on which prices are influenced by additional factors and…

The aim of this article is to prove that diffusion processes in $\mathbb{R}^d$ with a drift can be approximated by suitable Markov chains on $n^{-1}\mathbb{Z}^d$. Moreover, we investigate sufficient conditions on the conductances which…

Let $X(\cdot)$ be a non-degenerate, positive recurrent one-dimensional diffusion process on $\mathbb{R}$ with invariant probability density $\mu(x)$, and let $\tau_y=\inf\{t\ge0: X(t)=y\}$ denote the first hitting time of $y$. Let…

In this paper we want to propose practical numerical methods to solve a class of initial-boundary problem of time-space fractional convection-diffusion equations (TSFCDEs). To start with, an implicit difference method based on two-sided…

In this work, we introduce a novel class of adaptive Monte Carlo methods, called adaptive independent sticky MCMC algorithms, for efficient sampling from a generic target probability density function (pdf). The new class of algorithms…

We have developed a new, very efficient numerical scheme to solve the CR diffusion convection equation that can be applied to the study of the nonlinear time evolution of CR modified shocks for arbitrary spatial diffusion properties. The…

Performing exact Bayesian inference for complex models is computationally intractable. Markov chain Monte Carlo (MCMC) algorithms can provide reliable approximations of the posterior distribution but are expensive for large datasets and…

Propagation of charged cosmic-rays in the Galaxy depends on the transport parameters, whose number can be large depending on the propagation model under scrutiny. A standard approach for determining these parameters is a manual scan,…

Labeled continuous-time Markov chains (CTMCs) describe processes subject to random timing and partial observability. In applications such as runtime monitoring, we must incorporate past observations. The timing of these observations matters…

We consider the efficient use of an approximation within Markov chain Monte Carlo (MCMC), with subsequent importance sampling (IS) correction of the Markov chain inexact output, leading to asymptotically exact inference. We detail…

In this paper we present an algorithm for pricing barrier options in one-dimensional Markov models. The approach rests on the construction of an approximating continuous-time Markov chain that closely follows the dynamics of the given…

Markov chain Monte Carlo (MCMC) is a powerful methodology for the approximation of posterior distributions. However, the iterative nature of MCMC does not naturally facilitate its use with modern highly parallel computation on HPC and cloud…

We study the weak approximation error of a skew diffusion with bounded measurable drift and H\"older diffusion coefficient by an Euler-type scheme, which consists of iteratively simulating skew Brownian motions with constant drift. We first…

We introduce a Markov Chain Monte Carlo (MCMC) method that is designed to sample from target distributions with irregular geometry using an adaptive scheme. In cases where targets exhibit non-Gaussian behaviour, we propose that adaption…

The paper studies an improved estimate for the rate of convergence for nonlinear homogeneous discrete-time Markov chains. These processes are nonlinear in terms of the distribution law. Hence, the transition kernels are dependent on the…

In sampling tasks, it is common for target distributions to be known up to a normalizing constant. However, in many situations, even evaluating the unnormalized distribution can be costly or infeasible. This issue arises in scenarios such…