Spectrum and Entropy for Infinite Directed Graphs
From the viewpoint of operator theory, we discuss spectral properties for infinite directed graphs that have bounded valences. Graphs may have selfloops, but they are assumed not to have multiedges. Note that we use the transpose adjacency operator throughout this chapter by reason of this viewpoint. As a subsidiary effect, one may read this as a visual introduction to operator theory.
KeywordsInfinite directed graph Spectrum Entropy Numerical range Fractal Coding theory
Unable to display preview. Download preview PDF.
- 2.Arimoto S (1980) Probability, information and entropy (in Japanese). Morikita, TokyoGoogle Scholar
- 3.Cvetković DM, Doob M, Sachs H (1980) Spectra of graphs. Academic, New YorkGoogle Scholar
- 22.Paulsen I (1986) Completely bounded maps and dilations (Pitman Res Notes Math 146). LongmanGoogle Scholar
- 25.Ziv J (1978) Coding theorems for individual sequences. IEEE Trans Inf Theory IT-24:405–412Google Scholar