Related papers: Quantum Graphs and Random-Matrix Theory

For every fixed graph $H$ and every fixed $0 < \alpha < 1$, we show that if a graph $G$ has the property that all subsets of size $\alpha n$ contain the ``correct'' number of copies of $H$ one would expect to find in the random graph…

One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…

The high complexity of many-body quantum dynamics means that essentially all approaches either exploit special structure or are approximate in nature. One such approach--the memory function formalism--involves a carefully chosen split into…

We extend the polynomial method of Chen--Garza-Vargas--Tropp--van Handel and Magee--Puder--van Handel for operator-norm bounds in random permutation models to the setting where torsion is present. The main new feature is that asymptotic…

We study the critical behavior of the q-state Potts model with random ferromagnetic couplings. Working with the cluster representation the partition sum of the model in the large-q limit is dominated by a single graph, the fractal…

The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…

Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…

Using diagrammatic techniques, we provide explicit functional relations between the cumulant generating functions for the biunitarily invariant ensembles in the limit of large size of matrices. The formalism allows to map two distinct areas…

Quantum fluctuations of some systems vanish not only in the limit $\hbar\to 0$, but also as some other parameters (such as $1\over N$, the inverse of the number of `colors' of a Yang-Mills theory) vanish. These lead to new classical limits…

In this work we prove general bounds for the diameter of random graphs generated by a preferential attachment model whose parameter is a function $f:\mathbb{N}\to[0,1]$ that drives the asymptotic proportion between the numbers of vertices…

We consider the infinite family of Feynman graphs known as the "banana graphs" and compute explicitly the classes of the corresponding graph hypersurfaces in the Grothendieck ring of varieties as well as their Chern-Schwartz-MacPherson…

We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…

We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…

The quantum mechanics is proved to admit no hidden-variable in 1960s, which means the quantum systems are contextual. Revealing the mathematical structure of quantum mechanics is a significant task. We develop the approach of partial…

We provide a mechanism by which, from a background independent model with no quantum mechanics, quantum theory arises in the same limit in which spatial properties appear. Starting with an arbitrary abstract graph as the microscopic model…

We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…

We prove a neat factorization property of Feynman graphs in covariant perturbation theory. The contribution of the graph to the effective action is written as a product of a massless scalar momentum integral that only depends on the basic…

We show that a quantum spin system has an exact description by non-interacting fermions if its frustration graph is claw-free and contains a simplicial clique. The frustration graph of a spin model captures the pairwise anticommutation…

Here we review the many aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. This approach is…

The correlations in the spectra of quantum systems are intimately related to correlations which are of genuine classical origin, and which appear in the spectra of actions of the classical periodic orbits of the corresponding classical…