Related papers: Entropy of eigenfunctions on quantum graphs
In this paper, a new measurement to compare two large-scale graphs based on the theory of quantum probability is proposed. An explicit form for the spectral distribution of the corresponding adjacency matrix of a graph is established. Our…
A new conceptual foundation for the notion of "information" is proposed, based on the concept of a "distinction graph": a graph in which two nodes are connected iff they cannot be distinguished by a particular observer. The "graphtropy" of…
For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information above which a given compact subset of the state space can be…
We define the Wiener-entropy, which is together with the eccentricity-entropy one of the most natural distance-based graph entropies. By deriving the (asymptotic) extremal behaviour, we conclude that the Wiener-entropy of graphs of a given…
We develop a rigorous framework for quantifying quantum coherence in finite-dimensional systems by applying the Schur-Horn majorization theorem to relate eigenvalue distributions and diagonal entries of density matrices. Building on this…
We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence number of the Erd\H{o}s-R\'{e}nyi graphs. We investigate…
Volume entropy is an important invariant of metric graphs as well as Riemannian manifolds. In this note, we calculate the change of volume entropy when an edge is added to a metric graph. Using the first result, we investigate the change of…
We prove that the eigenfunctions of quantum star graphs exhibit multifractal self-similar structure in certain specified circumstances. In the semiclassical regime, when the spectral parameter and the number of vertices tend to infinity, we…
We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…
In this work, we generalize the graph-theoretic techniques used for the holographic entropy cone to study hypergraphs and their analogously-defined entropy cone. This allows us to develop a framework to efficiently compute entropies and…
We present a Fermi golden rule giving rates of decay of states obtained by perturbing embedded eigenvalues of a quantum graph. To illustrate the procedure in a notationally simpler setting we also present a Fermi Golden Rule for boundary…
We derive a counting formula for the eigenvalues of Schr\"odinger operators with self-adjoint boundary conditions on quantum star graphs. More specifically, we develop techniques using Evans functions to reduce full quantum graph eigenvalue…
A discrete analog of quantum unique ergodicity was proved for Cayley graphs of quasirandom groups by Magee, Thomas and Zhao. They show that for large graphs there exist real orthonormal basis of eigenfunctions of the adjacency matrix such…
Optical entropy bounds for metal nanoparticles immersed in nonlinear optical media and for nonlinear dielectric microdroplets on metal surfaces are calculated near the frequency of the surface plasmon resonance. Similar to the…
We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We firstly define a purely structural…
Every graphon defines a random graph on any given number $n$ of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadratic. We prove that for random-free graphons, this entropy can…
We compute the entropy of a closed bounded region of space for pure 3d Riemannian gravity formulated as a topological BF theory for the gauge group SU(2) and show its holographic behavior. More precisely, we consider a fixed graph embedded…
In his survey "Beyond graph energy: Norms of graphs and matrices" (2016), Nikiforov proposed two problems concerning characterizing the graphs that attain equality in a lower bound and in a upper bound for the energy of a graph,…
Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…
We derive an upper bound on the maximum balanced bipartite entanglement entropy of ground states of many-body Hamiltonians defined on a graph, agnostic to any particular model, that possesses a nontrivial automorphism group. We show that…