SearcharxivSearch

arXiv · 0812.4269

Note on radial Dunkl processes

Abstract

We give shorter proofs of the following known results: the radial Dunkl process associated with a reduced system and a strictly positive multiplicity function is the unique strong solution for all times of a stochastic differential equation with a singular drift, the first hitting time of the Weyl chamber by a radial Dunkl process is finite almost surely for small values of the multiplicity function. Compared to the original proofs, ours give more information on the behavior of the process. More precisely, the first proof allows to give a positive answer to a conjecture announced by Gallardo and Yor for the finiteness of the total length of the jumps performed by the Dunkl process during a finite amount of time, while the second one shows that the process hits almost surely the wall corresponding to the simple root with a small multiplicity value. Further results on the jumps of the Dunkl process (communicated by D. Lépingle) and and additional references are included.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nizar Demni. 2012-03-18. Note on radial Dunkl processes. https://arxiv.org/abs/0812.4269

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