SearcharxivSearch

arXiv · math/0403185

Measure convolution semigroups and non-infinitely divisible probability distributions

Abstract

Let $μ$ be a probability measure (or corresponding random variable) such that all moments $μ_n$ exist. Knowledge of the moments is not sufficient to determine infinite divisibility of the measure; we show also that infinitely divisible, and in particular lognormal, distributions lose infinitely divisibilty when censored in certain ways even if all moments are arbitrarily close to those of the uncensored distribution. The moments of a composition of k copies of $μ$ are expressed as combinatorial compositions of the $μ_n$. We express the moments of the compositions in the context of occupancy problems, arranging n balls in k cells; the classical convolution is described by Maxwell-Boltzmann statistics and is multinomial. For certain non-infinitely divisible measures with moments increasing fast enough the indexing of a k-cell combinatorial composition is extended to indexing by non-negative real t and we construct classical convolution measure semigroups from amongst the t-indexed classes. We prove also that when a random variable with infinitely divisible distribution is embedded in a Lévy process $(Y_t)$ then the t-indexed Maxwell-Boltzmann is the law of $Y_t$. In order to get moment-based multinomial compositions indexed by a continuum we use random measures and random distributions rather than random variables. An alternative approach to embeddability of a non-infinitely divisible $μ$ is by considering non-classical convolution measure semigroups; for example embedding $μ$ in a Boolean convolution measure semigroup and retaining the multinomial character of the moments.embedding $μ$ in a Boolean convolution measure semigroup and retaining the multinomial character of the moments. Embedding $μ$ in an Urbanik convolution measure semigroup loses their multinomial character .

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aubrey Wulfsohn. 2004-03-10. Measure convolution semigroups and non-infinitely divisible probability distributions. https://arxiv.org/abs/math/0403185

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