Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • 2 - Quantum probability approach to spectral analysis of growing graphs

  • Edited by R. A. Bailey, University of St Andrews, Scotland, Peter J. Cameron, University of St Andrews, Scotland, Yaokun Wu, Shanghai Jiao Tong University, China
  • Book:
    Groups and Graphs, Designs and Dynamics
    Published online:
    11 May 2024
    Print publication:
    30 May 2024, pp 87-175

  • Summary

    These lecture notes provide quantum probabilistic concepts and methods for spectral analysis of graphs, in particular, for the study of asymptotic behavior of the spectral distributions of growing graphs. Quantum probability theory is an algebraic generalization of classical (Kolmogorovian) probability theory, where an element of a (not necessarily commutative) ∗-algebra is treated as a random variable. In this aspect the concepts and methods peculiar to quantum probability are applied to the spectral analysis of adjacency matrices of graphs. In particular, we focus on the method of quantum decomposition and the use of various concepts of independence. The former discloses the noncommutative nature of adjacency matrices and gives a systematic method of computing spectral distributions. The latter is related to various graph products and provides a unified aspect in obtaining the limit spectral distributions as corollaries of various central limit theorems.

  • ESTRADA INDEX OF GENERAL WEIGHTED GRAPHS

  • Part of
  • YILUN SHANG
  • Journal:
    Bulletin of the Australian Mathematical Society / Volume 88 / Issue 1 / August 2013
    Published online by Cambridge University Press:
    28 September 2012, pp. 106-112
    Print publication:
    August 2013
    • Article
      • You have access
    • PDF
    • Export citation

  • Let $G$ be a general weighted graph (with possible self-loops) on $n$ vertices and $\lambda _1,\lambda _2,\ldots ,\lambda _n$ be its eigenvalues. The Estrada index of $G$ is a graph invariant defined as $EE=\sum _{i=1}^ne^{\lambda _i}$. We present a generic expression for $EE$ based on weights of short closed walks in $G$. We establish lower and upper bounds for $EE$in terms of low-order spectral moments involving the weights of closed walks. A concrete example of calculation is provided.