English
Related papers

Related papers: Constructing heat kernels on infinite graphs

200 papers

Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…

Combinatorics · Mathematics 2012-03-08 Nicolai Hähnle

We study the low-energy approximation for calculation of the heat kernel which is determined by the strong slowly varying background fields in strongly curved quasi-homogeneous manifolds. A new covariant algebraic approach, based on taking…

High Energy Physics - Theory · Physics 2007-05-23 Ivan G. Avramidi

We derive a local Gaussian upper bound for the $f$-heat kernel on complete smooth metric measure space $(M,g,e^{-f}dv)$ with nonnegative Bakry-\'{E}mery Ricci curvature, which generalizes the classic Li-Yau estimate. As applications, we…

Differential Geometry · Mathematics 2015-09-08 Jia-Yong Wu , Peng Wu

A graph short-time Fourier transform is defined using the eigenvectors of the graph Laplacian and a graph heat kernel as a window parametrized by a non-negative time parameter $t$. We show that the corresponding Gabor-like system forms a…

Spectral Theory · Mathematics 2024-02-27 Martin Buck , Kasso Okoudjou

We consider Laplace operators on metric graphs, networks of one-dimensional line segments (bonds), with matching conditions at the vertices that make the operator self-adjoint. Such quantum graphs provide a simple model of quantum mechanics…

Mathematical Physics · Physics 2017-08-23 J. M. Harrison , K. Kirsten

Let $(X,d,\mu)$ be a $RCD^\ast(K, N)$ space with $K\in \mathbb{R}$ and $N\in [1,\infty]$. For $N\in [1,\infty)$, we derive the upper and lower bounds of the heat kernel on $(X,d,\mu)$ by applying the parabolic Harnack inequality and the…

Metric Geometry · Mathematics 2015-12-02 Renjin Jiang , Huaiqian Li , Huichun Zhang

In this paper, we study the geometry associated with Schroedinger operator via Hamiltonian and Lagrangian formalism. Making use of a multiplier technique, we construct the heat kernel with the coefficient matrices of the operator both…

Analysis of PDEs · Mathematics 2012-04-20 Sheng-Ya Feng

The geometric vertex decomposability property for polynomial ideals is an ideal-theoretic generalization of the vertex decomposability property for simplicial complexes. Indeed, a homogeneous geometrically vertex decomposable ideal is…

Commutative Algebra · Mathematics 2025-11-14 Mike Cummings , Sergio Da Silva , Jenna Rajchgot , Adam Van Tuyl

For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho^{L}_{1}\geq \rho^{L}_{2}\geq \cdots \geq \rho^{L}_{n}$, the distance Laplacian energy $DLE(G)$ is defined as…

Combinatorics · Mathematics 2021-12-07 Hilal A. Ganie , Rezwan Ul Shaban , Bilal A. Rather , S. Pirzada

We give the first linear kernels for the (Connected) Dominating Set problems on H-topological minor free graphs. We prove the existence of polynomial time algorithms that, for a given H-topological-minor-free graph G and a positive integer…

Data Structures and Algorithms · Computer Science 2017-10-26 Fedor V. Fomin , Daniel Lokshtanov , Saket Saurabh , Dimitrios M. Thilikos

Graph Burning asks, given a graph $G = (V,E)$ and an integer $k$, whether there exists $(b_{0},\dots,b_{k-1}) \in V^{k}$ such that every vertex in $G$ has distance at most $i$ from some $b_{i}$. This problem is known to be NP-complete even…

Data Structures and Algorithms · Computer Science 2020-09-29 Yasuaki Kobayashi , Yota Otachi

Kernel functions for Laplacian integral operators are constructed on $p$-adic analytic manifolds using charts and transition maps from an atlas with connected nerve complex. In the compact case, an operator of Vladimirov-Taibleson type…

Analysis of PDEs · Mathematics 2025-12-11 Patrick Erik Bradley

Autonomous individuals establish a structural complex system through pairwise connections and interactions. Notably, the evolution reflects the dynamic nature of each complex system since it recodes a series of temporal changes from the…

Machine Learning · Computer Science 2023-06-27 Xue Liu , Dan Sun , Wei Wei , Zhiming Zheng

This article deals with 2d almost Riemannian structures, which are generalized Riemannian structures on manifolds of dimension 2. Such sub-Riemannian structures can be locally defined by a pair of vector fields (X,Y), playing the role of…

Optimization and Control · Mathematics 2014-08-12 Grégoire Charlot

This paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turan's theorem, which…

Combinatorics · Mathematics 2017-07-31 Peter Allen , Julia Böttcher , Jan Hladký , Diana Piguet

Adopting the powerful methods introduced in \cite{li2021carnotcaratheodory, LZ2025}, we investigate the asymptotic behaviour at infinity for the heat kernel associated with the Grushin operator $\Delta_G = \Delta_x + |x|^2 \Delta_u$ on $…

Analysis of PDEs · Mathematics 2026-05-26 Yimeng Chen , Hong-Quan Li , Jun-Cheng Tang , Jia-Yu Yang

We study Dirac-type operators on incomplete cusp edge spaces with invertible boundary families. In particular, we construct the heat kernel for the associated Laplace-type operator and prove that the Dirac operators are essentially…

Differential Geometry · Mathematics 2025-08-05 Jayson Liu

We establish two-sided Gaussian bounds on the heat kernel of divergence-form parabolic equation with singular time-inhomogeneous vector field satisfying some minimal assumptions.

Analysis of PDEs · Mathematics 2023-11-22 Damir Kinzebulatov , Yuliy A. Semenov

We propose a representation of graph as a functional object derived from the power iteration of the underlying adjacency matrix. The proposed functional representation is a graph invariant, i.e., the functional remains unchanged under any…

Machine Learning · Computer Science 2014-04-22 Anshumali Shrivastava , Ping Li

We describe the design of a reproducing kernel suitable for attributed graphs, in which the similarity between the two graphs is defined based on the neighborhood information of the graph nodes with the aid of a product graph formulation.…

Artificial Intelligence · Computer Science 2022-01-21 Asif Salim , Shiju. S. S , Sumitra. S
‹ Prev 1 8 9 10 Next ›