2000
DOI: 10.1006/aima.2000.1936
|View full text |Cite
|
Sign up to set email alerts
|

Free Stochastic Measures via Noncrossing Partitions

Abstract: We consider free multiple stochastic measures in the combinatorial framework of the lattice of all diagonals of an n-dimensional space. In this free case, one can restrict the analysis to only the noncrossing diagonals. We give definitions of what free multiple stochastic measures are, and calculate them for the free Poisson and free compound Poisson processes. We also derive general combinatorial Ito^-type relationships between free stochastic measures of different orders. These allow us to calculate, for exa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
56
0

Year Published

2002
2002
2014
2014

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 21 publications
(56 citation statements)
references
References 20 publications
0
56
0
Order By: Relevance
“…Let X be a free stochastic measure with distribution m. Proof. For part (1), by stationarity, it suffices to prove that…”
Section: Call the Coefficients {Rmentioning
confidence: 99%
See 2 more Smart Citations
“…Let X be a free stochastic measure with distribution m. Proof. For part (1), by stationarity, it suffices to prove that…”
Section: Call the Coefficients {Rmentioning
confidence: 99%
“…Our main references for the background in free probability are [9,12]; see also the references in [1]. Let n be a compactly supported…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…There are two natural conventions for multiplying permutations: functional notation and algebraist notation. We use the algebraic convention throughout so that (1, 2)(1, 3) is (1, 2, 3) rather than (1,3,2). Because of all the symmetries of the objects under consideration this is only of minor importance, but it means that we need to write "prefix" rather than "suffix" in the foregoing definition.…”
Section: Symmetric Groupsmentioning
confidence: 99%
“…First defined and studied by Germain Kreweras in 1972 [33], it caught the imagination of combinatorialists beginning in the 1980s [20], [21], [22], [23], [29], [37], [39], [40], [45], and has come to be regarded as one of the standard objects in the field. In recent years it has also played a role in areas as diverse as lowdimensional topology and geometric group theory [9], [12], [13], [31], [32] as well as the noncommutative version of probability [2], [3], [35], [41], [42], [43], [49], [50]. Due no doubt to its recent vintage, it is less well-known to the mathematical community at large than perhaps it deserves to be, but hopefully this short paper will help to remedy this state of affairs.…”
Section: Introductionmentioning
confidence: 99%