Related papers: Universal Quantum Graphs
Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.
We prove a substantial extension of an inverse spectral theorem of Ambarzumyan, and show that it can be applied to arbitrary compact Riemannian manifolds, compact quantum graphs and finite combinatorial graphs, subject to the imposition of…
Introducing and studying the pattern frequency algebra, we prove the analogue of L\"uck's approximation theorems on $L^2$-spectral invariants in the case of aperiodic order. These results imply a uniform convergence theorem for the…
We develop an index theory for variational problems on noncompact quantum graphs. The main results are a spectral flow formula, relating the net change of eigenvalues to the Maslov index of boundary data, and a Morse index theorem, equating…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
We provide a versatile plateform to investigate wave-particle duality. This photonic waveguide network implements quantum (wave) graphs as proposed in the seminal paper by Kottos \& Smilansky [PRL \textbf{85} 968 (2000)]. We experimentally…
We develop a clear connection between deFinetti's theorem for exchangeable arrays (work of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and many coauthors). Along the way, we translate the graph theory…
Let $G$ be a finite abelian group, let $E$ be a subset of $G$, and form the Cayley (directed) graph of $G$ with connecting set $E$. We explain how, for various matrices associated to this graph, the spectrum can be used to give information…
We prove various notions of uniform continuity for compact-quantum-group representations on Hilbert or Banach spaces equivalent to having finite spectrum, i.e. finitely many isotypic components. This generalizes the classical analogue for…
Quantum graphs have recently been introduced as model systems to study the spectral statistics of linear wave problems with chaotic classical limits. It is proposed here to generalise this approach by considering arbitrary, directed graphs…
A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…
We define $G$-cospectrality of two $G$-gain graphs $(\Gamma,\psi)$ and $(\Gamma',\psi')$, proving that it is a switching isomorphism invariant. When $G$ is a finite group, we prove that $G$-cospectrality is equivalent to cospectrality with…
We establish effective versions of Oppenheim's conjecture for generic inhomogeneous quadratic forms. We prove such results for fixed quadratic forms and generic shifts. Our results complement our companion paper where we considered generic…
Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties correspond to different norms to measure this distance. For dense…
We prove an analog of Aldous' spectral gap conjecture in the generalized symmetric groups $G\wr S_n$ where $G$ is an arbitrary finite group. Moreover, we show that Caputo's extension of the conjecture to hypergraphs transfers to these…
We develop the theory of quantum (a.k.a. noncommutative) relations and quantum (a.k.a. noncommutative) graphs in the finite-dimensional covariant setting, where all systems (finite-dimensional $C^*$-algebras) carry an action of a compact…
We develop two approaches to Quantum (or Non-commutative) Graphs based on arbitrary von Neumann algebras $M\subseteq\mathcal B(H)$: one looking at operator bimodules of Hilbert--Schmidt (instead of bounded) operators, and the second looking…
Representations of measures of concordance in terms of Pearson' s correlation coefficient are studied. All transforms of random variables are characterized such that the correlation coefficient of the transformed random variables is a…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…