Related papers: Bridges of Markov counting processes: quantitative…
We introduce weighted Markovian graphs, a random walk model that decouples the transition dynamics of a Markov chain from (random) edge weights representing the cost of traversing each edge. This decoupling allows us to study the…
In this article, we propose a least squares method for the estimation of the transition density in bifurcating Markov models. Unlike the kernel estimation, this method do not use the quotient which can be a source of errors. In order to…
We present a numerical method to compute expectations of functionals of a piecewise-deterministic Markov process. We discuss time dependent functionals as well as deterministic time horizon problems. Our approach is based on the…
We develop a martingale approximation approach to studying the limiting behavior of quadratic forms of Markov chains. We use the technique to examine the asymptotic behavior of lag-window estimators in time series and we apply the results…
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…
Consider the {$\ell_{\alpha}$} regularized linear regression, also termed Bridge regression. For $\alpha\in (0,1)$, Bridge regression enjoys several statistical properties of interest such as sparsity and near-unbiasedness of the estimates…
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 order to give quantitative estimates for approximating the ergodic limit, we investigate probabilistic limit behaviors of time-averaging estimators of numerical discretizations for a class of time-homogeneous Markov processes, by…
Estimating the transition dynamics of controlled Markov chains is crucial in fields such as time series analysis, reinforcement learning, and system exploration. Traditional non-parametric density estimation methods often assume independent…
Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…
The interplay between bifurcations and random switching processes of vector fields is studied. More precisely, we provide a classification of piecewise deterministic Markov processes arising from stochastic switching dynamics near fold,…
In a recent article, Krapivsky and Redner (J. Stat. Mech. 093208 (2018)) established that the distribution of the first hitting times for a diffusing particle subject to hitting an absorber is independent of the direction of the external…
We characterize the small-time asymptotic behavior of the exit probability of a L\'evy process out of a two-sided interval and of the law of its overshoot, conditionally on the terminal value of the process. The asymptotic expansions are…
This paper studies function approximation for finite horizon discrete time Markov decision processes under certain convexity assumptions. Uniform convergence of these approximations on compact sets is proved under several sampling schemes…
This study aims to construct a stochastic process called "Brownian house-moving," which is a Brownian bridge conditioned to stay between two curves. To construct this process, statements are prepared on the weak convergence of conditioned…
The paper is largely of a review nature. It considers two main methods used to study stability and obtain appropriate quantitative estimates of perturbations of (inhomogeneous) Markov chains with continuous time and a finite or countable…
We calculate crossing probabilities and one-sided last exit time densities for a class of moving barriers on an interval $[0,T]$ via Schwartz distributions. We derive crossing probabilities and first hitting time densities for another class…
We introduce a counting process to model the random occurrence in time of car traffic accidents, taking into account some aspects of the self-excitation typical of this phenomenon. By combining methods from probability and differential…
In Markov networks, measurement blackouts with unknown frequency compromise observations such that thermodynamic quantities can no longer be inferred reliably. In particular, the observed currents neither discern equilibrium from…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…