Nilpotent adjacency matrices, random graphs and quantum random variables

DOI10.1088/1751-8113/41/15/155205MaRDI QIDQ5460453zbMATH OpenOpenAlexFDO

Authors R. Schott, G. S. Staples

Publication date 28 April 2008

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1751-8113/41/15/155205

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Clifford algebras, spinors (15A66) Quantum computation (81P68) Quantum stochastic calculus (81S25)

Recommendations

• A new adjacency matrix for finite graphs
• Notions of independence in quantum probability and spectral analysis of graphs
• Quantum probability and spectral analysis of graphs. With a foreword by Professor Luigi Accardi.
• Nilpotent adjacency matrices and random graphs.
• Clifford algebras, random graphs, and quantum random variables

Cited in

(10)

• A new adjacency matrix for finite graphs
• Bethe states of random factor graphs
• Generalized zeon algebras: theory and application to multi-constrained path problems
• Nilpotent adjacency matrices and random graphs.
• scientific article; zbMATH DE number 2128183 (Why is no real title available?)
• Clifford algebras, random graphs, and quantum random variables
• Spinorial formulations of graph problems
• Connected components and evolution of random graphs: An algebraic approach
• Complexity of counting cycles using zeons
• Hamiltonian cycle enumeration via fermion-zeon convolution

This page was built for publication: Nilpotent adjacency matrices, random graphs and quantum random variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460453)