Related papers: On Agmon metrics and exponential localization for …
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq 3$, and denote the eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We prove that the…
We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of…
We estimate linear functionals in the classical deconvolution problem by kernel estimators. We obtain a uniform central limit theorem with $\sqrt{n}$-rate on the assumption that the smoothness of the functionals is larger than the…
We undertake a systematic investigation of the maxima and minima of the eigenfunctions associated with the first nontrivial eigenvalue of the Laplacian on a metric graph equipped with standard (continuity--Kirchhoff) vertex conditions. This…
We study equilibration of an isolated quantum system by mapping it onto a network of classical oscillators in Hilbert space. By choosing a suitable basis for this mapping, the degree of locality of the quantum system reflects in the…
We show how graph theory concepts can provide an insight into the origin of slow dynamics in systems with kinetic constraints. In particular, we observe that slow dynamics is related to the presence of strong hierarchies between nodes on…
The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph $G$, is denoted by $q(G)$. Using other parameters related to $G$, bounds for $q(G)$ are proven and then applied to deduce…
The local tree-width of a graph G=(V,E) is the function ltw^G: N -> N that associates with every natural number r the maximal tree-width of an r-neighborhood in G. Our main graph theoretic result is a decomposition theorem for graphs with…
This paper is devoted to the statistics of the quantum eigenfunctions in an ensemble of finite disordered systems (metallic grains). We focus on moments of inverse participation ratio. In the universal random matrix limit that corresponds…
We develop an approach for understanding the dynamics of open quantum systems by analyzing individual quantum trajectories in the eigenbasis of the Liouvillian superoperator. From trajectory-eigenstate overlaps, we construct a…
What limits how fast a Lyapunov function can decay under input bounds? We address this question by showing how the shape of Lyapunov comparison functions governs guaranteed decay for control affine systems. Using a windowed nominal…
We prove lower bounds for the entropy of limit measures associated to non-degenerate sequences of eigenfunctions on locally symmetric spaces of non-positive curvature. In the case of certain compact quotients of the space of positive…
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…
The main result of this paper is a quantified version of Ingham's Tauberian theorem for bounded vector-valued sequences rather than functions. It gives an estimate on the rate of decay of such a sequence in terms of the behaviour of a…
We study the free Schr\"odinger equation on finite metric graphs with infinite ends. We give sufficient conditions to obtain the $L^1$ to $L^\infty$ time decay rate at least $t^{-1/2}$. These conditions allow certain metric graphs with…
In this paper, we study the higher Steklov eigenvalues of graphs on surfaces. We obtain the upper bound of higher Steklov eigenvalues of a finite graph $G$ with boundary $B$ and genus $g$ by using metrical deformation via probability flows.…
Liouville quantum gravity (LQG) and the Brownian map (TBM) are two distinct models of measure-endowed random surfaces. LQG is defined in terms of a real parameter $\gamma$, and it has long been believed that when $\gamma = \sqrt{8/3}$, the…
The exponential speed-up of quantum walks on certain graphs, relative to classical particles diffusing on the same graph, is a striking observation. It has suggested the possibility of new fast quantum algorithms. We point out here that…
We study many-body properties of quantum harmonic oscillator lattices with disorder. A sufficient condition for dynamical localization, expressed as a zero-velocity Lieb-Robinson bound, is formulated in terms of the decay of the…
We study eigenvalue distribution of the adjacency matrix $A^{(N,p,q)}$ of weighted random uniform $q$-hypergraphs $\Gamma= \Gamma_{N,p,q}$. We assume that the graphs have $N$ vertices and the average number of hyperedges attached to one…