Calculus on Graphs
Joel Friedman, Jean-Pierre Tillich
Abstract
The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new (Laplacian based) wave equation; this wave equation gives rise to a partial improvement on the Chung-Faber-Manteuffel diameter/eigenvalue bound in graph theory, and the Chung-Grigoryan-Yau and (in a certain case) Bobkov-Ledoux distance/eigenvalue bounds in analysis. Our framework also allows most techniques for the non-linear p-Laplacian in analysis to be easily carried over to graph theory.
Create a lesson
Related papers
On Collusion-Free Teaching in Planar Graphs
Khazaliya Liana, Kuske Clemens
Graph Distortion Distances, Gromov-Hausdorff and the Hardness of Gromov-Wasserstein
Jens Breitung, Timo Gervens, Julius Pörzgen
A note on Finiteness and Boundedness in Cartesian Products of Discrete and Well-Ordered Sets, Application to Transition Systems
Gerard Memmi
Period Piece: NEXPTIME-complete problems on digraphs via Boolean network dynamics
Florian Bridoux, Maximilien Gadouleau, David C. Kutner et al.
A Four-by-Four Obstruction to Polynomial Removal for Ordered Binary Matrices
Zinan Wang
Almost every Boolean function has central threshold degree
Martin Anthony