Related papers: The Poisson's Problems on graphs

Let $\mathscr G:= (V,E)$ be a weighted locally finite graph whose finite measure $\mu$ has a positive lower bound. Motivated by wide interest in the current literature, in this paper we study the existence of classical solutions for a class…

Let $ G=(V,E) $ be a connected finite graph and $ \Delta $ the usual graph Laplacian. In this paper, we consider a generalized self-dual Chern-Simons equation on the graph $G$ \begin{eqnarray}\label{one1}…

Suppose that $G=(V, E)$ is a connected locally finite graph with the vertex set $V$ and the edge set $E$. Let $\Omega\subset V$ be a bounded domain. Consider the following quasilinear elliptic equation on graph $G$ $$ \left \{…

We prove norm-resolvent and spectral convergence in $L^2$ of solutions to the Neumann Poisson problem $-\Delta u_\varepsilon = f$ on a domain $\Omega_\varepsilon$ perforated by Dirichlet-holes and shrinking to a 1-dimensional interval. The…

In this paper we prove discrete to continuum convergence rates for Poisson Learning, a graph-based semi-supervised learning algorithm that is based on solving the graph Poisson equation with a source term consisting of a linear combination…

We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…

We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the biased infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on the general outline and approach…

The purpose of this paper is to study and classify singular solutions of the Poisson problem $$ %\begin{equation}\label{eq 0.1} \left \{ \begin{aligned} {\mathcal L}^s_\mu u = f \quad\ {\rm in}\ \, \Omega\setminus \{0\},\\ u =0 \quad\ {\rm…

Suppose that $G=(V, E)$ is a finite graph with the vertex set $V$ and the edge set $E$. Let $\Delta$ be the usual graph Laplacian. Consider the following nonlinear Schr$\ddot{o}$dinger type equation of the form $$ \left \{…

Let $G=(V,E)$ be a connected infinite and locally finite weighted graph, $\Delta_p$ be the $p$-th discrete graph Laplacian. In this paper, we consider the $p$-th Yamabe type equation $$-\Delta_pu+h|u|^{p-2}u=gu^{\alpha-1}$$ on $G$, where…

Our primary motivation is existence and uniqueness for the obstacle problem on graphs. That is, we look for unique solutions to the problem $Lu = \chi_{\{u>0\}}$, where $L$ is the Laplacian matrix associated to a graph, and $u$ is a…

In this paper, we first prove some propositions of Sobolev spaces defined on a locally finite graph $G=(V,E)$, which are fundamental when dealing with equations on graphs under the variational framework. Then we consider a nonlinear…

In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a…

We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…

In this note, we study the Liouville equation $\Delta u = -e^u$ on a graph G satisfying certain isoperimetric inequality. Following the idea of W. Ding, we prove that there exists a uniform lower bound for the energy, $\Sigma_G e^u$ of any…

Suppose that $G=(V, E)$ be a locally finite and connected graph with symmetric weight and uniformly positive measure, where $V$ denotes the vertex set and $E$ denotes the edge set. We are concered with the following problem $$…

We analyze the $s$-dependence of solutions $u_s$ to the family of fractional Poisson problems $(-\Delta)^s u =f$ in $\Omega$, $u \equiv 0$ on $\mathbb{R}^N\setminus \Omega$ in an open bounded set $\Omega \subset \mathbb{R}^N$, $s \in…

In this paper we study the Poisson problem, \[ \begin{cases} -{\rm div}(d^\beta\nabla u)=f&{\rm in}\ \Omega\\ u=0&{\rm on}\ \partial\Omega, \end{cases} \] where $\Omega\subset\mathbb R^N$, $N\ge2$ is a smooth bounded domain, $f$ is a…

How to draw the vertices of a complete multipartite graph $G$ on different points of a bounded $d$-dimensional integer grid, such that the sum of squared distances between vertices of $G$ is (i) minimized or (ii) maximized? For both…

Given a finite simple undirected graph $G$, let $T_1(G)$ denote the subset of vertices of $G$ such that every vertex of $T_1(G)$ belongs to at least one subgraph isomorphic to a graph obtained by connecting a single vertex to two vertices…