Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 461

The DOI matches its Crossref record.

Quantum Chaos on Graphs

Kottos, Tsampikos, Smilansky, Uzy·1997·Physical Review Letters

Abstract

We quantize graphs (networks) which consist of a finite number of bonds and nodes. We show that their spectral statistics is well reproduced by random matrix theory. We also define a classical phase space for the graph, where the dynamics is mixing and the periodic orbits (loops on the graph) proliferate exponentially. An exact trace formula for the quantum spectrum is developed and used to investigate the origin of the connection between random matrix theory and the underlying chaotic classical dynamics. Being an exact theory, and due to its relative simplicity, it offers new insights into this problem which is at the forefront of the research in quantum chaos and related fields.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.79.4794

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 461

Metadata

Authors
Kottos, T., & Smilansky, U.
Venue
Physical Review Letters
Published
1997-12-15
Volume
79
Issue
24
Pages
4794-4797
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2028396877
Cited by
461
References
0
FWCI
9.44
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Quantum Chaos on Graphs. https://app.cochat.ai/papers/10.1103/physrevlett.79.4794
The paper
Kottos, T., & Smilansky, U. (1997). Quantum Chaos on Graphs. Physical Review Letters. https://doi.org/10.1103/physrevlett.79.4794

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.