Related papers: Quantum ergodicity on large regular graphs
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…
This Master's thesis examines the properties of large degree vertices in random recursive directed acyclic graphs (RRDAGs), a generalization of the well-studied random recursive tree (RRT) model. Using a novel adaptation of Kingman's…
We prove quantum ergodicity for the eigenfunctions of the pseudo-Laplacian on Riemannian surfaces with finitely many hyperbolic cusps and ergodic geodesic flow.
In this paper, we prove the equidistribution property of high-frequency eigensections of a certain series of unitary flat bundles, using the mixture of semiclassical and geometric quantizations.
Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving…
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
We propose an extension of ergodic theory which focuses on the identification of ergodicity in terms of the uniqueness of the invariant measure. We first explain the concept for the doubling maps, which can be analyzed using Fourier…
Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a framework that refines such problems by assigning extremal…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
We consider the quantum cat map - a toy model of a quantized chaotic system. We show that its eigenstates are fully delocalized on $\mathbb{T}^2$ in the semiclassical limit (or equivalently that each semiclassical measure is fully supported…
We establish several properties of the integrated density of states for random quantum graphs: Under appropriate ergodicity and amenability assumptions, the integrated density of states can be defined using an exhaustion procedure by…
This paper focuses on extensions of the classic Erd\H{o}s-Gallai Theorem for the set of weighted function of each edge in a graph. The weighted function of an edge $e$ of an $n$-vertex uniform hypergraph $\mathcal{H}$ is defined to a…
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 review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
Let $x \in S^{n-1}$ be a unit eigenvector of an $n \times n$ random matrix. This vector is delocalized if it is distributed roughly uniformly over the real or complex sphere. This intuitive notion can be quantified in various ways. In these…
We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these subcomplexes capture many important structural properties of…
Through detailed analysis of scores of publicly available data sets corresponding to a wide range of large-scale networks, from communication and road networks to various forms of social networks, we explore a little-studied geometric…
We investigate the "stratified Ehrhart ring theory" for periodic graphs, which gives an algorithm for determining the growth sequences of periodic graphs. The growth sequence $(s_{\Gamma, x_0, i})_{i \ge 0}$ is defined for a graph $\Gamma$…
We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate…
The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular…