Non-tracial free graph von Neumann algebras
Michael Hartglass, Brent Nelson

TL;DR
This paper classifies non-tracial free graph von Neumann algebras based on edge weightings, showing they are either interpolated free group factors or free Araki-Woods factors, with explicit dependence on graph structure and weights.
Contribution
It extends previous results from vertex weightings to edge weightings, identifying the isomorphism class as either a free group factor or a free Araki-Woods factor, depending on the subgroup generated by edge weights.
Findings
Classifies von Neumann algebras from weighted graphs.
Determines when the algebra is a free group factor or a free Araki-Woods factor.
Provides explicit spectral and structural descriptions based on graph weights.
Abstract
Given a finite, directed, connected graph equipped with a weighting on its edges, we provide a construction of a von Neumann algebra equipped with a faithful, normal, positive linear functional . When the weighting is instead on the vertices of , the first author showed the isomorphism class of depends only on the data and is an interpolated free group factor equipped with a scaling of its unique trace (possibly direct sum copies of ). Moreover, the free dimension of the interpolated free group factor is easily computed from . In this paper, we show for a weighting on the edges of that the isomorphism class of depends only on the data , and is either as in the vertex weighting case or is a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
