相关论文: On the time of first level crossing and inverse Ga…
For a stochastic process $(X_t)_{t\geq 0}$ we establish conditions under which the inverse first-passage time problem has a solution for any random variable $\xi >0$. For Markov processes we give additional conditions under which the…
In this paper, we study a transient spatially inhomogeneous random walk with asymptotically zero drifts on the lattice of the positive half line. We give criteria for the finiteness of the number of points having exactly the same local time…
We consider the inverse problem of reconstructing the posterior measure over the trajec- tories of a diffusion process from discrete time observations and continuous time constraints. We cast the problem in a Bayesian framework and derive…
Continuous-time stochastic processes play an important role in the description of random phenomena, it is therefore of prime interest to study particular variables depending on their paths, like stopping time for example. One approach…
First-passage time problems are ubiquitous across many fields of study including transport processes in semiconductors and biological synapses, evolutionary game theory and percolation. Despite their prominence, first-passage time…
The conditional value of a stationary random process, given the level-upcrossing of another dependent stationary random process, is considered. Assuming that both processes are weakly non-Gaussian, an analytical approximation for the…
The inverse first-passage time problem determines a boundary such that the first-passage time of a Wiener process to this boundary has a given distribution. An approximation which is based on the starting value of the boundary to a smooth…
For a given barrier $S$ and a one-dimensional jump-diffusion process $X(t),$ starting from $x<S,$ we study the probability distribution of the integral $A_S(x)= \int_0 ^ {\tau_S(x)}X(t) \ dt$ determined by $X(t)$ till its first-crossing…
We show that the mean inverse populations of nondecreasing, square integrable, continuous-time branching processes decrease to zero like the inverse of their mean population if and only if the initial population $k$ is greater than a first…
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…
We study the exact asymptotics for the distribution of the first time $\tau_x$ a L\'evy process $X_t$ crosses a negative level $-x$. We prove that $\mathbf P(\tau_x>t)\sim V(x)\mathbf P(X_t\ge 0)/t$ as $t\to\infty$ for a certain function…
We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…
Let $X_1$, $X_2$, $...$ be a sequence of independently and identically distributed random variables with $\mathsf{E}X_1=0$, and let $S_0=0$ and $S_t=S_{t-1}+X_t$, $t=1,2,...$, be a random walk. Denote $\tau={cases}\inf\{t>1: S_t\leq0\},…
We present an analytical approximation scheme for the first passage time distribution on a finite interval of a random walker on a random forcing energy landscape. The approximation scheme captures the behavior of the distribution over all…
We show that a necessary and sufficient condition for the sum of iid random vectors to converge (under appropriate shifting and scaling) to a multivariate Gaussian distribution is that the truncated second moment matrix is slowly varying at…
We propose an approach to approximate the boundary crossing probabilities for general one-dimensional diffusion processes, and derive the convergence rate for this approximation scheme. There results are based on the explicit expression of…
Motivated by the dynamics of resonant neurons we consider a differentiable, non-Markovian random process $x(t)$ and particularly the time after which it will reach a certain level $x_b$. The probability density of this first passage time is…
Let G=(V,E) be an undirected loopless graph with possible parallel edges and s and t be two vertices of G. Assume that vertex s is labelled at the initial time step and that every labelled vertex copies its labelling to neighbouring…
By a random process with immigration at random times we mean a shot noise process with a random response function (response process) in which shots occur at arbitrary random times. The so defined random processes generalize random processes…
We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…