Related papers: Quantum ergodicity for quantum graphs without back…
We prove that a random $d$-regular graph, with high probability, is a cut sparsifier of the clique with approximation error at most $\left(2\sqrt{\frac 2 \pi} + o_{n,d}(1)\right)/\sqrt d$, where $2\sqrt{\frac 2 \pi} = 1.595\ldots$ and…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
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…
Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is…
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…
Connectivity is a fundamental property of quantum graphs, previously studied in the operator system model for matrix quantum graphs and via graph homomorphisms in the quantum adjacency matrix model. In this paper, we develop an algebraic…
Kahale proved that linear sized sets in $d$-regular Ramanujan graphs have vertex expansion $\sim\frac{d}{2}$ and complemented this with construction of near-Ramanujan graphs with vertex expansion no better than $\frac{d}{2}$. However, the…
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…
This paper is a direct continuation of an earlier work, where we studied Erd\"os-R\'enyi random graphs perturbed by an interaction Hamiltonian favouring the formation of short cycles. Here, we generalize these results. We keep the same…
Graph states are fundamental objects in the theory of quantum information due to their simple classical description and rich entanglement structure. They are also intimately related to IQP circuits, which have applications in quantum…
Benjamini and Schramm introduced the notion of distributional limit of a sequence of graphs with uniformly bounded valence and studied such limits in the case that the involved graphs are planar. We investigate distributional limits of…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…
We extend the use of random evolving sets to time-varying conductance models and utilize it to provide tight heat kernel upper bounds. It yields the transience of any uniformly lazy random walk, on Z^d, d>=3, equipped with uniformly bounded…
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…
We explore the use of machine-learning techniques to detect quantum speedup in random walks on graphs. Specifically, we investigate the performance of three different neural-network architectures (variations on fully connected and…
A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…
A randomly walking quantum particle evolving by Schr\"odinger's equation searches on $d$-dimensional cubic lattices in $O(\sqrt{N})$ time when $d \ge 5$, and with progressively slower runtime as $d$ decreases. This suggests that graph…
Let $\Gamma$ be an arbitrary $\mathbb{Z}^n$-periodic metric graph, which does not coincide with a line. We consider the Hamiltonian $\mathcal{H}_\varepsilon$ on $\Gamma$ with the action $-\varepsilon^{-1}{\mathrm{d}^2/\mathrm{d} x^2}$ on…
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…