Search arXivSearch

arXiv · 1302.7128

Explicit construction of a dynamic Bessel bridge of dimension 3

Abstract

Given a deterministically time-changed Brownian motion $Z$ starting from 1, whose time-change $V(t)$ satisfies $V(t) > t$ for all $t > 0$, we perform an explicit construction of a process $X$ which is Brownian motion in its own filtration and that hits zero for the first time at $V(\tau)$, where $\tau := \inf\{t>0: Z_t =0\}$. We also provide the semimartingale decomposition of $X$ under the filtration jointly generated by $X$ and $Z$. Our construction relies on a combination of enlargement of filtration and filtering techniques. The resulting process $X$ may be viewed as the analogue of a 3-dimensional Bessel bridge starting from 1 at time 0 and ending at 0 at the random time $V(\tau)$. We call this {\em a dynamic Bessel bridge} since $V(\tau)$ is not known in advance. Our study is motivated by insider trading models with default risk, where the insider observes the firm's value continuously on time.

Explore related subjects

Keep this discovery

BibTeXRIS

Luciano Campi, Umut Çetin, Albina Danilova. 2013-02-28. Explicit construction of a dynamic Bessel bridge of dimension 3. https://arxiv.org/abs/1302.7128

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR