Diffusion spiders: Green kernel, excessive functions and optimal stopping

From MaRDI portal



Abstract: A diffusion spider is a strong Markov process with continuous paths taking values on a graph with one vertex and a finite number of edges (of infinite length). An example is Walsh's Brownian spider where the process on each edge behaves as Brownian motion. We calculate the density of the resolvent kernel in terms of the characteristics of the underlying diffusion. Excessive functions are studied via the Martin boundary theory. The main result is an explicit expression for the representing measure of a given excessive function. These results are used to solve optimal stopping problems for diffusion spiders.


In this paper, the authors derive a formula for the Green function characterizing the diffusion process on the spider graph, also known as a diffusion spider. Additionally, they solve several optimal stopping problems using two distinct methods coming from the representation approach. Notably, both methods require the computation of the Martin kernel, which is equivalent to the Green kernel.



Cites work









This page was built for publication: Diffusion spiders: Green kernel, excessive functions and optimal stopping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186387)