相关论文: The Kazdan-Warner equation on canonically compacti…

In this paper, we obtain a comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs and discuss its rigidity. As applications of the comparison of eigenvalues, we obtain Lichnerowicz-type estimates and some combinatorial…

We present a short proof of the Kac-Ward formula for the partition function of the Ising model on planar graphs.

Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…

D. A. Kahzdan first put forth property (T) in relation to the study of discrete subgroups of Lie groups of finite co-volume. Through a combinatorial approach, we define an analogue of property (T) for regular graphs. We then prove the basic…

Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…

There are two main notions of a Laplacian operator associated with graphs: discrete graph Laplacians and continuous Laplacians on metric graphs (widely known as quantum graphs). Both objects have a venerable history as they are related to…

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…

We study the physical Laplacian and the corresponding heat flow on an infinite, locally finite graph with possibly unbounded valence.

We construct an explicit compactification for the space of parametrized rational curves in a Grassmanian by a nonsingular projective variety such that the boundary is a divisor with simple normal crossings. This compactification is obtained…

Graph Laplacians as well as related spectral inequalities and (co-)homology provide a foray into discrete analogues of Riemannian manifolds, providing a rich interplay between combinatorics, geometry and theoretical physics. We apply some…

We use orientations on stable graphs to express the combinatorial structure of the compactified universal Jacobians in degrees g-1 and g over the moduli space of stable curves, \Mgb, and construct for them graded stratifications compatible…

In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a…

Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…

We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…

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 give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily…

For a self--adjoint Laplace operator on a finite, not necessarily compact, metric graph lower and upper bounds on each of the negative eigenvalues are derived. For compact finite metric graphs Poincar\'{e} type inequalities are given.

Motivated by a question on the graded rank of the stalks of the canonical sheaf on a Bruhat graph, we lift some equalities concerning (parabolic) Kazhdan-Lusztig polynomials to this moment graph setting. Our proofs hold also in positive…

We obtain a Hitchin-Kobayashi-type correspondence for symplectic vortex equations, with the target a Kahler cone over a compact Sasakian manifold. We show that the correspondence reduces to studying the existence and uniqueness of…

The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful…