相关论文: Graphs at infinity: Liouville theorems, Recurrence…

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 study the uniqueness of self-adjoint and Markovian extensions of the Laplacian on weighted graphs. We first show that, for locally finite graphs and a certain family of metrics, completeness of the graph implies uniqueness of these…

We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.

Building on existing algorithms and results, we offer new insights and algorithms for various problems related to detecting maximal and maximum bicliques. Most of these results focus on graphs with small maximum degree, providing improved…

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

The Feller property concerns the preservation of the space of functions vanishing at infinity by the semigroup generated by an operator. We study this property in the case of the Laplacian on infinite graphs with arbitrary edge weights and…

We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…

We study a class of semilinear diffusion equations on infinite, connected, weighted graphs, focusing on two types of nonlinearities: monotone decreasing and Lipschitz continuous. Under minimal structural assumptions on the graph, we…

We investigate new properties of the fractional Dirichlet Laplacian on smooth bounded domains and establish fractional product estimates and nonlinear Poincar\'e inequalities. We also use these tools to study the long-time dynamics of the…

This paper is devoted to the study of directed graphs with extremal properties relative to certain metric functionals. We characterize up to isomorphism critical digraphs with infinite values of diameter, quasi-diameter, radius and…

Given i.i.d. observations uniformly distributed on a closed submanifold of the Euclidean space, we study higher-order generalizations of graph Laplacians, so-called Hodge Laplacians on graphs, as approximations of the Laplace-Beltrami…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other Laplacians for hypergraphs and directed graphs, are special…

We develop theory and methods that use the graph Laplacian to analyze the geometry of the underlying manifold of datasets. Our theory provides theoretical guarantees and explicit bounds on the functional forms of the graph Laplacian when it…

We prove Cheeger inequalities for p-Laplacians on finite and infinite weighted graphs. Unlike in previous works, we do not impose boundedness of the vertex degree, nor do we restrict ourselves to the normalized Laplacian and, more…

In the first part of this expository paper, we present and discuss the interplay of Dirichlet polynomials in some classical problems of number theory, notably the Lindel\"of Hypothesis. We review some typical properties of their means and…

We apply Cauchy's interlacing theorem to derive some eigenvalue bounds to the chromatic number using the normalized Laplacian matrix, including a combinatorial characterization of when equality occurs. Further, we introduce some new…

In this note, we study Laplacians on graphs for which connectivity within certain subgraphs tends to infinity. Our main focus are graphs sharing a common node set on which edge weights within certain clusters grow to infinity. As…

We study the limit of first eigenfunctions of (discrete) $p$-Laplacian on a finite subset of a graph with Dirichlet boundary condition, as $p\to 1.$ We prove that up to a subsequence, they converge to a summation of characteristic functions…

We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.