SearcharxivSearch

arXiv · 0706.4073

Some generic properties of level spacing distributions of 2D real random matrices

Abstract

We study the level spacing distribution $P(S)$ of 2D real random matrices both symmetric as well as general, non-symmetric. In the general case we restrict ourselves to Gaussian distributed matrix elements, but different widths of the various matrix elements are admitted. The following results are obtained: An explicit exact formula for $P(S)$ is derived and its behaviour close to S=0 is studied analytically, showing that there is linear level repulsion, unless there are additional constraints for the probability distribution of the matrix elements. The constraint of having only positive or only negative but otherwise arbitrary non-diagonal elements leads to quadratic level repulsion with logarithmic corrections. These findings detail and extend our previous results already published in a preceding paper. For the {\em symmetric} real 2D matrices also other, non-Gaussian statistical distributions are considered. In this case we show for arbitrary statistical distribution of the diagonal and non-diagonal elements that the level repulsion exponent $\rho$ is always $\rho = 1$, provided the distribution function of the matrix elements is regular at zero value. If the distribution function of the matrix elements is a singular (but still integrable) power law near zero value of $S$, the level spacing distribution $P(S)$ is a fractional exponent pawer law at small $S$. The tail of $P(S)$ depends on further details of the matrix element statistics. We explicitly work out four cases: the constant (box) distribution, the Cauchy-Lorentz distribution, the exponential distribution and, as an example for a singular distribution, the power law distribution for $P(S)$ near zero value times an exponential tail.

Explore related subjects

Keep this discovery

BibTeXRIS

S. Grossmann, M. Robnik. 2007-06-27. Some generic properties of level spacing distributions of 2D real random matrices. https://doi.org/10.1515/zna-2007-0902

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD