Surmise for random matrices' level spacing distributions beyond nearest-neighbors

• URL: http://arxiv.org/abs/2504.20134v1
• Date: Mon, 28 Apr 2025 18:00:00 GMT
• Title: Surmise for random matrices' level spacing distributions beyond nearest-neighbors
• Authors: Ruth Shir, Pablo Martinez-Azcona, Aurélia Chenu,
• Abstract summary: Correlations between energy levels can help distinguish whether a many-body system is of integrable or chaotic nature.<n>For nearest-neighbor (NN) spectral spacings, the distribution in random matrices is well captured by the Wigner surmise.<n>We propose a corrected surmise for the $k$NN spectral distributions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Correlations between energy levels can help distinguish whether a many-body system is of integrable or chaotic nature. The study of short-range and long-range spectral correlations generally involves quantities which are very different, unless one uses the $k$-th nearest neighbor ($k$NN) level spacing distribution. For nearest-neighbor (NN) spectral spacings, the distribution in random matrices is well captured by the Wigner surmise. This well-known approximation, derived exactly for a 2$\times$2 matrix, is simple and satisfactorily describes the NN spacings of larger matrices. There have been attempts in the literature to generalize Wigner's surmise to further away neighbors. However, as we show, the current proposal in the literature does not accurately capture numerical data. Using the known variance of the distributions from random matrix theory, we propose a corrected surmise for the $k$NN spectral distributions. This surmise better characterizes spectral correlations while retaining the simplicity of Wigner's surmise. We test the predictions against numerical results and show that the corrected surmise is systematically better at capturing data from random matrices. Using the XXZ spin chain with random on-site disorder, we illustrate how these results can be used as a refined probe of many-body quantum chaos for both short- and long-range spectral correlations.

Related papers

• Efficiently learning and sampling multimodal distributions with data-based initialization [20.575122468674536]
  We consider the problem of sampling a multimodal distribution with a Markov chain given a small number of samples from the stationary measure. We show that if the Markov chain has a $k$th order spectral gap, samples from the stationary distribution will efficiently generate a sample whose conditional law is $varepsilon$-close in TV distance to the stationary measure.
  arXiv  Detail & Related papers  (2024-11-14T01:37:02Z)
• Distributional Matrix Completion via Nearest Neighbors in the Wasserstein Space [8.971989179518216]
  Given a sparsely observed matrix of empirical distributions, we seek to impute the true distributions associated with both observed and unobserved matrix entries. We utilize tools from optimal transport to generalize the nearest neighbors method to the distributional setting.
  arXiv  Detail & Related papers  (2024-10-17T00:50:17Z)
• Decomposing the Spectral Form Factor [0.0]
  Correlations between energies of a system's spectrum are one of the defining features of quantum chaos.<n>We investigate how each spectral distance contributes in building this two-point correlation function.<n>We show how the onset of the ramp, characterized either by the dip or the Thouless time, shifts to shorter times as contributions from longer-range spectral distance are included.
  arXiv  Detail & Related papers  (2023-11-15T19:00:01Z)
• Tackling Combinatorial Distribution Shift: A Matrix Completion Perspective [42.85196869759168]
  We study a setting we call distribution shift, where (a) under the test- and training-random data, the labels $z$ are determined by pairs of features $(x,y)$, (b) the training distribution has coverage of certain marginal distributions over $x$ and $y$ separately, but (c) the test distribution involves examples from a product distribution over $(x,y)$ that is not covered by the training distribution.
  arXiv  Detail & Related papers  (2023-07-12T21:17:47Z)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)
• Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions [29.488555741982015]
  We show a close connection between the mixing time of a broad class of Markov processes with generator $mathcalL$. We adapt techniques to speed up Markov chains to construct better score-matching losses. In particular, preconditioning' the diffusion can be translated to an appropriate preconditioning'' of the score loss.
  arXiv  Detail & Related papers  (2023-06-15T17:58:42Z)
• Approximating a RUM from Distributions on k-Slates [88.32814292632675]
  We find a generalization-time algorithm that finds the RUM that best approximates the given distribution on average. Our theoretical result can also be made practical: we obtain a that is effective and scales to real-world datasets.
  arXiv  Detail & Related papers  (2023-05-22T17:43:34Z)
• A Robust and Flexible EM Algorithm for Mixtures of Elliptical Distributions with Missing Data [71.9573352891936]
  This paper tackles the problem of missing data imputation for noisy and non-Gaussian data. A new EM algorithm is investigated for mixtures of elliptical distributions with the property of handling potential missing data. Experimental results on synthetic data demonstrate that the proposed algorithm is robust to outliers and can be used with non-Gaussian data.
  arXiv  Detail & Related papers  (2022-01-28T10:01:37Z)
• Implicit Data-Driven Regularization in Deep Neural Networks under SGD [0.0]
  spectral analysis of large random matrices involved in a trained deep neural network (DNN) We find that these spectra can be classified into three main types: Marvcenko-Pastur spectrum (MP), Marvcenko-Pastur spectrum with few bleeding outliers (MPB), and Heavy tailed spectrum (HT)
  arXiv  Detail & Related papers  (2021-11-26T06:36:16Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Linear-Sample Learning of Low-Rank Distributions [56.59844655107251]
  We show that learning $ktimes k$, rank-$r$, matrices to normalized $L_1$ distance requires $Omega(frackrepsilon2)$ samples. We propose an algorithm that uses $cal O(frackrepsilon2log2fracepsilon)$ samples, a number linear in the high dimension, and nearly linear in the matrices, typically low, rank proofs.
  arXiv  Detail & Related papers  (2020-09-30T19:10:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.