Related papers: The Graph Laplacian and Morse Inequalities
Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a…
We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. In this paper, we study the embedded homology as well as the homology of the (lower-)associated simplicial complexes for hypergraphs. We…
In the present article magnetic Laplacians on a graph are analyzed. We provide a complete description of the set of all operators which can be obtained from a given self-adjoint Laplacian by perturbing it by magnetic fields. In particular,…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
We introduce Morse-type inequalities for a holomorphic circle action on a holomorphic vector bundle over a compact Kaehler manifold. Our inequalities produce bounds on the multiplicities of weights occurring in the twisted Dolbeault…
Gauge theory underpins the quantum field theories of the standard model, and in a previous paper was shown via a geometric approach to describe classical electromagnetism in a form which approximates QED. Here we formalize and generalize…
In this paper we will attempt to show that the Dirac theory lends itself to an interpretation in terms of a unified sub-quantum mechanical field theory where, the fundamental force fields are weak electric and weak magnetic fields. We…
In this work, we define the Laplacian and Normalized Laplacian energies of vertices in a graph, we derive some of its properties and relate them to combinatorial, spectral and geometric quantities of the graph.
We present a discrete model theory similar in structure to ordinary quantum mechanics, but based on a finite field instead of complex amplitudes. The interpretation of this theory involves only the "modal" concepts of possibility and…
The homology of Kontsevich's commutative graph complex parameterizes finite type invariants of odd dimensional manifolds. This {\it graph homology} is also the twisted homology of Outer Space modulo its boundary, so gives a nice point of…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by Grone, and Grone and…
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…
Let $G$ be a simple graph of order $n$ with degree sequence $(d)=(d_1,d_2,\ldots,d_n)$ and conjugate degree sequence $(d^*)=(d_1^*,d_2^*,\ldots,d_n^*)$. In \cite{AkbariGhorbaniKoolenObudi2010,DasMojallalGutman2017} it was proven that…
We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
We discuss Neumann problems for self-adjoint Laplacians on (possibly infinite) graphs. Under the assumption that the heat semigroup is ultracontractive we discuss the unique solvability for non-empty subgraphs with respect to the vertex…
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…
We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…