Related papers: The Poisson's Problems on graphs

The strong geodetic problem is a recent variation of the geodetic problem. For a graph $G$, its strong geodetic number ${\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that each vertex of $G$ lies on a fixed shortest…

We consider the Cauchy problem for the evolutive discrete p-Laplacian in infinite graphs, with initial data decaying at infinity. We prove optimal sup and gradient bounds for nonnegative solutions, when the initial data has finite mass, and…

In this paper, motivated by the work of Huang-Lin-Yau (Commun. Math. Phys. 2020), Sun-Wang (Adv. Math. 2022) and Li-Sun-Yang (Calc. Var. Partial Differential Equations 2024), we investigate the existence of Kazdan-Warner type equations on a…

We solve the graph bi-partitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut-size to scale universally with <k^1/2>. In contrast, earlier results studying the problem in graphs with…

Eigenvalue behavior for the equation -\lambda y"=Vu on the edges of a graph G of final total length, with a non-negative weight function V and under the Kirchhoff matching conditions at the vertices and zero boundary condition at at least…

Let $G=(V,E)$ be a locally finite graph, $\Omega\subset V$ be a bounded domain, $\Delta$ be the usual graph Laplacian, and $\lambda_1(\Omega)$ be the first eigenvalue of $-\Delta$ with respect to Dirichlet boundary condition. Using the…

We study the normal approximation of functionals of Poisson measures having the form of a finite sum of multiple integrals. When the integrands are nonnegative, our results yield necessary and sufficient conditions for central limit…

We develop criteria based on a calibration argument via discrete PDE and semidiscrete optimal transport, for finding sharp isoperimetric inequalities of the form $(\sharp \Omega)^{d-1} \le C (\sharp \overrightarrow{\partial\Omega})^d$ where…

Let $\Omega$ be an open, possibly unbounded, set in Euclidean space $\R^m$ with boundary $\partial\Omega,$ let $A$ be a measurable subset of $\Omega$ with measure $|A|$, and let $\gamma \in (0,1)$. We investigate whether the solution…

The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if…

Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…

{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by choosing a…

We investigate the torsion function or landscape function and its integral, the torsional rigidity, of Laplacians on metric graphs subject to $\delta$-vertex conditions. A variational characterization of torsional rigidity and Hadamard-type…

We investigate the maximal degree in a Poisson-Delaunay graph in $\mathbf{R}^d$, $d\geq 2$, over all nodes in the window $\mathbf{W}_\rho:= \rho^{1/d}[0,1]^d$ as $\rho$ goes to infinity. The exact order of this maximum is provided in any…

Let $G=(V,E)$ be a locally finite connected weighted graph, and $\Omega$ be an unbounded subset of $V$. Using Rothe's method, we study the existence of solutions for the semilinear heat equation $\partial_tu+|u|^{p-1}\cdot u=\Delta…

Let $G$ be an $n$-vertex graph with Laplacian eigenvalues $0=\lambda_1(G)\le \lambda_2(G)\le\cdots\le \lambda_n(G)$. Motivated by the Alon-Boppana bound and the Ramanujan phenomenon for regular graphs, Spielman conjectured that, for every…

Let $G$ be a (di)graph. A set $W$ of vertices in $G$ is a \emph{resolving set} of $G$ if every vertex $u$ of $G$ is uniquely determined by its vector of distances to all the vertices in $W$. The \emph{metric dimension} $\mu (G)$ of $G$ is…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

The aim of the paper is to study the problem $$ \begin{cases} u_{tt}-\Delta u+P(x,u_t)=f(x,u) \qquad &\text{in $(0,\infty)\times\Omega$,} u=0 &\text{on $(0,\infty)\times \Gamma_0$,} u_{tt}+\partial_\nu u-\Delta_\Gamma…

Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…