相关论文: First passage process of a Markov additive process…

The Marchenko method is developed in the inverse scattering problem for a linear system of first-order differential equations containing potentials proportional to the spectral parameter. The corresponding Marchenko system of integral…

The trace of a Markov process is the time changed process of the original process on the support of the Revuz measure used in the time change. In this paper, we will concentrate on the reflecting Brownian motions on certain closed strips.…

It is considered the integrated process $X(t)= x + \int _0^t Y(s) ds ,$ where $Y(t)$ is a Gauss-Markov process starting from $y.$ The first-passage time (FPT) of $X$ through a constant boundary and the first-exit time of $X$ from an…

This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30,197-207, (1986)…

Spectral methods have proven to be a highly effective tool in understanding the intrinsic geometry of a high-dimensional data set $\left\{x_i \right\}_{i=1}^{n} \subset \mathbb{R}^d$. The key ingredient is the construction of a Markov chain…

Drawdown (resp. drawup) of a stochastic process, also referred as the reflected process at its supremum (resp. infimum), has wide applications in many areas including financial risk management, actuarial mathematics and statistics. In this…

In this paper we show for the first time the phenomenon of negative reflection in a simple mechanical structure. The latter is a grating of fixed inclusions embedded in a linear elastic matrix. Numerical analyses for out-of-plane shear…

We consider a Markov additive process with a finite phase space and study its path decompositions at the times of extrema, first passage and last exit. For these three families of times we establish splitting conditional on the phase, and…

In this note we re-visit the fundamental question of the strong law of large numbers and central limit theorem for processes in continuous time with conditional stationary and independent increments. For convenience we refer to them as…

A particle entering a scattering and absorbing medium executes a random walk through a sequence of scattering events. The particle ultimately achieves first-passage, leaving the medium or it is absorbed. The Kubelka-Munk model describes a…

In this paper we study the joint distributions of the telegraph process and its maximum conditioned on the number of changes of direction and the initial velocity. We prove that in the case of positive starting velocity, a form of the…

The aim of this paper is to investigate how the correlation properties of a stationary Markovian stochastic processes affect the First Passage Time distribution. First Passage Time issues are a classical topic in stochastic processes…

Fluctuations in stochastic systems are usually characterized by the full counting statistics, which analyzes the distribution of the number of events taking place in the fixed time interval. In an alternative approach, the distribution of…

We start by remarking a one-to-one correspondence between self-similar Markov processes (ssMps) on a Banach space and Markov additive processes (MAPs) that is analogous to the well-known one between positive ssMps and L\'evy processes…

We study a combination of the refracted and reflected L\'evy processes. Given a spectrally negative L\'evy process and two boundaries, it is reflected at the lower boundary while, whenever it is above the upper boundary, a linear drift at a…

The mean first-passage time (MFPT) is one standard measure for the reaction time in thermally activated barrier-crossing processes. While the relationship between MFPTs and phenomenological rate coefficients is known for systems that…

We construct a Hunt process that can be described as an isotropic $\alpha$-stable L\'evy process reflected from the complement of a bounded open Lipschitz set. In fact, we introduce a new analytic method for concatenating Markov processes.…

This paper studies the queue length process in series Jackson networks with external input to the first station. We show that its Markov transition probabilities can be written as a finite sum of non-crossing probabilities, so that…

We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{0,1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an…

The scattering properties of quantum particles on fractal potentials at different stages of fractal growth are obtained by means of the transfer matrix method. This approach can be easily adopted for project assignments in introductory…