RECORD
Extremal eigenvalue fluctuations in the GUE minor process and the law of fractional logarithm
Probability · Submitted 21 May 2015
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show the analogue of the law of iterated logarithm for this sequence, i.e. we divide the normalized n-th eigenvalue by a logarithmic factor and show the limsup of this sequence is a constant almost surely.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We consider the GUE minor process, where a sequence of GUE matrices is drawn from the corner of a doubly infinite array of i.i.d. standard normal variables subject to the symmetry constraint. From each matrix, we take its largest eigenvalue, appropriately rescaled to converge to the standard Tracy-Widom distribution. We show the analogue of the law of iterated logarithm for this sequence, i.e. we divide the normalized n-th eigenvalue by a logarithmic factor and show the limsup of this sequence is a constant almost surely. We also give almost sure bounds for the appropriately scaled liminf.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We consider the GUE minor process, where a sequence of GUE matrices is drawn from the corner of a doubly infinite array of i.i.d. standard normal variables subject to the symmetry constraint. | background 0.46 | 0.31 | 0.02 | asserted 0.81 |
| s1 | From each matrix, we take its largest eigenvalue, appropriately rescaled to converge to the standard Tracy-Widom distribution. | method 0.94 | 0.70 | 0.04 | asserted 0.86 |
| s2 | We show the analogue of the law of iterated logarithm for this sequence, i.e. we divide the normalized n-th eigenvalue by a logarithmic factor and show the limsup of this sequence is a constant almost surely. | result 0.94 | 0.96 | 0.86 | asserted 1.00 |
| s3 | We also give almost sure bounds for the appropriately scaled liminf. | result 0.95 | 0.94 | 0.09 | asserted 0.99 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We consider the GUE minor process, where a sequence of GUE matrices is drawn from the corner of a doubly infinite array of i.i.d. standard normal variables subject to the symmetry constraint. From each matrix, we take its largest eigenvalue, appropriately rescaled to converge to the standard Tracy-Widom distribution. We show the analogue of the law of iterated logarithm for this sequence, i.e. we divide the normalized n-th eigenvalue by a logarithmic factor and show the limsup of this sequence is a constant almost surely. We also give almost sure bounds for the appropriately scaled liminf.
Human review
How the literature uses it
1 arXiv paper cite this in 1 sentence
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.