Robustness of Excitations in the Random Dimer Model
Daniel Reti

TL;DR
This paper investigates the robustness of the random dimer model's critical ground state to various excitations, revealing universality with the traveling salesman problem and confirming conjectures on combinatorial optimization scaling.
Contribution
It introduces a detailed numerical analysis of the random dimer model's response to maximum weight and {\epsilon}-coupling excitations, linking it to universality classes in optimization problems.
Findings
Results are compatible with random link excitation behavior.
Near-optimal configurations belong to the same universality class as the traveling salesman problem.
Finite size corrections are significant but do not alter the overall universality conclusions.
Abstract
The ground state solution of the random dimer model is at a critical point after, which has been shown with random link excitations. In this paper we test the robustness of the random dimer model to the random link excitation by imposing the maximum weight excitation. We numerically compute the scaling exponents of the curves arising in the model as well as the fractal dimension. Although strong finite size corrections are present, the results are compatible with that of the random link excitation. Furthermore, another form of excitation, the {\epsilon} - coupling excitation is studied. We find that near-optimal configurations belong to the same universality class as the travelling salesman problem. Thus, we confirm a conjecture on the scaling properties of combinatorial optimisation problems, for the specific case of minimum weight perfect matchings on 2-dimensional lattices. This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Complex Network Analysis Techniques · Theoretical and Computational Physics
