Logo image
Vertex-Glued Connected Finite Graphs and Mutually Free Semicircular Elements
Book chapter

Vertex-Glued Connected Finite Graphs and Mutually Free Semicircular Elements

Ilwoo Cho and Palle E. T. Jorgensen
Schur Analysis and Applications to Hypercomplex Analysis, Neural Networks, and Linear Systems, pp.203-243
Operator Theory: Advances and Applications, Springer Nature Switzerland
2026
DOI: 10.1007/978-3-032-02315-5_7

View Online

Abstract

In this chapter, we study a certain type of C∗ C^(*) -probability spaces induced by connected finite directed graphs. We are interested in free product of such C∗ C^(*) -probability spaces obtained by a combinatorial process constructing new graphs from given multigraphs under a rule, called the gluing. We characterize operator-algebraic, and free-probabilistic structures of resulted C∗ C^(*) -probability spaces from the gluing in terms of (free-probability-theoretic) free product (also implying the combinatorial properties of graphs), and consider free-distributional data on them. In particular, we are interested in semicircular elements whose free distributions are the semicircular law.
05C62 05C90 17A50 18B40 47A99 Directed graphs Fractal graphs Fractaloids Groupoids Semicircular elements

Details

Metrics

1 Record Views
Logo image