Discrete Green's Functions
Journal of Combinatorial Theory Series APublished 1 July 2000
Fan Chung, Shing‐Tung Yau
Citations245
SJR quartileQ1
SJR score1.32
SNIP1.74
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
D discrete Green's functions can be used to deal with diffusion-type problems on graphs, such as chip-firing, load balancing, and discrete Markov chains.
Abstract
We study discrete Green's functions and their relationship with discrete Laplace equations. Several methods for deriving Green's functions are discussed. Green's functions can be used to deal with diffusion-type problems on graphs, such as chip-firing, load balancing, and discrete Markov chains.
Keywords
Computer ScienceMathematics
Annalen der PhysikUeber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
1,212 Citations1847G. Kirchhoff
Journal of Differential GeometryCurvature and the eigenvalues of the Laplacian
927 Citations1967H. P. McKean, I. M. Singer
Algebraic Graph Theory
265 Citations2016
Journal für die reine und angewandte Mathematik (Crelles Journal)An Essay on the Application of mathematical Analysis to the theories of Electricity and Magnetism.
141 Citations1852George Green
Linear Algebra and its ApplicationsFeasibility conditions for the existence of walk-regular graphs
127 Citations1980Chris Godsil, Brendan D. McKay
Journal of Combinatorial Theory Series AA Combinatorial Laplacian with Vertex Weights
95 Citations1996Fan Chung, R. P. Langlands
The matrix-tree theorem is generalized to matrix-Tree theorems of counting “rooted” directed spanning trees and the characteristic polynomial of the vertex-weighted Laplacian has coefficients with similar interpretations.
The Electronic Journal of CombinatoricsCoverings, Heat Kernels and Spanning Trees
83 Citations1998Fan Chung, Shing‐Tung Yau
It is shown that a $k-regular graph on $n$ vertices has at most (1+o (1) + o(1) n spanning trees, which is best possible within a constant factor.
Communications in Analysis and GeometryA Harnack inequality for homogeneous graphs and subgraphs
45 Citations1994Fan Chung, Stephen Yau
Communications in Analysis and GeometryEigenvalue inequalities for graphs and convex subgraphs
44 Citations1997Fan Chung, Shing‐Tung Yau
The Mathematical GazetteGeorge Green, mathematician and physicist 1793 – 1841
17 Citations1993Dorothy Cannell, N. J. Lord
Discrete MathematicsThe discrete Green's function and the discrete kernel function
12 Citations1974Charles Deeter, J.Michael Gray
Applicable AnalysisConvergence of Discrete Green's Functions for Finite Difference Schemes
7 Citations1985Rainer Kreß, Grigorieff
International series of numerical mathematicsGreen’s Functions for the Finite Difference Heat, Laplace and Wave Equations
5 Citations1984Dale H. Mugler