相关论文: Spectral statistics for scaling quantum graphs

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,…

In any given experimental scenario, the rules of quantum theory provide statistical distributions that the observed outcomes are expected to follow. The set formed by all these distributions contains the imprint of quantum theory, capturing…

The spectral curve is the key ingredient in the modern theory of classical integrable systems. We develop a construction of the ``quantum spectral curve'' and argue that it takes the analogous structural and unifying role on the quantum…

A new method for solving inverse spectral problems on quantum star graphs is proposed. The method is based on Neumann series of Bessel functions representations for solutions of Sturm-Liouville equations. The representations admit estimates…

The so-called spectral dimension is a scale-dependent number associated with both geometries and field theories that has recently attracted much attention, driven largely though not exclusively by investigations of causal dynamical…

In this paper we study variants of the widely used spectral clustering that partitions a graph into k clusters by (1) embedding the vertices of a graph into a low-dimensional space using the bottom eigenvectors of the Laplacian matrix, and…

A numerical solution to the problem of wave scattering by many small particles is studied under the assumption k<<1, d>>a, where a is the size of the particles and d is the distance between the neighboring particles. Impedance boundary…

The empirical spectral distribution of Hermitian $K \times K$-block random matrices converges to a deterministic density on the real line with a potential atom at the origin as the dimension of the blocks tends to infinity. In this model…

Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…

The problem of electron scattering on the one-dimensional complexes is considered. We propose a novel theoretical approach to solution of the transport problem for a quantum graph. In the frame of the developed approach the solution of the…

We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are…

Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted clique expansion. In this paper, we consider this…

We generalize the conjectured connection between quantum spectral problems and topological strings to many local almost del Pezzo surfaces with arbitrary mass parameters. The conjecture uses perturbative information of the topological…

In a series of two papers we investigate the universal spectral statistics of chaotic quantum systems in the ten known symmetry classes of quantum mechanics. In this first paper we focus on the construction of appropriate ensembles of star…

This paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest…

It is well established numerically that spectral statistics of pseudo-integrable models differs considerably from the reference statistics of integrable and chaotic systems. In [PRL,93 (2004) 254102] statistical properties of a certain…

We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…

We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint $t$-cliques. The extremal graphs…

We introduce spectral quantum tomography, a simple method to extract the eigenvalues of a noisy few-qubit gate, represented by a trace-preserving superoperator, in a SPAM-resistant fashion, using low resources in terms of gate sequence…

Quantum-mechanical WKB-method is elaborated for the known quantum oscillator problem in curved 3-spaces models Euclid, Riemann, and Lobachevsky E_{3}, H_{3}, S_{3} in the framework of the complex variable function theory. Generalized…