SearcharxivSearch

arXiv · 2310.19354

Martingale problem for a Walsh spider process with spinning measure selected from its own local time

Abstract

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 show carefully that an effectively designed martingale problem is well-posed. Exploiting fully the results coming from the pioneering work of [16], the construction of the solution is performed using a concatenation procedure, as introduced in the seminal reference [26]. Uniqueness is shown by making use of the recent results obtained in [25] for the solution of the corresponding parabolic PDE that involves a new class of transmission condition called local time Kirchhoff 's transmission condition. As a byproduct of our main result, we manage to compute the explicit law of the diffusion when it behaves as a standard Brownian motion on each branch. The case I = 2 permits us to derive also that there is existence and uniqueness for solutions of generalized SDE on the real line that involve the local time of the unknown process in all its coefficients.

Explore related subjects

Keep this discovery

BibTeXRIS

Miguel Martinez, Isaac Ohavi. 2023-10-30. Martingale problem for a Walsh spider process with spinning measure selected from its own local time. https://arxiv.org/abs/2310.19354

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