Related papers: Non-Hermitian expander obtained with Haar distribu…

In this brief paper we present some results on creating and manipulating spectral gaps for a (regular) quantum graph by inserting appropriate internal structures into its vertices. Complete proofs and extensions of the results are planned…

As random operations for quantum systems are intensively used in various quantum information tasks, a trustworthy measure of the randomness in quantum operations is highly demanded. The Haar measure of randomness is a useful tool with wide…

We analyze Schr\"odinger operators whose potential is given by a singular interaction supported on a sub-manifold of the ambient space. Under the assumption that the operator has at least two eigenvalues below its essential spectrum we…

As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we investigate this parameter for $q$-ary Hamming graphs and a…

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 find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…

Let $A$ and $B$ be two $N$ by $N$ deterministic Hermitian matrices and let $U$ be an $N$ by $N$ Haar distributed unitary matrix. It is well known that the spectral distribution of the sum $H=A+UBU^*$ converges weakly to the free additive…

Here we introduce the non-Hermitian diluted banded random matrix (nHdBRM) ensemble as the set of $N\times N$ real non-symmetric matrices whose entries are independent Gaussian random variables with zero mean and variance one if $|i-j|<b$…

For non-Hermitian equilateral q-pointed star-shaped quantum graphs of paper I [Can. J. Phys. 90, 1287 (2012), arXiv 1205.5211] we show that due to certain dynamical aspects of the model as controlled by the external, rotation-symmetric…

We study the asymptotic distribution of the eigenvalues of random Hermitian periodic band matrices, focusing on the spectral edges. The eigenvalues close to the edges converge in distribution to the Airy point process if (and only if) the…

A numerical algorithm to solve the spectral problem for arbitrary self-adjoint extensions of 1D regular Schroedinger operators is presented. It is shown that the set of all self-adjoint extensions of 1D regular Schroedinger operators is in…

Manifestly non-Hermitian quantum graphs with real spectra are introduced and shown tractable as a new class of phenomenological models with several appealing descriptive properties. For illustrative purposes, just equilateral star-graphs…

Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We study how eigenvectors of random regular graphs behave when projected onto fixed directions. For a random $d$-regular graph with $N$ vertices, where the degree $d$ grows slowly with $N$, we prove that these projections follow…

We consider one-dimensional chains and multi-dimensional networks of harmonic oscillators coupled to two Langevin heat reservoirs at different temperatures. Each particle interacts with its nearest neighbors by harmonic potentials and all…

Families of expander graphs were first constructed by Margulis from discrete groups with property (T). Within the framework of quantum information theory, several authors have generalised the notion of an expander graph to the setting of…

A random $n$-lift of a base graph $G$ is its cover graph $H$ on the vertices $[n]\times V(G)$, where for each edge $u v$ in $G$ there is an independent uniform bijection $\pi$, and $H$ has all edges of the form $(i,u),(\pi(i),v)$. A main…

Let $K_{s,t}^{(r)}$ denote the $r$-uniform hypergraph obtained from the graph $K_{s,t}$ by inserting $r-2$ new vertices inside each edge of $K_{s,t}$. We prove essentially tight bounds on the size of a largest $K_{s,t}^{(r)}$-subgraph of…

Given an unbalanced open quantum graph, we derive a formula relating sums over its scattering resonances with integrals outside a strip. We deduce lower bounds on the number of resonances (in bounded regions of the complex plane),that are…