Related papers: Quantum ergodicity on large graphs
We consider the bulk eigenvalue statistics of Laplacian matrices of large Erd\H{o}s-R\'enyi random graphs in the regime $p \geq N^{\delta}/N$ for any fixed $\delta >0$. We prove a local law down to the optimal scale $\eta \gtrsim N^{-1}$…
We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…
In this series, we investigate quantum ergodicity at small scales for linear hyperbolic maps of the torus ("cat maps'"). In Part II of the series, we construct quasimodes that are quantum ergodic but are not equidistributed at the…
We prove quantum ergodicity and quantum mixing for sequences of finite Schreier graphs converging to an infinite Cayley graph whose adjacency operator has absolutely continuous spectrum. Under Benjamini-Schramm convergence (or strong…
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may arise…
A numerical study of Anderson transition on random regular graphs (RRG) with diagonal disorder is performed. The problem can be described as a tight-binding model on a lattice with N sites that is locally a tree with constant connectivity.…
The generic behavior of quantum systems has long been of theoretical and practical interest. Any quantum process is represented by a sequence of quantum channels. We consider general ergodic sequences of stochastic channels with arbitrary…
We discuss Shnirelman's Quantum Ergodicity Theorem, giving an outline of a proof and an overview of some of the recent developments in mathematical Quantum Chaos.
We consider random $d$-regular graphs on $N$ vertices, with degree $d$ at least $(\log N)^4$. We prove that the Green's function of the adjacency matrix and the Stieltjes transform of its empirical spectral measure are well approximated by…
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…
We use the mathematical framework of loop quantum gravity (LQG) to study the quantization of three dimensional (Riemannian) gravity with positive cosmological constant (Lambda>0). We show that the usual regularization techniques (successful…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
Statistical analysis of the eigenfunctions of the Anderson tight-binding model with on-site disorder on regular random graphs strongly suggests that the extended states are multifractal at any finite disorder. The spectrum of fractal…
Since the seminal work of Anderson, localisation has been recognised as a standard mechanism allowing quantum many-body systems to escape ergodicity. This idea acquired even more prominence in the last decade as it has been argued that…
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…
In this work we propose Lasagne, a methodology to learn locality and structure aware graph node embeddings in an unsupervised way. In particular, we show that the performance of existing random-walk based approaches depends strongly on the…
We prove that every metric graph which is a tree has an orthonormal sequence of Laplace-eigenfunctions of full support. This implies that the number of nodal domains $\nu_n$ of the $n$-th eigenfunction of the Laplacian with standard…
Consider $M$, a bounded domain in ${\mathbb R}^d$, which is a Riemanian manifold with piecewise smooth boundary and suppose that the billiard associated to the geodesic flow reflecting on the boundary acording to the laws of geometric…
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…
In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…