Related papers: Graph Free Product of Noncommutative Probability s…
We investigate the integrability of the non-commutative leapfrog map in this paper. Firstly, we derive the explicit formula for the non-commutative leapfrog map and corresponding discrete zero-curvature equation by employing the concept of…
In this expository paper, we present a motivated construction of large graphs not containing a given complete bipartite subgraph. The key insight is that the algebraic constructions yield very non-smooth probability distributions.
Daily internet communication relies heavily on tree-structured graphs, embodied by popular data formats such as XML and JSON. However, many recent generative (probabilistic) models utilize neural networks to learn a probability distribution…
The topic of this treatise is a combinatorial technique called Graph Pebbling. We investigate pebbling numbers, weight functions, flow networks, hypercubes, and the zero-sum conjecture of Erd\H{o}s and Lemke. This investigation is a…
We give an alternative description of the top algebra of the free crossed square of algebras on 2-construction data in terms of tensors and coproducts of crossed modules of commutative algebras.
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these…
A continuous family of non-outer conjugate aperiodic automorphisms whose crossed-products are all isomorphic is given on every interpolated free group factor. An explicit "duality" relationship between compact co-commutative Kac algebra…
We investigate tensor products of random matrices, and show that independence of entries leads asymptotically to $\varepsilon$-free independence, a mixture of classical and free independence studied by M{\l}otkowski and by Speicher and…
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…
Graphical models are widely used in diverse application domains to model the conditional dependencies amongst a collection of random variables. In this paper, we consider settings where the graph structure is covariate-dependent, and…
The goal of this work is to develop, in a systematic way and in a full natural generality, the foundations of a theory of functions of (free) noncommuting variables.
In this paper, we will consider R-transform theory and R-transform calculus for compatible noncommutative probability space and amagamated noncommutative probability space. By doing this, we can realize the relation between scalar-valued…
Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs.…
The functional equation defining the free cumulants in free probability is lifted successively to the noncommutative Fa\`a di Bruno algebra, and then to the group of a free operad over Schr\"oder trees. This leads to new combinatorial…
Using the combinatorics of non-crossing partitions, we construct a conditionally free analogue of the Voiculescu's S-transform. The result is applied to analytical description of conditionally free multiplicative convolution and…
We examine the completely isometric automorphisms of a free product of noncommutative disc algebras. It will be established that such an automorphism is given simply by a completely isometric automorphism of each component of the free…
A very first step to develop non-commutative algebraic geometry is the arithmetic of polynomials in non-commuting variables over a commutative field, that is, the study of elements in free associative algebras. This investigation is…
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
A probability space is a pair ($\mathcal{A},\phi $) where $\mathcal{A}$ is an algebra and $\phi $ a state on the algebra. In classical probability $\mathcal{A}$ is the algebra of linear combinations of indicator functions on the sample…