Minicourse IV: Asymptotic Spectral Analysis of Growing Graphs —— a quantum probability point of view
Minicourse IV: Asymptotic Spectral Analysis of Growing Graphs —— a quantum probability point of view
复制标题
DOI:
--
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
N. Obata
中科院分区:
文献类型:
--
作者:
N. Obata
These lectures provide some topics in asymptotic spectral analysis of growing (or large) graphs from a quantum probability point of view. By growing graphs we mean just a sequence of graphs where the number of vertices tends to the infinity. In fact, we focus on spectra of the adjacency matrices of graphs and study their asymptotics when the graph grows. Thus our theme naturally stands at the crossroads of probability, analysis and combinatorics, and also in line with Vershik’s idea of asymptotic combinatorics [34, 35]. Moreover, we have in mind a contribution to the mathematical theory for complex networks, see e.g., [10, 11, 23]. The quantum (or non-commutative) probability theory, tracing back to the famous work by von Neumann [37], where the original aim was to solve statistical questions of quantum mechanics, has been recently established as a new mathematical paradigm for non-commutative analysis. As the concepts and techniques in classical probability theory such as the law of large numbers (LLN), central limit theorem (CLT), large deviation principle (LDP) and so forth have been successfully applied to asymptotic problems, quantum probability is naturally expected to play an essential role in exploring statistical properties of non-commutative systems. During these lectures we see how quantum probabilistic ideas and methods are applied to spectral analysis of graphs, in particular, of growing graphs.