Nilpotent adjacency matrices, random graphs and quantum random variables

DOI10.1088/1751-8113/41/15/155205zbMath1137.81026OpenAlexW1982749113MaRDI QIDQ5460453

René Schott, George Stacey 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

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

Related Items (5)

Generalized zeon algebras: theory and application to multi-constrained path problems ⋮ 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