相关论文: Conditionally monotone independence and the associ…
The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas…
We show how to reduce free independence to tensor independence in the strong sense. We construct a suitable unital *-algebra of closed operators `affiliated' with a given unital *-algebra and call the associated closure `monotone'. Then we…
We define a product of algebraic probability spaces equipped with two states. This product is called a conditionally monotone product. This product is a new example of independence in non-commutative probability theory and unifies the…
The paper gives an operator algebras model for the conditional monotone independence, introduced by T. Hasebe. The construction is used to prove an embedding result for the N. Muraki's monotone product of C*-algebras. Also, the formulas…
We study the multiplicative convolution for c-monotone independence. This convolution unifies the monotone, Boolean and orthogonal multiplicative convolutions. We characterize convolution semigroups for the c-monotone multiplicative…
We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the…
We introduce and study a new type of convolution of probability measures called the orthogonal convolution, which is related to the monotone convolution. Using this convolution, we derive alternating decompositions of the free additive…
In this paper, we examine how various notions of independence in non-commutative probability theory arise in bi-free probability. We exhibit how Boolean and monotone independence occur from bi-free pairs of faces and establish a Kac/Loeve…
Starting from elementary considerations about independence and Markov processes in classical probability we arrive at the new concept of conditional monotone independence (or operator-valued monotone independence). With the help of product…
The notion of monotonic independence, introduced by N. Muraki, is considered in a more general frame, similar to the construction of operator-valued free probability. The paper presents constructions for maps with similar properties to the…
Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…
We show that if a graph $G$ involves a certain square grid graph as a full subgraph, then a certain operation on it yields a simplicial suspension of the independence complex of $G$. This generalizes a result of Csorba. As a corollary, we…
We introduce a notion of non-commutative joint independence for multiple algebras in a non-commutative probability space. The pairwise relationships between these algebras are encoded by a graph with two edge sets -- a combinatorial…
We develop a systematic approach to the study of independence in topological dynamics with an emphasis on combinatorial methods. One of our principal aims is to combinatorialize the local analysis of topological entropy and related mixing…
We consider random graphs in which the edges are allowed to be dependent. In our model the edge dependence is quite general, we call it $p$-robust random graph. It means that every edge is present with probability at least $p$, regardless…
We introduce the notion of BMT independence, allowing us to take arbitrary mixtures of boolean, monotone, and tensor independence and generalizing the notion of BM independence of Wysoczanski. Pair-wise independence relations are encoded…
Unlike classical and free independence, the boolean and monotone notions of independence lack of the property of independent constants. In the scalar case, this leads to restrictions for the central limit theorems, as observed by F.…
In this work we study conditional monotone cumulants and additive convolution in the shuffle-algebraic approach to non-commutative probability. We describe c-monotone cumulants as an infinitesimal character and identify the c-monotone…
We investigate operator-valued monotone independence, a noncommutative version of independence for conditional expectation. First we introduce operator-valued monotone cumulants to clarify the whole theory and show the moment-cumulant…
A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be…