SearcharxivSearch

arXiv subjects

Enli Chen

Publications and source records attributed to Enli Chen.

3 recordsLinked to original sources

Strongly convergent matrix models for $q$-Gaussian algebras

We construct strongly convergent finite-dimensional random matrix models for finite $q$-Gaussian family in the range $\vert q \vert < \sqrt{2}-1$. The construction has two stages. First, we show that normalized sums of graph-product semicirculars over an Erdos-Renyi graph satisfy the $q$-Toeplitz relations up to an operator norm error converging to zero in probability. Using ultraproduct methods, this yields complete strong convergence, uniformly over all matrix coefficient dimensions, for noncommutative polynomials with bounded degree. Second, we use a quantitative tensor-GUE for graph-product semicirculars to convert these operator models into finite-dimensional random matrices. For every fixed polynomial degree, the convergence is uniform over coefficient dimensions that may be larger than the dimension of the random matrices. As applications, in the above range of $q$, the C$^\ast$-algebra generated by a finite $q$-Gaussian family is MF, and the Brown-Douglas-Fillmore extension semigroup of the nontrivial C$^\ast$-algebra generated by a finite $q$-Gaussian family is not a group.

math.OA

Internal graphs of graph products of hyperfinite II$_1$-factors

In this paper, we show that for a graph $\Gamma$ from a class named H-rigid graphs, its subgraph ${\rm Int}(\Gamma)$, named the internal graph of $\Gamma$, is an isomorphism invariant of the graph product of hyperfinite II$_1$-factors $R_{\Gamma}$. In particular, we can classify $R_{\Gamma}$ for some typical types of graphs, such as lines, cyclic graphs and infinite regular trees. As an application, we also show that for two isomorphic graph products of hyperfinite II$_1$-factors over H-rigid graphs, the difference of the radius between the two graphs will not be larger than 1. Our proof is based on the recent resolution of the Peterson-Thom conjecture.

math.OA

Rigid Graph Products

We prove rigidity properties for von Neumann algebraic graph products. We introduce the notion of rigid graphs and define a class of II$_1$-factors named $\mathcal{C}_{\rm Rigid}$. For von Neumann algebras in this class we show a unique rigid graph product decomposition. In particular, we obtain unique prime factorization results and unique free product decomposition results for new classes of von Neumann algebras. Furthermore, we show that for many graph products of II$_1$-factors, including the hyperfinite II$_1$-factor, we can, up to a constant 2, retrieve the radius of the graph from the graph product. We also prove several technical results concerning relative amenability and embeddings of (quasi)-normalizers in graph products. Furthermore, we give sufficient conditions for a graph product to be nuclear and characterize strong solidity, primeness and free-indecomposability for graph products.

math.OA