Related papers: Stochastic Completeness of Graphs
Let $\Gamma$ be an arbitrary $\mathbb{Z}^n$-periodic metric graph, which does not coincide with a line. We consider the Hamiltonian $\mathcal{H}_\varepsilon$ on $\Gamma$ with the action $-\varepsilon^{-1}{\mathrm{d}^2/\mathrm{d} x^2}$ on…
In this paper we characterize emptiness of the essential spectrum of the Laplacian under a hyperbolicity assumption for general graphs. Moreover we present a characterization for emptiness of the essential spectrum for planar tessellations…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
Graph spectral techniques for measuring graph similarity, or for learning the cluster number, require kernel smoothing. The choice of kernel function and bandwidth are typically chosen in an ad-hoc manner and heavily affect the resulting…
In this paper, we consider the approximate weighted graph matching problem and introduce stable and informative first and second order compatibility terms suitable for inclusion into the popular integer quadratic program formulation. Our…
Kernels on graphs have had limited options for node-level problems. To address this, we present a novel, generalized kernel for graphs with node feature data for semi-supervised learning. The kernel is derived from a regularization…
We prove a variant of the Davies-Gaffney-Grigor'yan Lemma for the continuous time heat kernel on graphs. We use it together with the Li-Yau inequality to obtain strong heat kernel estimates for graphs satisfying the exponential curvature…
In this paper, we prove two-sided heat kernel estimates on what we call "book-like" graphs. These are graphs consisting of pieces that satisfy the parabolic Harnack inequality that are glued together in a sufficiently nice way over a…
This is first of series papers on new two-side Gaussian bounds for the heat kernel $H(x,y,t)$ on a complete manifold $(M,g)$. In this paper, on a complete manifold $M$ with $Ric(M)\geq 0$, we obtain new two-side Gaussian bounds for the heat…
In this paper, we introduce a generalization of corona of graphs. This construction generalizes the generalized corona of graphs (consequently, the corona of graphs), the cluster of graphs, the corona-vertex subdivision graph of graphs and…
A procedure called \textit{graph burning} was introduced to facilitate the modelling of spread of an alarm, a social contagion, or a social influence or emotion on graphs and networks. Graph burning runs on discrete time-steps (or rounds).…
The aim of this paper is to propose a novel framework to infer the sheaf Laplacian, including the topology of a graph and the restriction maps, from a set of data observed over the nodes of a graph. The proposed method is based on sheaf…
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…
In this article, we relate the spectrum of the discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties of the graph: the existence of a perfect matching and the existence of a Hamiltonian cycle of the…
We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…
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 investigate spectral properties of Kirchhoff Laplacians on radially symmetric antitrees. This class of metric graphs enjoys a rich group of symmetries, which enables us to obtain a decomposition of the corresponding Laplacian into the…
We consider Laplacians on periodic metric graphs with unit-length edges. The spectrum of these operators consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite…
This paper studies the optimization of observation channels (stochastic kernels) in partially observed stochastic control problems. In particular, existence and continuity properties are investigated mostly (but not exclusively)…
A complete graph is the graph in which every two vertices are adjacent. For a graph $G=(V,E)$, the complete width of $G$ is the minimum $k$ such that there exist $k$ independent sets $\mathtt{N}_i\subseteq V$, $1\le i\le k$, such that the…