Related papers: The Poisson's Problems on graphs

Differential equations on metric graphs can describe many phenomena in the physical world but also the spread of information on social media. To efficiently compute the solution is a hard task in numerical analysis. Solving a design…

For a connected weighted hypergraph, we give a randomized almost-linear-time solver for the Poisson problem for the cut-based hypergraph Laplacian in the natural input size $P=\sum_{e\in E}|e|$, the sum of hyperedge sizes. For every fixed…

This paper presents bounds for the variation of the spectral radius $\lambda(G)$ of a graph $G$ after some perturbations or local vertex/edge modifications of $G$. The perturbations considered here are the connection of a new vertex with,…

Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…

We prove the (optimal) $W^{1,\infty}$-regularity of weak solutions to the equation $-\Delta u = Q \; \mathcal{H}^{n-1} \llcorner \Gamma$ in a domain $\Omega \subset \mathbb{R}^n$ with Dirichlet boundary conditions, where $\Gamma \subset…

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…

Let $G=(V, E)$ be a finite weighted graph, and $\Omega\subseteq V$ be a domain such that $\Omega^\circ\neq\emptyset$. In this paper, we study the following initial boundary problem for the non-homogenous wave equation \begin{equation*}…

We give a bi-criteria approximation algorithm for the Minimum Nonuniform Partitioning problem, recently introduced by Krauthgamer, Naor, Schwartz and Talwar (2014). In this problem, we are given a graph $G=(V,E)$ on $n$ vertices and $k$…

The wave equation on network is defined by $\partial_{tt}u=\Delta_{G}u+g(u)$, where $u\in\mathbb{R}^{n}$ and the graph Laplacian $\Delta_{G}$ is an operator on functions on $n$ vertices. We suppose that $g:\mathbb{R}^{n}\rightarrow…

We consider positive solutions, possibly unbounded, to the semilinear equation $-\Delta u=f(u)$ on continuous epigraphs bounded from below. Under the homogeneous Dirichlet boundary condition, we prove new monotonicity results for $u$, when…

In this paper, we assume that $q>0$, $p>1$ and $s\in(0,1)$ , and consider the following nonlinear fractional p-Laplacian equations on finite graphs: \begin{equation*} \left\{ \begin{array}{lll} \partial_t u^q(x,t)+(-\Delta)_p^su=0,\\[15pt]…

We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the…

We seek solutions $u\in\R^n$ to the semilinear elliptic partial difference equation $-Lu + f_s(u) = 0$, where $L$ is the matrix corresponding to the Laplacian operator on a graph $G$ and $f_s$ is a one-parameter family of nonlinear…

This paper proposes a novel Machine Learning-based approach to solve a Poisson problem with mixed boundary conditions. Leveraging Graph Neural Networks, we develop a model able to process unstructured grids with the advantage of enforcing…

The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…

Let $G=(V,E)$ be a finite graph and $\Delta$ be the usual graph Laplacian. Using the calculus of variations and a method of upper and lower solutions, we give various conditions such that the Kazdan-Warner equation $\Delta u=c-he^u$ has a…

The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…

If $\mu_m$ and $d_m$ denote, respectively, the $m$-th largest Laplacian eigenvalue and the $m$-th largest vertex degree of a graph, then $\mu_m \geqslant d_m-m+2$. This inequality was conjectured by Guo in 2007 and proved by Brouwer and…

Let $G=(V,E)$ be a connected finite graph. We study the Bogomol'nyi equation \begin{equation*} \Delta u= \mathrm{e}^{u}-1 +4 \pi \sum_{s=1}^{k} n_s \delta_{z_{s}} \quad \text { on } \quad G, \end{equation*} where $z_1, z_2,\dots, z_k$ are…

In this article the problem to be studied is the following $$ (P) \left\{ \begin{array}{rcll} u_t+(-\D^s_{p}) u & = & f(x,t) & \text{ in } \O_{T}\equiv \Omega \times (0,T), \\ u & = & 0 & \text{ in }(\ren\setminus\O) \times (0,T), \\ u &…