Related papers: Diffusion spiders: Green kernel, excessive functio…
We consider the optimal stopping problem consisting in, given a strong Markov process, a reward function and a discount rate, finding the stopping time such that the expected reward at the stopping time is maximum. The approach we follow,…
We consider a two-dimensional diffusion process in a two-layered plane, governed by distinct covariance matrices in the upper and lower half-planes and by two drift vectors pointed away from the $x$-axis. We first analyze the case where the…
This paper develops an approach for solving perpetual discounted optimal stopping problems for multidimensional diffusions, with special emphasis on the $d$-dimensional Wiener process. We first obtain some verification theorems for…
By analyzing matrices involved, we prove that a snapping-out Brownian motion with large permeability coefficients is a good approximation of Walsh's spider process on the star-like graph $K_{1,k}$. Thus, the latter process can be seen as a…
The principle of smooth fit is probably the most used tool to find solutions to optimal stopping problems of one-dimensional diffusions. It is important, e.g., in financial mathematical applications to understand in which kind of models and…
Fractional Brownian motion is a Gaussian stochastic process with stationary, long-time correlated increments and is frequently used to model anomalous diffusion processes. We study numerically fractional Brownian motion confined to a finite…
Consider the optimal stopping problem of a one-dimensional diffusion with positive discount. Based on Dynkin's characterization of the value as the minimal excessive majorant of the reward and considering its Riesz representation, we give…
The objective of this article is to prove existence and weak uniqueness of a Walsh spider diffusion process, whose spinning measure and coefficients are allowed to depend on the local time spent at the junction vertex. The methodology is to…
We study the problem of particles undergoing Brownian motion in an expanding sphere whose surface is an absorbing boundary for the particles. The problem is akin to that of the diffusion of impurities in a grain of polycrystalline material…
We provide, in a general setting, explicit solutions for optimal stopping problems that involve a diffusion process and its running maximum. Besides, a new feature includes absorbing boundaries that vary with the value of the running…
We study here the escape time for the fastest diffusing particle from the boundary of an interval with point-sink killing sources. Killing represents a degradation that leads to the probabilistic removal of the moving Brownian particles. We…
We consider the Brownian ``spider process'', also known as Walsh Brownian motion, first introduced in the epilogue of Walsh 1978. The paper provides the best constant $C_n$ for the inequality $$ E D_\tau\leq C_n \sqrt{E \tau},$$ where…
We investigate the extreme value statistics of a one-dimensional Brownian motion (with the diffusion constant $D$) during a time interval $\left[0, t \right]$ in the presence of a reflective boundary at the origin, starting from a positive…
The first passage time density of a diffusion process to a time varying threshold is of primary interest in different fields. Here we consider a Brownian motion in presence of an exponentially decaying threshold to model the neuronal…
We develop an immersed-boundary approach to modeling reaction-diffusion processes in dispersions of reactive spherical particles, from the diffusion-limited to the reaction-limited setting. We represent each reactive particle with a…
Sticky Brownian motion is the simplest example of a diffusion process that can spend finite time both in the interior of a domain and on its boundary. It arises in various applications such as in biology, materials science, and finance.…
We consider a processor sharing queue where the number of jobs served at any time is limited to $K$, with the excess jobs waiting in a buffer. We use random counting measures on the positive axis to model this system. The limit of this…
The online increasing subsequence problem is a stochastic optimisation task with the objective to maximise the expected length of subsequence chosen from a random series by means of a nonanticipating decision strategy. We study the…
The aim of this article is to give several results related to Walsh's spider diffusions living on a star-shaped network that have a spinning measure selected from the own local time of the motion at the vertex (cf.[17]). We prove the…
We construct a class of superprocesses by taking the high density limit of a sequence of interacting-branching particle systems. The spatial motion of the superprocess is determined by a system of interacting diffusions, the branching…