Spectrum and Entropy for Infinite Directed Graphs

Jun Ichi Fujii ()
Additional contact information
Jun Ichi Fujii: Osaka Kyoiku University, Department of Arts and Sciences (Information Science)

Chapter Chapter 5 in Structural Analysis of Complex Networks, 2011, pp 105-136 from Springer

Abstract: Abstract 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.

Keywords: Infinite directed graph; Spectrum; Entropy; Numerical range; Fractal; Coding theory (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-4789-6_5

Ordering information: This item can be ordered from
http://www.springer.com/9780817647896

DOI: 10.1007/978-0-8176-4789-6_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().