Central limit theorems for large graphs: Method of quantum decomposition

Yukihiro Hashimoto, Akihito Hora, Nobuaki Obata

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


A new method is proposed for investigating spectral distribution of the combinatorial Laplacian (adjacency matrix) of a large regular graph on the basis of quantum decomposition and quantum central limit theorem. General results are proved for Cayley graphs of discrete groups and for distance-regular graphs. The Coxeter groups and the Johnson graphs are discussed in detail by way of illustration. In particular, the limit distributions obtained from the Johnson graphs are characterized by the Meixner polynomials which form a one-parameter deformation of the Laguerre polynomials.

Original languageEnglish
Pages (from-to)71-88
Number of pages18
JournalJournal of Mathematical Physics
Issue number1
Publication statusPublished - 2003 Jan 1


Dive into the research topics of 'Central limit theorems for large graphs: Method of quantum decomposition'. Together they form a unique fingerprint.

Cite this