Related papers: Quantum ergodicity for graphs related to interval …
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
We rigorously examine the ergodic properties of quantum lattice models with short range interactions, in the C* algebra formulation of statistical mechanics. Ergodicity results, in the context of group actions on C* algebras, assume that…
We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments edges of the graph appear or disappear with a given probability. We focus on the case when the time interval between subsequent…
The Erd\H{o}s-Simonovits stability theorem states that for all \epsilon >0 there exists \alpha >0 such that if G is a K_{r+1}-free graph on n vertices with e(G) > ex(n,K_{r+1}) - \alpha n^2, then one can remove \epsilon n^2 edges from G to…
Correlations between the parts of a many-body system, and its time dynamics, lie at the heart of sciences, and they can be classical as well as quantum. Quantum correlations are traditionally viewed as constituted out of classical…
Based on the main result presented in a recent paper, we derive Ambarzumian-type theorems for Schr\"odinger operators defined on quantum graphs. We recover existing results such as the classical theorem by Ambarzumian and establish some…
Transformers are increasingly employed for graph data, demonstrating competitive performance in diverse tasks. To incorporate graph information into these models, it is essential to enhance node and edge features with positional encodings.…
Graph Isomorphism is one of the classical problems of graph theory for which no deterministic polynomial-time algorithm is currently known, but has been neither proven to be NP-complete. Several heuristic algorithms have been proposed to…
We consider the large-$D$ limit of Einstein gravity. It is observed that a consistent leading large-$D$ graph limit exists, and that it is built up by a subclass of planar diagrams. The graphs in the effective field theory extension of…
We investigate which finite Cayley graphs admit a quantum ergodic eigenbasis, proving that this holds for any Cayley graph on a group of size $n$ for which the sum of the dimensions of its irreducible representations is $o(n)$, yet there…
We prove several rigidity properties for random quotients of mapping class groups of surfaces, namely whose kernel is normally generated by the n-th steps of finitely many independent random walks. Firstly, we generalise a celebrated…
In this paper, we study the ergodicity of invariant sublinear expectation of sublinear Markovian semigroup. For this, we first develop an ergodic theory of an expectation-preserving map on a sublinear expectation space. Ergodicity is…
Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erd\H{o}s-R\'enyi graphs, are usually derived with very specific choices for defining parameters. The question arises to which…
We pick up a solvable ${\cal PT}-$symmetric quantum square well on an interval of $x \in := (-L,L)\mathbb{G}^{(2)}$ (with an $\alpha-$dependent non-Hermiticity given by Robin boundary conditions) and generalize it. In essence, we just…
We examine the fundamental question whether a random discrete structure with the minimal number of restrictions can converge to continuous metric space. We study the geometrical properties such as the dimensionality and the curvature…
We study a class of quantum Markov processes that, on the one hand, is inspired by the micromaser experiment in quantum optics and, on the other hand, by classical birth and death processes. We prove some general geometric properties and…
In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…
Staggered quantum walks on graphs are based on the concept of graph tessellation and generalize some well-known discrete-time quantum walk models. In this work, we address the class of 2-tessellable quantum walks with the goal of obtaining…
We present experimental and numerical results for the long-range fluctuation properties in the spectra of quantum graphs with chaotic classical dynamics and preserved time-reversal invariance. Such systems are generally believed to provide…
We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in…