Related papers: Local Extrema in Quantum Chaos
We consider the signed density of the extremal points of (two-dimensional) scalar fields with a Gaussian distribution. We assign a positive unit charge to the maxima and minima of the function and a negative one to its saddles. At first, we…
We investigate the spread complexity of a generic two-level subsystem of a larger system to analyze the influence of energy level statistics, comparing chaotic and integrable systems. Initially focusing on the nearest-neighbor level…
Level curvature is a measure of sensitivity of energy levels of a disordered/chaotic system to perturbations. In the bulk of the spectrum Random Matrix Theory predicts the probability distributions of level curvatures to be given by…
In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…
For a distribution advected by a simple chaotic map with diffusion, the "strange eigenmode" is investigated from the Lagrangian (material) viewpoint and compared to its Eulerian (spatial) counterpart. The eigenmode embodies the balance…
We offer an alternative proof, using the Stein-Chen method, of Bollob\'{a}s' theorem concerning the distribution of the extreme degrees of a random graph. Our proof also provides a rate of convergence of the extreme degree to its asymptotic…
We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…
This work has been motivated by the challenge of the 2017 conference on Extreme-Value Analysis (EVA2017), with the goal of predicting daily precipitation quantiles at the $99.8\%$ level for each month at observed and unobserved locations.…
We study the probability densities of finite-time or \local Lyapunov exponents (LLEs) in low-dimensional chaotic systems. While the multifractal formalism describes how these densities behave in the asymptotic or long-time limit, there are…
Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…
Typical eigenstates of quantum systems, whose classical limit is chaotic, are well approximated as random states. Corresponding eigenvalue spectra is modeled through appropriate ensemble of random matrix theory. However, a small subset of…
We consider a class of non-homogeneous, continuous, centered Gaussian random fields $\{X_h(t), t \in {\cal M}_h;\,0 < h \le 1\}$ where ${\cal M}_h$ denotes a rescaled smooth manifold, i.e. ${\cal M}_h = \frac{1}{h} {\cal M},$ and study the…
The irregularities of a distribution of $N$ points in the unit interval are often measured with various notions of discrepancy. The discrepancy function can be defined with respect to intervals of the form $[0,t)\subset [0,1)$ or arbitrary…
In this study, we give an extension of Montanaro's arXiv/archive:1504.06987 quantum Monte Carlo method, tailored for computing expected values of random variables that exhibit infinite variance. This addresses a challenge in analyzing…
Convolutional layers within graph neural networks operate by aggregating information about local neighbourhood structures; one common way to encode such substructures is through random walks. The distribution of these random walks evolves…
Given an undirected graph $G$, the classical Cheeger constant, $h_G$, measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon the sizes of the parts. The well-known Cheeger's inequality…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
For random $d$-regular graphs on $N$ vertices with $1 \ll d \ll N^{2/3}$, we develop a $d^{-1/2}$ expansion of the local eigenvalue distribution about the Kesten-McKay law up to order $d^{-3}$. This result is valid up to the edge of the…
This paper deals with the problem of analytically computing the largest Lyapunov exponent for many degrees of freedom Hamiltonian systems. This aim is succesfully reached within a theoretical framework that makes use of a geometrization of…
In the context of the geometrical analysis of weakly non Gaussian CMB maps, the 2D differential extrema counts as functions of the excursion set threshold is derived from the full moments expansion of the joint probability distribution of…