Related papers: Traces On Diagram Algebras I: Free Partition Quant…

We describe the central measures for the random walk on graded graphs. Using this description, we obtain the list of all finite traces on three infinite-dimensional algebras: on the Brauer algebra, on the partition algebra, and on the…

In continuation of our recent work arXiv:2006.07312, we classify the extremal traces on infinite diagram algebras that appear in the context of Schur-Weyl duality for Banica and Speicher's easy groups. We show that the branching graphs of…

We review the classification of positive extremal traces on the generic infinite Temperley-Lieb algebra, and then extend the classification to the non-semisimple root of unity case. As a result, we obtain Hilbert space structures on the…

We study fine structure related to finitely supported random walks on infinite finitely generated discrete groups, largely motivated by dimension group techniques. The unfaithful extreme harmonic functions (defined only on proper space-time…

In this note we present new examples of determinantal point processes with infinitely many particles. The particles live on the half-lattice {1,2,...} or on the open half-line (0,+\infty). The main result is the computation of the…

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

We study the C*-algebras and von Neumann algebras associated with the universal discrete quantum groups. They give rise to full prime factors and simple exact C*-algebras. The main tool in our work is the study of an amenable boundary…

A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ…

A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…

With the constant flow of data from vast sources over the past decades, a plethora of advanced analytical techniques have been developed to extract relevant information from different data types ranging from labeled data, quasi-labeled…

For an $n$-vertex graph $G$, let $z(G;k)$ denote the number of zero forcing sets of size $k$. A conjecture of Boyer et al. asserts that the path $P_n$ maximizes these numbers coefficientwise among all $n$-vertex graphs; equivalently, the…

We study subcoalgebras of path coalgebras that are spanned by paths (called path subcoalgebras) and subcoalgebras of incidence coalgebras, and propose a unifying approach for these classes. We discuss the left quasi-co-Frobenius and the…

Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…

In a recent article, we gave a definition of partition C*-algebras. These are universal C*-algebras based on algebraic relations which are induced from partitions of sets. In this follow up article, we show that often we can associate a…

We study the class of selfless C*-probability spaces introduced by Robert. It is known that a selfless tracial algebra has strict comparison and a unique trace. We prove that for separable tracial C*-algebras, selflessness is equivalent to…

We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

We study probabilistic and combinatorial aspects of natural volume-and-trace weighted plane partitions and their continuous analogues. We prove asymptotic limit laws for the largest parts of these ensembles in terms of new and known hard-…

Using the proposed by us thinning approach to describe extreme matrices, we find an explicit exponentiation formula linking classical extreme laws of Fr\'echet, Gumbel and Weibull given by Fisher-Tippet-Gnedenko classification and free…

Two automorphisms of a simple stable AF algebra with a finite dimensional lattice of lower semicontinuous traces are shown to be outer conjugate if they act in the same way on the K-group and the extremal traces are scaled by numbers which…