Discrete Green's Functions
Explore this paper's citation graph
Summary
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.
- Type
- article
- Published
- 2000-07-01
- Cited by
- 259
- References
- 21
- OpenAlex
- https://openalex.org/W1993713305
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:5957407
Keywords
Markov chain, Laplace transform, Discrete time and continuous time, Mathematics, Green's function for the three-variable Laplace equation
References
- A Harnack inequality for homogeneous graphs and subgraphs
- Discrete Green's functions and strong stability properties of the finite difference method
- Curvature and the Eigenvalues of the Laplacian
- Coverings, Heat Kernels and Spanning Trees
- An Essay on the Application of mathematical Analysis to the theories of Electricity and Magnetism.
- Convergence of Discrete Green's Functions for Finite Difference Schemes
- Das asymptotische verteilungsgesetz der eigenschwingungen eines beliebig gestalteten elastischen körpers
- The discrete Green's function and the discrete kernel function
- Discrete Green’s functions
- Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
- A Combinatorial Laplacian with Vertex Weights
- Feasibility conditions for the existence of walk-regular graphs
- Eigenvalue inequalities for graphs and convex subgraphs
- Connectivity and Smoke-Rings: Green's Second Identity in Its First Fifty Years
- George Green: Mathematician and Physicist 1793-1841
- George a green
- Green and Green's functions
- Connectivity and Smoke-Rings: Green's Second Identity in Its First Fifty Years
- Green’s Functions for the Finite Difference Heat, Laplace and Wave Equations
- A combinatorial trace formula ∗
Cited by
- Representation, Segmentation and Matching of 3D Visual Shapes using Graph Laplacian and Heat-Kernel. (Représentation, Segmentation et Appariement de Formes Visuelles 3D Utilisant le Laplacient et le Noyau de la Chaleur)
- Many-to-Many High Order Matching. Applications to Tracking and Object Segmentation
- Diffusion and clustering on large graphs
- Non-Hookean Beams and Plates: Very Weak Solutions and their Numerical Analysis
- Wasserstein Propagation for Semi-Supervised Learning
- Harmonic Functions On Square Lattices: Uniqueness Sets and Growth Properties
- Visual feature graphs and image recognition
- The inverse problem on finite networks
- Jacobi matices and boundary value problems in distance-regular graphs
- PDE Approaches to Graph Analysis
- Harnack's inequality and Green functions on locally finite graphs
- Discrete Green's functions for products of regular graphs
- Graph invariants from ideas in physics and number theory
- Data clustering and graph-based image matching methods
- Characterizing diverse link patterns in complex networks: theory and applications
- Deducing Vertex Weights from Empirical Occupation Times
- Ported Tutte Functions of Extensors and Oriented Matroids
- A Hitting Time Formula for the Discrete Green's Function
- Green function for a two-dimensional discrete Laplace-Beltrami operator
- Multi‐Scale Kernels Using Random Walks