SearcharxivSearch

arXiv · 1304.6271

Isotropic Markov semigroups on ultra-metric spaces

Abstract

Let (X,d) be a locally compact separable ultra-metric space. Given a reference measure \mu\ on X and a step length distribution on the non-negative reals, we construct a symmetric Markov semigroup P^t acting in L^2(X,\mu). We study the corresponding Markov process. We obtain upper and lower bounds of its transition density and its Green function, give a transience criterion, estimate its moments and describe the Markov generator and its spectrum, which is pure point. In the particular case when X is the field of p-adic numbers, our construction recovers fractional derivative and the Taibleson Laplacian (spectral multiplier), and we can also apply our theory to the study of the Vladimirov Laplacian which is closely related to the concept of p-adic Quantum Mechanics. Even in this well established setting, several of our results are new. We also elaborate the relation between our processes and Kigami's jump processes on the boundary of a tree which are induced by a random walk. In conclusion, we provide examples illustrating the interplay between the fractional derivatives and random walks.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Bendikov, Alexander Grigor'yan, Christophe Pittet, Wolfgang Woess. 2013-04-23. Isotropic Markov semigroups on ultra-metric spaces. https://doi.org/10.4213/rm9602

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