The Poisson's Problems on graphs

Abstract

In this paper we study the problem \[ cases -d u = μ0 & in G\\ u = 0 & on ∂ G cases \] where, d represent the discret Laplacian, and μ0 it is a measure defined in the vertex of the graph G=(V,E). Here V defined the vertex of the graph, E its edges and ∂ G its boundary. We prove that this problem has an unique solution by using an adaption of the Perron's method for the graphs by using an idea known as Balayage.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…