The purpose of this paper is to present a newly discovered link between three seemingly unrelated subjects—quantum graphs, the theory of random matrix ensembles and combinatorics. We discuss the nature of this connection, and demonstrate it in a special case pertaining to simple graphs, and to the random ensemble of 2×2 unitary matrices. The corresponding combinatorial problem results in a few identities, which, to the best of our knowledge, were not proven previously. Mathematical Reviews Subject Numbers: 05C38, 90B10
In this thesis, we discover a new way to analyze quantum random walks over general graphs. We first ...
We present an exact analytical solution of the spectral problem of quasi-one-dimensional scaling qua...
Although used with increasing frequency in many branches of physics, random matrix ensembles are not...
We study the statistical properties of the scattering matrix associated with generic quantum graphs....
This book is designed as a concise introduction to the recent achievements on spectral analysis of g...
We analyze composed quantum systems consisting of k subsystems, each described by states in the n-di...
Quantum graphs provide a simple model of quantum mechanics in systems with complex geometry and can ...
Quantum graphs were first introduced as a simple model for studying quantum mechanics in geometrical...
For any graph consisting of k vertices and m edges we construct an ensemble of random pure quantum s...
In this thesis we investigate the intersection of the three fields of random matrix theory, quantum ...
While powers of the adjacency matrix of a finite graph reveal infor-mation about walks on the graph,...
Quantum graphs are ideally suited to studying the spectral statistics of chaotic systems. Depending ...
We review some recent developments in random matrix theory, and establish a moderate deviation resul...
We present a random matrix theory for systems invariant under the joint action of parity, P, and tim...
This chapter is devoted to various interactions between the graph theory and mathematical physics of...
In this thesis, we discover a new way to analyze quantum random walks over general graphs. We first ...
We present an exact analytical solution of the spectral problem of quasi-one-dimensional scaling qua...
Although used with increasing frequency in many branches of physics, random matrix ensembles are not...
We study the statistical properties of the scattering matrix associated with generic quantum graphs....
This book is designed as a concise introduction to the recent achievements on spectral analysis of g...
We analyze composed quantum systems consisting of k subsystems, each described by states in the n-di...
Quantum graphs provide a simple model of quantum mechanics in systems with complex geometry and can ...
Quantum graphs were first introduced as a simple model for studying quantum mechanics in geometrical...
For any graph consisting of k vertices and m edges we construct an ensemble of random pure quantum s...
In this thesis we investigate the intersection of the three fields of random matrix theory, quantum ...
While powers of the adjacency matrix of a finite graph reveal infor-mation about walks on the graph,...
Quantum graphs are ideally suited to studying the spectral statistics of chaotic systems. Depending ...
We review some recent developments in random matrix theory, and establish a moderate deviation resul...
We present a random matrix theory for systems invariant under the joint action of parity, P, and tim...
This chapter is devoted to various interactions between the graph theory and mathematical physics of...
In this thesis, we discover a new way to analyze quantum random walks over general graphs. We first ...
We present an exact analytical solution of the spectral problem of quasi-one-dimensional scaling qua...
Although used with increasing frequency in many branches of physics, random matrix ensembles are not...