On operator-valued infinitesimal Boolean and monotone independence

We introduce the notion of operator-valued infinitesimal (OVI) Boolean independence and OVI monotone independence. Then we show that OVI Boolean (respectively, monotone) independence is equivalent to the operator-valued (OV) Boolean (respectively, monotone) independence over an algebra of [Formula: see text] upper triangular matrices. Moreover, we derive formulas to obtain the OVI Boolean (respectively, monotone) additive convolution by reducing it to the OV case. We also define OVI Boolean and monotone cumulants and study their basic properties. Moreover, for each notion of OVI independence, we construct the corresponding OVI Central Limit Theorem. The relations among free, Boolean and monotone cumulants are extended to this setting. Besides, in the Boolean case we deduce that the vanishing of mixed cumulants is still equivalent to independence, and use this to connect scalar-valued with matrix-valued infinitesimal Boolean independence.

Free-Boolean independence with amalgamation

In this paper, we develop the notion of free-Boolean independence in an amalgamated setting. We construct free-Boolean cumulants and show that the vanishing of mixed free-Boolean cumulants is equivalent to our free-Boolean independence with amalgamation. We also provide a characterization of free-Boolean independence by conditions in terms of mixed moments. In addition, we study free-Boolean independence over a [Formula: see text]-algebra and prove a positivity property. A central limit law for our free-Boolean independence with amalgamation is also studied.

A new notion of vertex independence and rank for finite graphs

A new notion of vertex independence and rank for a finite graph G is introduced. The independence of vertices is based on the boolean independence of columns of a natural boolean matrix associated to G. Rank is the cardinality of the largest set of independent columns. Some basic properties and some more advanced theorems are proved. Geometric properties of the graph are related to its rank and independent sets.

LIMIT THEOREMS IN Λ-BOOLEAN PROBABILITY

We introduce a notion of "Λ-boolean independence", which interpolates between the tensor and the boolean one. The central and the Poisson limit theorem are given in terms of the related orthogonal polynomials.

FILTERED STOCHASTIC CALCULUS

By introducing a color filtration to the multiplicity space [Formula: see text], we extend the quantum Itô calculus on multiple symmetric Fock space [Formula: see text] to the framework of filtered adapted biprocesses. In this new notion of adaptedness, "classical" time filtration makes the integrands similar to adapted processes, whereas "quantum" color filtration produces their deviations from adaptedness. An important feature of this calculus, which we call filtered stochastic calculus, is that it provides an explicit interpolation between the main types of calculi, regardless of the type of independence, including freeness, Boolean independence (more generally, m-freeness) as well as tensor independence. Moreover, it shows how boson calculus is "deformed" by other noncommutative notions of independence. The corresponding filtered Itô formula is derived. Existence and uniqueness of solutions of a class of stochastic differential equations are established and unitarity conditions are derived.