Network models in class C on arbitrary graphs

DOI10.1007/S00220-005-1304-YzbMATH Open1079.81075arXivmath-ph/0406044OpenAlexW3098428853MaRDI QIDQ2575365FDOQ2575365

John L. Cardy

Publication date: 9 December 2005

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Abstract: We consider network models of quantum localisation in which a particle with a two-component wave function propagates through the nodes and along the edges of an arbitrary directed graph, subject to a random SU(2) rotation on each edge it traverses. The propagation through each node is specified by an arbitrary but fixed S-matrix. Such networks model localisation problems in class C of the classification of Altland and Zirnbauer, and, on suitable graphs, they model the spin quantum Hall transition. We extend the analyses of Gruzberg, Ludwig and Read and of Beamond, Cardy and Chalker to show that, on an arbitrary graph, the mean density of states and the mean conductance may be calculated in terms of observables of a classical history-dependent random walk on the same graph. The transition weights for this process are explicitly related to the elements of the S-matrices. They are correctly normalised but, on graphs with nodes of degree greater than 4, not necessarily non-negative (and therefore interpretable as probabilities) unless a sufficient number of them happen to vanish. Our methods use a supersymmetric path integral formulation of the problem which is completely finite and rigorous.

Full work available at URL: https://arxiv.org/abs/math-ph/0406044

Mathematics Subject Classification ID

Applications of graph theory (05C90) Many-body theory; quantum Hall effect (81V70)

Cites Work

• Riemannian symmetric superspaces and their origin in random-matrix theory
• Wavefunction statistics and multifractality at the spin quantum Hall transition
• Linking Numbers for Self-Avoiding Loops and Percolation: Application to the Spin Quantum Hall Transition

Cited In (9)

• Finite-size left-passage probability in percolation
• Title not available (Why is that?)
• QUANTUM NETWORK MODELS AND CLASSICAL LOCALIZATION PROBLEMS
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• Title not available (Why is that?)
• Counting graphs and null models of complex networks: configuration model and extensions
• The superspin approach to a disordered quantum wire in the chiral-unitary symmetry class with an arbitrary number of channels
• Orbit measures, random matrix theory and interlaced determinantal processes
• Cayley graphs as models of deterministic small-world networks

This page was built for publication: Network models in class \(C\) on arbitrary graphs

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