相关论文: Stochastic completeness for graphs with curvature …
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…
In this work, we give a sufficient condition for a step-two Carnot group to satisfy the quasi Bakry-\'Emery curvature condition. As an application, we establish the gradient estimate for the heat semigroup on the free step-two Carnot group…
In this paper we show how techniques coming from stochastic analysis, such as stochastic completeness (in the form of the weak maximum principle at infinity), parabolicity and $L^p$-Liouville type results for the weighted Laplacian…
We propose a new fractional Laplacian for bounded domains, expressed as a conservation law and thus particularly suited to finite-volume schemes. Our approach permits the direct prescription of no-flux boundary conditions. We first show the…
We study several problems related to the $\ell^p$ boundedness of Riesz transforms for graphs endowed with so-called bounded Laplacians. Introducing a proper notion of gradient of functions on edges, we prove for $p\in(1,2]$ an $\ell^p$…
In the first part, we derive a sharp gradient estimate for the log of Dirichlet heat kernel and Poisson heat kernel on domains, and a sharpened local Li-Yau gradient estimate that matches the global one. In the second part, without explicit…
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 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…
Let $G$ be a simple graph with $n$ vertices and let $$C(G;x)=\sum_{k=0}^n(-1)^{n-k}c(G,k)x^k$$ denote the Laplacian characteristic polynomial of $G$. Then if the size $|E(G)|$ is large compared to the maximum degree $\Delta(G)$, Laplacian…
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…
We introduce a dynamically defined class of unbounded, connected, equilateral metric graphs on which the Kirchhoff Laplacian has zero Lebesgue measure spectrum and a nontrivial singular continuous part. A new local Borg--Marchenko…
In this paper, we first prove that the following generalized conservation principle holds on complete Riemannian manifolds: for every \(0<s<1\) and \(t>0\), \[ T_t^{(s)}\mathbf 1+\int_0^t T_\tau^{(s)}\mathcal R_s\,d\tau=1 \qquad\text{on }M,…
We describe the complete spectra of Laplacian, signless Laplacian, and adjacency matrices associated with the commuting graphs of a finite group using group theoretic information. We provide a method to find the center of a group by only…
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 apply the quotient graph theory described by Band, Berkolaiko, Joyner and Liu to particular graphs symmetric with respect to $S_3$ and $C_3$ symmetry groups. We find the quotient graphs for the three-edge star quantum graph with Neumann…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
In this paper, we present several upper bounds for the adjacency and signless Laplacian spectral radii of uniform hypergraphs in terms of degree sequences.
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…
Among the well-known sufficient degree conditions for the Hamiltonicity of a finite graph, the condition of Asratian and Khachatrian is the weakest and thus gives the strongest result. Diestel conjectured that it should extend to locally…
In this paper, first, we establish a sufficient condition for a bipartite graph to be Hamilton-connected. Furthermore, we also give two sufficient conditions on distance signless Laplacian spectral radius for a graph to be…