English
Related papers

Related papers: Harnack Inequality for Magnetic Graphs

200 papers

We introduce a new version of a curvature-dimension inequality for non-negative curvature. We use this inequality to prove a logarithmic Li-Yau inequality on finite graphs. To formulate this inequality, we introduce a non-linear variant of…

Differential Geometry · Mathematics 2014-12-11 Florentin Münch

In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…

Combinatorics · Mathematics 2022-07-11 John Stewart Fabila-Carrasco , Fernando Lledó , Olaf Post

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…

Spectral Theory · Mathematics 2025-12-24 Kiyan Naderi , Noema Nicolussi

We construct \emph{intrinsic} metrics on the Strichartz hexacarpet using weight functions and show that these metrics do \emph{not} satisfy the chain condition. We give uniform Harnack inequality on the approximating graphs of the…

Functional Analysis · Mathematics 2019-11-11 Meng Yang

We establish the Krylov--Safonov theory for a large class of nonlocal operators of order $2s \in (0,2)$ on hyperbolic spaces $\mathbb{H}^{n}_{\kappa}$ with curvature $-\kappa<0$. We prove the Alexandrov--Bakelman--Pucci (ABP) estimates,…

Analysis of PDEs · Mathematics 2025-12-02 Jongmyeong Kim , Minhyun Kim , Ki-Ahm Lee

For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…

Spectral Theory · Mathematics 2020-08-11 Noam Leiter , Daniel Zelazo

We study the spectrum of the normalized Laplace operator of a connected graph $\Gamma$. As is well known, the smallest nontrivial eigenvalue measures how difficult it is to decompose $\Gamma$ into two large pieces, whereas the largest…

Combinatorics · Mathematics 2015-03-13 Frank Bauer , Jürgen Jost

We consider the class of closed Riemannian $n$-manifolds with Ricci curvature and injectivity radius bounded below by uniform constants, and an upper bound on the diameter. We establish a uniform upper bound for the eigenvalues of the Hodge…

Differential Geometry · Mathematics 2026-03-12 Anusha Bhattacharya , Soma Maity

We show new upper bounds for permanents and hafnians, which are particularly useful for complex matrices. Multidimensional permanents and hyperhafnians are considered as well. The permanental bounds improve on a Hadamard type inequality of…

Classical Analysis and ODEs · Mathematics 2020-05-12 Bero Roos

In this paper, we investigate the eigenvalues of the Laplacian matrix of the "graph of graphs", in which cubic graphs of order n are joined together using Whitehead moves. Our work follows recent results from arXiv:2303.13923 , which…

Combinatorics · Mathematics 2024-05-24 Michael Li

In a seminal paper published in 1980, P. C. Yang and S.-T. Yau proved an inequality bounding the first eigenvalue of the Laplacian on an orientable Riemannian surface in terms of its genus $\gamma$ and the area. The equality in Yang-Yau's…

Differential Geometry · Mathematics 2019-09-13 Mikhail Karpukhin

We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…

Combinatorics · Mathematics 2011-01-18 Matthias Keller

A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…

Spectral Theory · Mathematics 2020-05-20 Ikemefuna Agbanusi , Jared C. Bronski , Derek Kielty

Given an undirected graph $G$, the classical Cheeger constant, $h_G$, measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon the sizes of the parts. The well-known Cheeger's inequality…

Combinatorics · Mathematics 2015-03-02 Franklin Kenter , Mary Radcliffe

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,…

Combinatorics · Mathematics 2012-02-01 Frank Bauer

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…

Spectral Theory · Mathematics 2013-11-20 A. Abiad , M. A. Fiol , W. H. Haemers , G. Perarnau

If $\mu_m$ and $d_m$ denote, respectively, the $m$-th largest Laplacian eigenvalue and the $m$-th largest vertex degree of a graph, then $\mu_m \geqslant d_m-m+2$. This inequality was conjectured by Guo in 2007 and proved by Brouwer and…

Combinatorics · Mathematics 2019-01-31 Gary R. W. Greaves , Akihiro Munemasa , Anni Peng

We apply the techniques of our previous paper to study joint eigenfunctions of the Laplacian and one Hecke operator on compact congruence surfaces, and joint eigenfunctions of the two partial Laplacians on compact quotients of…

Dynamical Systems · Mathematics 2010-06-21 Shimon Brooks , Elon Lindenstrauss

In this paper we study the gradient estimate for positive solutions of Schrodinger equations on locally finite graph. Then we derive Harnack's inequality for positive solutions of the Schrodinger equations. We also set up some results about…

Differential Geometry · Mathematics 2013-11-01 Li Ma

The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…

Combinatorics · Mathematics 2018-07-20 Aida Abiad , Boris Brimkov , Xavier Martinez-Rivera , O Suil , Jingmei Zhang