Recognition: unknown
The Last Passage Problem on Graphs
classification
❄️ cond-mat.stat-mech
keywords
timegraphgraphslastsomevertexwhenbrownian
read the original abstract
We consider a Brownian motion on a general graph, that starts at time t=0 from some vertex O and stops at time t somewhere on the graph. Denoting by g the last time when O is reached, we establish a simple expression for the Laplace Transform, L, of the probability density of g. We discuss this result for some special graphs like star, ring, tree or square lattice. Finally, we show that L can also be expressed in terms of primitive orbits when, for any vertex, all the exit probabilities are equal.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.