Related papers: Spectral statistics for unitary transfer matrices …
Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…
The statistics of chiral matrix ensembles with uncorrelated but multivariate Gaussian distributed elements is intuitively expected to be driven by many parameters. Contrary to intuition, however, our theoretical analysis reveals the…
In this paper, we study dual quaternion and dual complex unit gain graphs and their spectral properties in a unified frame of dual unit gain graphs. Unit dual quaternions represent rigid movements in the 3D space, and have wide applications…
Construction of graphs with equal eigenvalues (co-spectral graphs) is an interesting problem in spectral graph theory. Seidel switching is a well-known method for generating co-spectral graphs. From a matrix theoretic point of view, Seidel…
Graph signal processing analyzes signals supported on the nodes of a graph by defining the shift operator in terms of a matrix, such as the graph adjacency matrix or Laplacian matrix, related to the structure of the graph. With respect to…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
We semiclassically derive the leading off-diagonal correction to the spectral form factor of quantum systems with a chaotic classical counterpart. To this end we present a phase space generalization of a recent approach for uniformly…
We numerically analyze the spectral statistics of the multiparametric Gaussian ensembles of complex matrices with zero mean and variances with different decay routes away from the diagonals. As the latter mimics different degree of…
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
It has been found that quantum corrections can substantially affect the classical results of tracking for trajectories close to the separatrix. Hence the development of a basic formalism for obtaining the quantum maps for any particle beam…
The spectral properties of interacting strongly chaotic systems are investigated for growing interaction strength. A very sensitive transition from Poisson statistics to that of random matrix theory is found. We introduce a new random…
The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on…
With the increasing sensitivity of gravitational-wave detectors, we expect to observe multiple binary neutron-star systems through gravitational waves in the near future. The combined analysis of these gravitational-wave signals offers the…
We address the problem of identifying families of discrete models naturally flowing in continuum limit to relativistic quantum field theories. We call them Dirac graphs. In this work, we require the graphs to obey spectrality property,…
This review article will present some recent results and methods in the study of 1-particle quantum or wave scattering systems, in the semiclassical/high frequency limit, in cases where the corresponding classical/ray dynamics is chaotic.…
The spectral statistics in the strongly chaotic cardioid billiard are studied. The analysis is based on the first 11000 quantal energy levels for odd and even symmetry respectively. It is found that the level-spacing distribution is in good…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
Topics concerning metric dimension related invariants in graphs are nowadays intensively studied. This compendium of combinatorial and computational results on this topic is an attempt of surveying those contributions that are of the…
We review recent research on the transport properties of classical waves through chaotic systems with special emphasis on microwaves and sound waves. Inasmuch as these experiments use antennas or transducers to couple waves into or out of…