Related papers: Eigenstates and spectral projection for quantized …

In this paper we find spectral properties in the large $N$ limit of Dirac operators that come from random finite noncommutative geometries. In particular for a Gaussian potential the limiting eigenvalue spectrum is shown to be universal…

The quantum baker's map is the quantization of a simple classically chaotic system, and has many generic features that have been studied over the last few years. While there exists a semiclassical theory of this map, a more rigorous study…

We study an apparently new question about the behaviour of Weyl sums on a subset $\mathcal{X}\subseteq [0,1)^d$ with a natural measure $\mu$ on $\mathcal{X}$. For certain measure spaces $(\mathcal{X}, \mu)$ we obtain non-trivial bounds for…

In the recent literature, various authors have studied spectral comparison results for Schr\"odinger operators with discrete spectrum in different settings including Euclidean domains and quantum graphs. In this note we derive such spectral…

For two-dimensional quantum billiards we derive the partial Weyl law, i.e. the average density of states, for a subset of eigenstates concentrating on an invariant region $\Gamma$ of phase space. The leading term is proportional to the area…

Let p(k) denote the partition function of k. For each k >= 2, we describe a list of p(k)-1 quasirandom properties that a k-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness of…

For almost all Riemannian metrics (in the $C^\infty$ Baire sense) on a closed manifold $M^{n+1}$, $3\leq (n+1)\leq 7$, we prove that there is a sequence of closed, smooth, embedded, connected minimal hypersurfaces that is equidistributed in…

We first establish new local limit estimates for the probability that a nondecreasing integer-valued random walk lies at time $n$ at an arbitrary value, encompassing in particular large deviation regimes. This enables us to derive scaling…

We implement the so-called Weyl-Heisenberg covariant integral quantization in the case of a classical system constrained by a bounded or semi-bounded geometry. The procedure, which is free of the ordering problem of operators, is…

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…

We study the limiting spectral distribution of quantum channels whose Kraus operators are sampled as $n\times n$ random Hermitian matrices satisfying certain assumptions. We show that when the Kraus rank goes to infinity with n, the…

We study the nodal length of random toral Laplace eigenfunctions ("arithmetic random waves") restricted to decreasing domains ("shrinking balls"), all the way down to Planck scale. We find that, up to a natural scaling, for "generic"…

Let $(X,g)$ be a closed, connected surface, with variable negative curvature. We consider the distribution of eigenvalues of the Laplacian on random covers $X_n\to X$ of degree $n$. We focus on the ensemble variance of the smoothed number…

We consider Erd\H{o}s-R\'enyi-type random hypergraphs that are non-uniform, in the sense that hyperedges of different sizes may coexist, and inhomogeneous, in that connection probabilities may depend on the hyperedge size. All parameters…

The spectral graph theory provides an algebraical approach to investigate the characteristics of weighted networks using the eigenvalues and eigenvectors of a matrix (e.g., normalized Laplacian matrix) that represents the structure of the…

The transmission problem is a system of two second-order elliptic equations of two unknowns equipped with the Cauchy data on the boundary. After four decades of research motivated by scattering theory, the spectral properties of this…

Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…

We propose a version of the Quantum Ergodicity theorem on large regular graphs of fixed valency. This is a property of delocalization of "most" eigenfunctions. We consider expander graphs with few short cycles (for instance random large…

We present here a canonical quantization for the baker's map. The method we use is quite different from that used in Balazs and Voros (ref. \QCITE{cite}{}{BV}) and Saraceno (ref. \QCITE{cite}{}{S}). We first construct a natural ``baker…