Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2202.11848

Selfsimilar free additive processes and freely selfdecomposable distributions

Makoto Maejima·Noriyoshi Sakuma
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the paper by Fan\cite{F06}, he introduced the marginal selfsimilarity of non-commutative stochastic processes and proved the marginal distributions of selfsimilar processes with freely independent increments are freely selfdecomposable. In this paper, we firstly introduce a new definition, stronger than Fan's one in general, of selfsimilarity via linear combinations of non-commutative stochastic processes, although their two definitions are equivalent for non-commutative stochastic processes with freely independent increments. We secondly prove the converse of Fan's result, to complete the relationship between selfsimilar free additive processes and freely selfdecomposable distributions. Furthermore, we construct stochastic integrals with respect to free additive processes for representing the background driving free L{\'e}vy processes of freely selfdecomposable distributions. A relationship between freely selfdecomposable distributions and their background driving free L{\'e}vy processes in terms of their free cumulant transforms is also given, and several examples are discussed.

Explore related subjects

math.PRmath.OA

Keep this discovery

BibTeXRIS

Makoto Maejima, Noriyoshi Sakuma. 2022-02-24. Selfsimilar free additive processes and freely selfdecomposable distributions. https://arxiv.org/abs/2202.11848

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗