arXiv:2602.08196v3

Anderson localization on quantum graphs coded by elements of a subshift of finite type

Oleg Safronov

math-phmath.DS37A0534L05

Abstract

We study Schrödinger operators on quantum graphs where the number of edges between points is determined by orbits of a "shift of finite type". We prove Anderson localization for these systems.

AI-generated audit

Audit summary

Audited against arXiv v3

Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.

Current report

Detailed mathematical audit

Generated August 18, 2026
01Statements2 reported findingsCorrect

The almost-sure pure-point spectral type on [0,)[0,\infty) and exponential localization away from the finite exceptional congruence classes are correct for the subshift-coded quantum graphs under the full-support bounded-distortion assumptions.

Theorem 1.1Correct

Positive Lyapunov exponent and large deviations imply localization

Pages 2–3 and Sections 2–4 · arXiv:2602.08196v3

For kπZk\notin\pi\mathbb Z, Kirchhoff matching reduces the edge equation to the displayed locally constant SL(2,R)\mathrm{SL}(2,\mathbb R) cocycle. The cited positivity theorem leaves only a finite exceptional set modulo 2π2\pi. Uniform large deviations and the elimination of double resonances yield exponential decay of generalized eigenfunctions at all remaining energies. At the resonant edge energies, compactly supported transverse modes and the separate argument complete the pure-point spectral description, while Weyl sequences give the full spectral set [0,)[0,\infty).

Full paper, version 3
Theorem 2.8 and Theorem 2.11Correct

Uniform cocycle large deviations supply the localization input away from resonances

Section 2 · arXiv:2602.08196v3

On compact energy intervals excluding the finitely many congruence classes, the transfer cocycle is irreducible with positive Lyapunov exponent. Hölder large deviations are uniform there, and the Green-function consequence has the exponential scale required by the main localization theorem.

02Proofs2 reported findingsCorrect

The quantum-graph reduction, cocycle estimates, large deviations, resonance elimination, and spectral conclusion are correct and complete.

Sections 2–4Correct and complete

Discrete localization transfers back to the metric graph

Pages 3–28 · Sections 2–4 · arXiv:2602.08196v3

The interpolation formula on each unit edge is valid away from πZ\pi\mathbb Z, and bounded edge multiplicities make decay of vertex values equivalent to decay along the graph. Bounded distortion provides the quasi-independence used in the large-deviation and Borel–Cantelli steps. Schnol-type generalized eigenfunctions are reduced to the cocycle equation before the multiscale estimate is applied.

Sections 2–3Correct and complete

Graph reduction, large deviations, and resonance elimination form a complete localization proof

Pages 8–43 · arXiv:2602.08196v3

Vertex matching reduces generalized eigenfunctions to the stated one-dimensional matrix recursion. Uniform cocycle deviations give exponentially good Green blocks; a Borel–Cantelli elimination of double resonances chains these blocks, and the generalized-eigenfunction criterion then yields pure point spectrum with exponential decay.

03Novelty0 reported findingsNo non-novelty findings

No non-novelty findings.

Detailed audit reportFull reasoning, manuscript locations, and references.
Open report PDF ↗

Author response

Challenge an audit finding

Local workflow preview

A listed author may submit formal evidence that an audit is inaccurate. The response would be considered in a fresh AI re-evaluation; it would not edit the audit automatically.

Paper
arXiv:2602.08196v3
Authors listed
Oleg Safronov
Audit date
August 18, 2026
  1. 01Establish identityMatch an authenticated scholarly identity to this paper.
  2. 02Submit evidenceIdentify the finding and give a formal mathematical response.
  3. 03Re-evaluateA separate agent checks the response and records a disposition.
Recommended production method

Authenticate with ORCID, then require an exact arXiv match

MathAudit should accept the identity only when ORCID OAuth authenticates the claimant's iD and this exact arXiv paper appears in arXiv's public authority feed for that iD. A matching name alone is not sufficient.

ORCID OAuth and arXiv authority-record lookup are not connected in this local prototype.

Email fallback for papers without a linked ORCID

A production fallback could send a one-time link only when the submitted address matches an independently maintained author-contact allowlist for this paper. MathAudit must return the same message for every address so the form cannot reveal which contacts are on that list.

This demonstration does not send, store, or compare the address.

Structured response preview

This form remains unavailable until production identity verification succeeds. Nothing entered here is submitted.

This panel never establishes authorship in the local prototype. A production result should be described narrowly as an authenticated ORCID match or control of a separately allowlisted author-contact mailbox.