English
Related papers

Related papers: Levy Approximation of Impulsive Recurrent Process …

200 papers

Non-positive Markov approximations are sometimes used to describe the dynamics of qubits in weak interaction with suitable environments; the appearance of negative probabilities is avoided by assuming that the transient regime eliminates…

Quantum Physics · Physics 2009-11-13 F. Benatti , R. Floreanini , S. Breteaux

This article presents a short and concise description of stochastic approximation algorithms in reinforcement learning of Markov decision processes. The algorithms can also be used as a suboptimal method for partially observed Markov…

Optimization and Control · Mathematics 2015-12-25 Vikram Krishnamurthy

We consider the small mass asymptotic (Smoluchowski-Kramers approximation) for the Langevin equation with a variable friction coefficient. The friction coefficient is assumed to be vanishing within certain region. We introduce a…

Probability · Mathematics 2012-09-26 Mark Freidlin , Wenqing Hu , Alexander Wentzell

In a step reinforced random walk, at each integer time and with a fixed probability p $\in$ (0, 1), the walker repeats one of his previous steps chosen uniformly at random, and with complementary probability 1 -- p, the walker makes an…

Probability · Mathematics 2018-10-22 Jean Bertoin

In this paper we study how to approximate the Leray weak solutions of the incompressible Navier Stokes equation. In particular we describe an hyperbolic version of the so called artificial compressibility method investigated by J.L.Lions…

Analysis of PDEs · Mathematics 2007-05-23 Donatella Donatelli , Pierangelo Marcati

The paper develops multiplicative compensation for complex-valued semimartingales and studies some of its consequences. It is shown that the stochastic exponential of any complex-valued semimartingale with independent increments becomes a…

Probability · Mathematics 2023-05-10 Aleš Černý , Johannes Ruf

Computing the probability of evidence even with known error bounds is NP-hard. In this paper we address this hard problem by settling on an easier problem. We propose an approximation which provides high confidence lower bounds on…

Artificial Intelligence · Computer Science 2012-06-26 Vibhav Gogate , Bozhena Bidyuk , Rina Dechter

We characterize recurrence and transience of nonnegative multivariate autoregressive processes of order one with random contractive coefficient matrix, of subcritical multitype Galton-Watson branching processes in random environment with…

Probability · Mathematics 2016-10-18 Martin P. W. Zerner

We prove precise stability results for overshoots of Markov additive processes (MAPs) with finite modulating space. Our approach is based on the Markovian nature of overshoots of MAPs whose mixing and ergodic properties are investigated in…

Probability · Mathematics 2024-05-28 Leif Döring , Lukas Trottner

This paper addresses the problem of approximating the set of all solutions for Multi-objective Markov Decision Processes. We show that in the vast majority of interesting cases, the number of solutions is exponential or even infinite. In…

Machine Learning · Computer Science 2020-09-18 L. Mandow , J. L. Pérez de la Cruz , N. Pozas

We investigate the Longstaff--Schwartz algorithm for American option pricing assuming that both the number of regressors and the number of Monte Carlo paths tend to infinity. Our main results concern extensions, respectively, applications…

Probability · Mathematics 2011-04-07 Stefan Gerhold

While one-dimensional Markov processes are well understood, going to higher dimensions there are only a few analytically solved Ising-like models, in practice requiring to use relatively costly, uncontrollable and inaccurate Monte-Carlo…

Information Theory · Computer Science 2021-04-20 Jarek Duda

We propose and analyze a finite element method for a semi-stationary Stokes system modeling compressible fluid flow subject to a Navier-slip boundary condition. The velocity (momentum) equation is approximated by a mixed finite element…

Numerical Analysis · Mathematics 2009-04-07 Kenneth H. Karlsen , Trygve K. Karper

The Levenberg-Marquardt algorithm is a flexible iterative procedure used to solve non-linear least squares problems. In this work we study how a class of possible adaptations of this procedure can be used to solve maximum likelihood…

Computation · Statistics 2014-10-06 Marco Giordan , Federico Vaggi , Ron Wehrens

We obtain general weak existence and stability results for stochastic convolution equations with jumps under mild regularity assumptions, allowing for non-Lipschitz coefficients and singular kernels. Our approach relies on weak convergence…

Probability · Mathematics 2021-12-22 Eduardo Abi Jaber , Christa Cuchiero , Martin Larsson , Sergio Pulido

We investigate the non-Langevin relative of the L\'{e}vy-driven Langevin random system, under an assumption that both systems share a common (asymptotic, stationary, steady-state) target pdf. The relaxation to equilibrium in the fractional…

Statistical Mechanics · Physics 2020-10-22 P. Garbaczewski , M. Zaba

We establish $L^2$-exponential convergence rate for three popular piecewise deterministic Markov processes for sampling: the randomized Hamiltonian Monte Carlo method, the zigzag process, and the bouncy particle sampler. Our analysis is…

Probability · Mathematics 2022-05-10 Jianfeng Lu , Lihan Wang

The hypercontractivity is proved for the Markov semigroup associated to a class of finite/infinite dimensional stochastic Hamiltonian systems. Consequently, the Markov semigroup is exponentially convergent to the invariant probability…

Probability · Mathematics 2016-12-08 Feng-Yu Wang

We establish integral tests and laws of the iterated logarithm for the lower envelope of positive self-similar Markov processes at 0 and $+\infty$. Our proofs are based on the Lamperti representation and time reversal arguments. These…

Probability · Mathematics 2016-08-16 Loïc Chaumont , Juan-Carlos Pardo

This paper studies various notions of approximate probabilistic bisimulation on labeled Markov chains (LMCs). We introduce approximate versions of weak and branching bisimulation, as well as a notion of $\varepsilon$-perturbed bisimulation…

Logic in Computer Science · Computer Science 2024-07-11 Timm Spork , Christel Baier , Joost-Pieter Katoen , Jakob Piribauer , Tim Quatmann
‹ Prev 1 8 9 10 Next ›