Related papers: Entropy of eigenfunctions on quantum graphs
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…
This article discusses a method to compute the induced action on the fundamental group of a real rational surface and provides the induced actions for basic quadratic real automorphisms. Using an invariant set in the fundamental group, we…
We prove improved bounds on how localized an eigenvector of a high girth regular graph can be, and present examples showing that these bounds are close to sharp. This study was initiated by Brooks and Lindenstrauss (2009) who relied on the…
The maximum entropy principle from statistical mechanics states that a closed system attains an equilibrium distribution that maximizes its entropy. We first show that for graphs with fixed number of edges one can define a stochastic edge…
Let $(n^+, n^0, n^-)$ denote the inertia of a graph $G$ with $n$ vertices. Nordhaus-Gaddum bounds are known for inertia, except for an upper bound for $n^-$. We conjecture that for any graph \[ n^-(G) + n^-(\bar{G}) \le 1.5(n - 1), \] and…
In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally they show that there cannot be too many eigenvalues near the…
We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…
McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…
We explore the limiting empirical eigenvalue distributions arising from matrices of the form \[A_{n+1} = \begin{bmatrix} A_n & I\\ I & A_n \end{bmatrix} , \]where $A_0$ is the adjacency matrix of a $k$-regular graph. We find that for…
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…
Estimation of quantum relative entropy and its R\'{e}nyi generalizations is a fundamental statistical task in quantum information theory, physics, and beyond. While several estimators of these divergences have been proposed in the…
We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete…
For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…
Let $\mathcal{H}$ be a hypergraph with $n$ vertices. Suppose that $d_1,d_2,\ldots,d_n$ are degrees of the vertices of $\mathcal{H}$. The $t$-th graph entropy based on degrees of $\mathcal{H}$ is defined as $$ I_d^t(\mathcal{H})…
We compute the value distributions of the eigenfunctions and spectral determinant of the Schrodinger operator on families of star graphs. The values of the spectral determinant are shown to have a Cauchy distribution with respect both to…
This manuscript introduces a computationally efficient method to calculate the nonlinearity of a quantum feature map, as well as a method for determining whether a quantum feature map will have a high concentration of quantum states. The…
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…