C*-algebras arising from directed graphs form a rich class of interesting C*-algebras which can be detected and analysed from the underlying combinatorial structure of the graphs encoded by them. The aim of this course is to describe properties of C*-algebras arising from graphs, such as simplicity, pure-infiniteness, K-theoretic properties, and see how the construction of these algebras encodes the information of graphs. This leads naturally into the study of Cuntz-Pimsner algebras, of which graph algebras are a special case.
Some knowledge of C*-algebras would be helpful but not required. In this case, a background in functional analysis, particularly analysis on Hilbert spaces, would be necessary.