Related papers: Local Extrema in Quantum Chaos
There is a wide range of applications where the local extrema of a function are the key quantity of interest. However, there is surprisingly little work on methods to infer local extrema with uncertainty quantification in the presence of…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…
We introduce a notion of local level spacings and study their statistics within a random-matrix-theory approach. In the limit of infinite-dimensional random matrices, we determine universal sequences of mean local spacings and of their…
A method is described for predicting extremes values beyond the span of historical data. The method - based on extending a curve fitted to a location- and scale-invariant variation of the double-logarithmic QQ-plot - is simple and…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
We prove that both multiple Rademacher system and Rademacher chaos possess the property of random unconditional convergence in the space $L_\infty$. This fact combined with some intimate connections between $L_\infty$-norms of linear…
An exact analytical description of extreme intensity statistics in complex random states is derived. These states have the statistical properties of the Gaussian and Circular Unitary Ensemble eigenstates of random matrix theory. Although…
We analytically establish the role of a spectrum of Lyapunov exponents in the evolution of phase-space distributions $\rho(p,q)$. Of particular interest is $\lambda_2$, an exponent which quantifies the rate at which chaotically evolving…
It has been suggested that the distribution of the suitably normalized number of zeros of Laplacian eigenfunctions contains information about the geometry of the underlying domain. We study this distribution (more precisely, the…
We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…
We introduce and investigate the stochastic dynamics of the density of local extrema (minima and maxima) of non-equilibrium surface fluctuations. We give a number of exact, analytic results for interface fluctuations described by linear…
We study the local geometry of the space of horizontal curves with endpoints freely varying in two given submanifolds $\mathcal P$ and $\mathcal Q$ of a manifold $\mathcal M$ endowed with a distribution $\mathcal D\subset T\M$. We give a…
We prove a generalized version of the Quantum Ergodicity Theorem on smooth compact Riemannian manifolds without boundary. We apply it to prove some asymptotic properties on the distribution of typical eigenfunctions of the Laplacian in…
Adapting a method developed for the study of quantum chaos on {\it quantum (metric)} graphs \cite {KS}, spectral $\zeta$ functions and trace formulae for {\it discrete} Laplacians on graphs are derived. This is achieved by expressing the…
We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…
Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…
In this paper, we study random features manifested in components of energy eigenfunctions of quantum chaotic systems, given in the basis of unperturbed, integrable systems. Based on semiclassical analysis, particularly on Berry's…
We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…
This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…