Related papers: The Poisson's Problems on graphs

The smallest nonzero eigenvalue of the normalized Laplacian matrix of a graph has been extensively studied and shown to have many connections to properties of the graph. We here study a generalization of this eigenvalue, denoted $\lambda(G,…

A set $D \subseteq V$ of a graph $G=(V, E)$ is a dominating set of $G$ if each vertex $v\in V\setminus D$ is adjacent to at least one vertex in $D,$ whereas a set $D_2\subseteq V$ is a $2$-dominating (double dominating) set of $G$ if each…

Let $X$ be a compact Riemannian manifold with conic singularities, i.e. a Riemannian manifold whose metric has a conic degeneracy at the boundary. Let $\Delta$ be the Friedrichs extension of the Laplace-Beltrami operator on $X.$ There are…

Equip each point $x$ of a homogeneous Poisson process $\mathcal{P}$ on $\mathbb{R}$ with $D_x$ edge stubs, where the $D_x$ are i.i.d. positive integer-valued random variables with distribution given by $\mu$. Following the stable…

This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…

In this article, the limiting behavior of the solution $\bar u_s$ of the optimal control problem subjected to the fractional Poisson equation $$(-\Delta)^s u_s(x)=f_s(x), \quad x\in \Omega$$ defined on domain $\Omega$ bounded by smooth…

In this paper, we prove two existence results of solutions to mean field equations $$\Delta u+e^u=\rho\delta_0$$ and $$\Delta u=\lambda e^u(e^u-1)+4 \pi \sum_{j=1}^{M}{\delta_{p_j}}$$ on an arbitrary connected finite graph, where $\rho>0$…

In this paper, we establish a couple of results on extremal problems in bipartite graphs. Firstly, we show that every sufficiently large bipartite graph with average degree $D$ and with $n$ vertices on each side has a balanced independent…

In Dunkl theory on $\mathbb{R}^{n}$ which generalizes classical Fourier analysis, we study the solution of the Klein-Gordon-equation defined by: \begin{eqnarray} \nonumber \partial_{t}^{2}u-\Delta_{k}u=-m^{2}u \ , \ \ \ u (x,0)=g(x) \ , \ \…

Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…

\[ \Delta u+g(u)=f(x) \s \mbox{for $x \in \Omega$}, \s u=0 \s \mbox{on $\partial \Omega$} \] decompose $f(x)=\mu _1 \p _1+e(x)$, where $\p _1$ is the principal eigenfunction of the Laplacian with zero boundary conditions, and $e(x) \perp \p…

We propose a method by which to recover an underlying graph from a set of multivariate wave signals that is discretely sampled from a solution of the graph wave equation. Herein, the graph wave equation is defined with the graph Laplacian,…

The goal of this short paper to advertise the method of gauge transformations (aka holographic reduction, reparametrization) that is well-known in statistical physics and computer science, but less known in combinatorics. As an application…

In this paper we consider the degree/diameter problem, namely, given natural numbers {\Delta} \geq 2 and D \geq 1, find the maximum number N({\Delta},D) of vertices in a graph of maximum degree {\Delta} and diameter D. In this context, the…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

We compute the value of the $L^1$-relaxed area of the graph of the map $u : B_l(0)\subset \mathbb R^2 \mapsto \mathbb R^2$, $u(x):= x/\vert x\vert$, $x \neq 0$, for all values of $l>0$. Interestingly, for $l$ in a certain range, in…

Let $G$ be a graph with $p(G)$ pendant vertices and $q(G)$ quasi-pendant vertices. Denote by $m_{L(G)}(\lambda)$ the multiplicity of $\lambda$ as a Laplacian eigenvalue of $G$. Let $\overline{G}$ be the reduced graph of $G$, which can be…

The aim of the paper is to study the problem $$u_{tt}+du_t-c^2\Delta u=0 \qquad \text{in $\mathbb{R}\times\Omega$,}$$ $$\mu v_{tt}- \text{div}_\Gamma (\sigma \nabla_\Gamma v)+\delta v_t+\kappa v+\rho u_t =0\qquad \text{on $\mathbb{R}\times…

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex of $G$ is either in $S$ or is adjacent to a vertex in $S$. Nordhaus-Gaddum inequailties relate a graph $G$ to its complement $\bar{G}$. In this spirit Wagner…

The Poisson problem consists in finding an immersed surface $\Sigma\subset\mathbb{R}^m$ minimising Germain's elastic energy (known as Willmore energy in geometry) with prescribed boundary, boundary Gauss map and area which constitutes a…