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. © 2000 Academic Press.
Cite
CITATION STYLE
APA
Chung, F., & Yau, S. T. (2000). Discrete Green’s functions. Journal of Combinatorial Theory. Series A, 91(1–2), 191–214. https://doi.org/10.1006/jcta.2000.3094
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free