The Last Passage Problem on Graphs

Simple item page
dc.creatorDesbois, Jean
dc.creatorBenichou, Olivier
dc.date2003-06-27
dc.date.accessioned2026-07-07T02:52:06Z
dc.date.available2026-07-07T02:52:06Z
dc.descriptionWe 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.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/cond-mat/0306705
dc.identifierhttp://arxiv.org/abs/cond-mat/0306705
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/21713
dc.subjectStatistical Mechanics
dc.titleThe Last Passage Problem on Graphs
dc.typetext

Files

Collections

arXiv