Related papers: Collective marks and first passage times
We consider the first-passage percolation problem on the random graph with vertex set N\times{0,1}, edges joining vertices at Euclidean distance equal to unity and independent exponential edge weights. We provide a central limit theorem for…
Continuous-time Markov chains are used to model stochastic systems where transitions can occur at irregular times, e.g., birth-death processes, chemical reaction networks, population dynamics, and gene regulatory networks. We develop a…
New theorems for the moments of the first passage time of one dimensional nonlinear stochastic processes with an entrance boundary are formulated. This important class of one dimensional stochastic processes results among others from…
Many random growth models have the property that the set of discovered sites, scaled properly, converges to some deterministic set as time grows. Such results are known as shape theorems. Typically, not much is known about the shapes. For…
We consider a class of non-homogeneous Markov chains, that contains many natural examples. Next, using martingale methods, we establish some deviation and moment inequalities for separately Lipschitz functions of such a chain, under moment…
We consider first passage times $\tau_u = \inf\{n:\; Y_n>u\}$ for the perpetuity sequence $$ Y_n = B_1 + A_1 B_2 + \cdots + (A_1\ldots A_{n-1})B_n, $$ where $(A_n,B_n)$ are i.i.d. random variables with values in ${\mathbb R} ^+\times…
Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…
We present a novel approach to quantizing Markov chains. The approach is based on the Markov chain coupling method, which is frequently used to prove fast mixing. Given a particular coupling, e.g., a grand coupling, we construct a…
In this paper we investigate the behavior of the bridges of a Markov counting process in several directions. We first characterize convexity(concavity) in time of the mean value in terms of lower (upper) bounds on the so called…
Two approaches to studying the correlation functions of the binary Markov sequences are considered. The first of them is based on the study of probability of occurring different ''words'' in the sequence. The other one uses recurrence…
A wide class of ``counting'' problems have been studied in Computer Science. Three typical examples are the estimation of - (i) the permanent of an $n\times n$ 0-1 matrix, (ii) the partition function of certain $n-$ particle Statistical…
The paper focuses on an approximation of the first passage time probability density function of a Feller stochastic process by using cumulants and a Laguerre-Gamma polynomial approximation. The feasibility of the method relies on closed…
Based on the analysis of probability flow, where the First Passage (FP) is realised as the sink of probability, we summarise the protocol to find the distribution of the First Passage Time (FTP). We also describe the corresponding formula…
We address the problem of community detection in networks by introducing a general definition of Markov stability, based on the difference between the probability fluxes of a Markov chain on the network at different time scales. The…
We describe a new construction of a family of measures on a group with the same Poisson boundary. Our approach is based on applying Markov stopping times to an extension of the original random walk.
We present an algorithm that can efficiently compute a broad class of inferences for discrete-time imprecise Markov chains, a generalised type of Markov chains that allows one to take into account partially specified probabilities and other…
Subdiffusion equation and molecule survival equation, both with Caputo fractional time derivatives with respect to another functions $g_1$ and $g_2$, respectively, are used to describe diffusion of a molecule that can disappear at any time…
This article describes a new Monte Carlo method for the evaluation of the orthant probabilities by sampling first passage times of a non-singular Gaussian discrete time-series across an absorbing boundary. This procedure makes use of a…
We give a concise self-contained presentation of known and new limit theorems for the one-type Markov branching processes with continuous time. The new streamlined proofs are based on what we call, the tail generating function approach. Our…
We propose a method based on continuous time Markov chain approximation to compute the distribution of Parisian stopping times and price Parisian options under general one-dimensional Markov processes. We prove the convergence of the method…