相关论文: The Last Passage Problem on Graphs

The first-passage-time problem for a Brownian motion with alternating infinitesimal moments through a constant boundary is considered under the assumption that the time intervals between consecutive changes of these moments are described by…

For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…

Let $H=(V,E)$ be an $r$-uniform hypergraph with the vertex set $V$ and the edge set $E$. For $1\leq s \leq r/2$, we define a weighted graph $G^{(s)}$ on the vertex set ${V\choose s}$ as follows. Every pair of $s$-sets $I$ and $J$ is…

We consider point to point last passage times to every vertex in a neighbourhood of size $\delta N^{\frac{2}{3}}$, distance $N$ away from the starting point. The increments of these last passage times in this neighbourhood are shown to be…

We recently proposed a method for estimation of states and parameters in stochastic differential equations, which included intermediate time points between observations and used the Laplace approximation to integrate out these intermediate…

Brownian motions on a metric graph are defined. Their generators are characterized as Laplace operators subject to Wentzell boundary at every vertex. Conversely, given a set of Wentzell boundary conditions at the vertices of a metric graph,…

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

This paper analyzes a method to approximate the first passage time probability density function which turns to be particularly useful if only sample data are available. The method relies on a Laguerre-Gamma polynomial approximation and…

Under some weak conditions, the first-passage time of the Brownian motion to a continuous curved boundary is an almost surely finite stopping time. Its probability density function (pdf) is explicitly known only in few particular cases.…

Using a new approach, for spectrally negative L\'evy processes we find joint Laplace transforms involving the last exit time (from a semi-infinite interval), the value of the process at the last exit time and the associated occupation time,…

We investigate a moving boundary problem for a Brownian particle on the semi-infinite line in which the boundary moves by a distance proportional to the time between successive collisions of the particle and the boundary. Phenomenologically…

We consider directed last passage percolation on $\mathbb{Z}^2$ with exponential passage times on the vertices. A topic of great interest is the coupling structure of the weights of geodesics as the endpoints are varied spatially and…

We study the local time distribution of a Brownian particle diffusing along the links on a graph. In particular, we derive an analytic expression of its Laplace transform in terms of the Green's function on the graph. We show that the…

The graph transformation approach is a recently proposed method for computing mean first passage times, rates, and committor probabilities for kinetic transition networks. Here we compare the performance to existing linear algebra methods,…

This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…

We adapt ideas and concepts developed in optimal transport (and its martingale variant) to give a geometric description of optimal stopping times of Brownian motion subject to the constraint that the distribution of the stopping time is a…

In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…

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…

Let T be a measurable transformation of a probability space $(E,\mathcal {E},\pi)$, preserving the measure {\pi}. Let X be a random variable with law \pi. Call K(\cdot, \cdot) a regular version of the conditional law of X given T(X). Fix…

A natural extension of a right-continuous integer-valued random walk is one which can jump to the right by one or two units. First passage times above a given fixed level then admit a tractable Laplace transform (probability generating…