On multivariable cumulant polynomial sequences with applications

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending on what is plugged in the indeterminates, either sequences of moments either sequences of cumulants can be recovered. The main tool is a formal generalization of random sums, also with a multivariate random index and not necessarily integer-valued. Applications are given within parameter estimations, L\'evy processes and random matrices and, more generally, problems involving multivariate functions. The connection between exponential models and multivariable Sheffer polynomial sequences offers a different viewpoint in characterizing these models. Some open problems end the paper.Comment: 17 pages, In pres

Polynomial traces and elementary symmetric functions in the latent roots of a non-central Wishart matrix

Hypergeometric functions and zonal polynomials are the tools usually addressed in the literature to deal with the expected value of the elementary symmetric functions in non-central Wishart latent roots. The method here proposed recovers the expected value of these symmetric functions by using the umbral operator applied to the trace of suitable polynomial matrices and their cumulants. The employment of a suitable linear operator in place of hypergeometric functions and zonal polynomials was conjectured by de Waal in 1972. Here we show how the umbral operator accomplishes this task and consequently represents an alternative tool to deal with these symmetric functions. When special formal variables are plugged in the variables, the evaluation through the umbral operator deletes all the monomials in the latent roots except those contributing in the elementary symmetric functions. Cumulants further simplify the computations taking advantage of the convolution structure of the polynomial trace. Open problems are addressed at the end of the paper

On a representation of time space-harmonic polynomials via symbolic L\'evy processes

In this paper, we review the theory of time space-harmonic polynomials developed by using a symbolic device known in the literature as the classical umbral calculus. The advantage of this symbolic tool is twofold. First a moment representation is allowed for a wide class of polynomial stochastic involving the L\'evy processes in respect to which they are martingales. This representation includes some well-known examples such as Hermite polynomials in connection with Brownian motion. As a consequence, characterizations of many other families of polynomials having the time space-harmonic property can be recovered via the symbolic moment representation. New relations with Kailath-Segall polynomials are stated. Secondly the generalization to the multivariable framework is straightforward. Connections with cumulants and Bell polynomials are highlighted both in the univariate case and in the multivariate one. Open problems are addressed at the end of the paper

On the computation of classical, boolean and free cumulants

This paper introduces a simple and computationally efficient algorithm for conversion formulae between moments and cumulants. The algorithm provides just one formula for classical, boolean and free cumulants. This is realized by using a suitable polynomial representation of Abel polynomials. The algorithm relies on the classical umbral calculus, a symbolic language introduced by Rota and Taylor in 1994, that is particularly suited to be implemented by using software for symbolic computations. Here we give a MAPLE procedure. Comparisons with existing procedures, especially for conversions between moments and free cumulants, as well as examples of applications to some well-known distributions (classical and free) end the paper.Comment: 14 pages. in press, Applied Mathematics and Computatio

Natural statistics for spectral samples

Spectral sampling is associated with the group of unitary transformations acting on matrices in much the same way that simple random sampling is associated with the symmetric group acting on vectors. This parallel extends to symmetric functions, k-statistics and polykays. We construct spectral k-statistics as unbiased estimators of cumulants of trace powers of a suitable random matrix. Moreover we define normalized spectral polykays in such a way that when the sampling is from an infinite population they return products of free cumulants.Comment: Published in at http://dx.doi.org/10.1214/13-AOS1107 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

On some applications of a symbolic representation of non-centered L\'evy processes

By using a symbolic technique known in the literature as the classical umbral calculus, we characterize two classes of polynomials related to L\'evy processes: the Kailath-Segall and the time-space harmonic polynomials. We provide the Kailath-Segall formula in terms of cumulants and we recover simple closed-forms for several families of polynomials with respect to not centered L\'evy processes, such as the Hermite polynomials with the Brownian motion, the Poisson-Charlier polynomials with the Poisson processes, the actuarial polynomials with the Gamma processes, the first kind Meixner polynomials with the Pascal processes, the Bernoulli, Euler and Krawtchuk polynomials with suitable random walks

CUB models: a preliminary fuzzy approach to heterogeneity

In line with the increasing attention paid to deal with uncertainty in ordinal data models, we propose to combine Fuzzy models with \cub models within questionnaire analysis. In particular, the focus will be on \cub models' uncertainty parameter and its interpretation as a preliminary measure of heterogeneity, by introducing membership, non-membership and uncertainty functions in the more general framework of Intuitionistic Fuzzy Sets. Our proposal is discussed on the basis of the Evaluation of Orientation Services survey collected at University of Naples Federico II.Comment: 10 pages, invited contribution at SIS2016 (Salerno, Italy), in SIS2016 proceeding

Towards the Modeling of Neuronal Firing by Gaussian Processes

This paper focuses on the outline of some computational methods for the approximate solution of the integral equations for the neuronal firing probability density and an algorithm for the generation of sample-paths in order to construct histograms estimating the firing densities. Our results originate from the study of non-Markov stationary Gaussian neuronal models with the aim to determine the neuron's firing probability density function. A parallel algorithm has been implemented in order to simulate large numbers of sample paths of Gaussian processes characterized by damped oscillatory covariances in the presence of time dependent boundaries. The analysis based on the simulation procedure provides an alternative research tool when closed-form results or analytic evaluation of the neuronal firing densities are not available.Comment: 10 pages, 3 figures, to be published in Scientiae Mathematicae Japonica