Loading…
Computing moments of free additive convolution of measures
This short note explains how to use ready-to-use components of symbolic software to convert between the free cumulants and the moments of measures without sophisticated programming. This allows quick access to low order moments of free convolutions of measures, which can be used to test whether a gi...
Saved in:
Published in: | Applied mathematics and computation 2007-12, Vol.194 (2), p.561-567 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This short note explains how to use ready-to-use components of symbolic software to convert between the free cumulants and the moments of measures without sophisticated programming. This allows quick access to low order moments of free convolutions of measures, which can be used to test whether a given probability measure is a free convolution of other measures. |
---|---|
ISSN: | 0096-3003 1873-5649 |
DOI: | 10.1016/j.amc.2007.04.025 |