SearcharxivSearch

arXiv · 0708.0619

Gibbs Partitions (EPPF's) Derived From a Stable Subordinator are Fox H and Meijer G Transforms

Abstract

This paper derives explicit results for the infinite Gibbs partitions generated by the jumps of an $α-$stable subordinator, derived in Pitman \cite{Pit02, Pit06}. We first show that for general $α$ the conditional EPPF can be represented as ratios of Fox-$H$ functions, and in the case of rational $α,$ Meijer-G functions. Furthermore the results show that the resulting unconditional EPPF's, can be expressed in terms of H and G transforms indexed by a function h. Hence when h is itself a H or G function the EPPF is also an H or G function. An implication, in the case of rational $α,$ is that one can compute explicitly thousands of EPPF's derived from possibly exotic special functions. This would also apply to all $α$ except that computations for general Fox functions are not yet available. However, moving away from special functions, we demonstrate how results from probability theory may be used to obtain calculations. We show that a forward recursion can be applied that only requires calculation of the simplest components. Additionally we identify general classes of EPPF's where explicit calculations can be carried out using distribution theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Man-Wai Ho, Lancelot F. James, John W. Lau. 2007-08-29. Gibbs Partitions (EPPF's) Derived From a Stable Subordinator are Fox H and Meijer G Transforms. https://arxiv.org/abs/0708.0619

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