Spectrum and Entropy for Infinite Directed Graphs

  • Jun Ichi Fujii


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.


Infinite directed graph Spectrum Entropy Numerical range Fractal Coding theory 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Accardi L, Staszewski R, Salacity R (2007) Decompositions of the free product of graphs. Infix Dampens Anal Quantum Probed Relax Top 10:303–334. Google Scholar
  2. 2.
    Arimoto S (1980) Probability, information and entropy (in Japanese). Morikita, TokyoGoogle Scholar
  3. 3.
    Cvetković DM, Doob M, Sachs H (1980) Spectra of graphs. Academic, New YorkGoogle Scholar
  4. 4.
    Edgar GA (1990) Measure, topology and fractal geometry. Springer, New YorkMATHGoogle Scholar
  5. 5.
    Fujii JI (1993) Entropy of graphs. Math Japon 38:39–46MATHMathSciNetGoogle Scholar
  6. 6.
    Fujii JI (1995) The Marcus-Khan theorem for Hilbert space operators. Math Japon 41:531–535MATHMathSciNetGoogle Scholar
  7. 7.
    Fujii JI, Fujii M (1993) Theorems of Williams and Pasadena. Math Japon 38:35–37MATHMathSciNetGoogle Scholar
  8. 8.
    Fujii JI, Fujii M (2002) Kolmogorov’s complexity for positive definite matrices. Lin Algebra Appl 341:171–180MATHCrossRefGoogle Scholar
  9. 9.
    Fujii JI, Seo Y (1993) Graphs and numerical center of mass. Math Japon 38:351–359MATHMathSciNetGoogle Scholar
  10. 10.
    Fujii JI, Seo Y (1995) Graphs and tensor products of operators. Math Japon 41:245–252MATHMathSciNetGoogle Scholar
  11. 11.
    Fujii JI, Seo Y (1997) Entropy and coding for graphs. Int J Math Stat Sci 6(1):63–77MATHMathSciNetGoogle Scholar
  12. 12.
    Fujii M, Sasaoka H, Watatani Y (1989) Adjacency operators of infinite directed graphs. Math Japon 34:727–735MATHMathSciNetGoogle Scholar
  13. 13.
    Fujii M, Sasaoka H, Watatani Y (1990) The numerical range of an infinite directed graph. Math Japon 35:577–582MATHMathSciNetGoogle Scholar
  14. 14.
    Fujii JI, Sasaoka H, Watatani Y (1991) The spectrum of an infinite directed graph. Math Japon 36:607–625MATHMathSciNetGoogle Scholar
  15. 15.
    Fujii M, Nakamoto M, Seo Y (1996) Graphs and Gersgorin’s theorem. Math Japon 44:517–523MathSciNetGoogle Scholar
  16. 16.
    Fujii M, Nakamoto M, Seo Y, Watatani Y (1996) Graphs and Kolmogorov’s complexity. Math Japon 44:113–117MATHMathSciNetGoogle Scholar
  17. 17.
    Furuta T (2001) Invitation to linear operators. Taylor & Francis, New YorkMATHGoogle Scholar
  18. 18.
    Halmos PR (1982) A Hilbert space problem book, 2nd edn. Springer, Berlin, New YorkMATHGoogle Scholar
  19. 19.
    Matsumoto A, Seo Y (1996) Graphs and Fibonacci numbers. Math Japon 44:317–322MATHMathSciNetGoogle Scholar
  20. 20.
    Mohar B (1982) The spectrum of an infinite graph. Lin Algebra Appl 48:245–256MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Mohar B, Woess W (1989) A survey on spectra of infinite graphs. Bull Lond Math Soc 21: 209–234MATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Paulsen I (1986) Completely bounded maps and dilations (Pitman Res Notes Math 146). LongmanGoogle Scholar
  23. 23.
    Schaefer HH (1980) Topological vector spaces. Springer, Berlin, New YorkMATHGoogle Scholar
  24. 24.
    Seo Y (1993) Graphs and nilpotent operators. Math Japon 38:1089–1093MATHMathSciNetGoogle Scholar
  25. 25.
    Ziv J (1978) Coding theorems for individual sequences. IEEE Trans Inf Theory IT-24:405–412Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Arts and Sciences (Information Science)Osaka Kyoiku UniversityKashiwaraJapan

Personalised recommendations