Related papers: The Poisson's Problems on graphs

Caro, Davila, and Pepper (arXiv:1909.09093) recently proved $\delta(G) \alpha(G)\leq \Delta(G) \mu(G)$ for every graph $G$ with minimum degree $\delta(G)$, maximum degree $\Delta(G)$, independence number $\alpha(G)$, and matching number…

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…

Let $G$ be a simple graph with $n$ vertices and let $$C(G;x)=\sum_{k=0}^n(-1)^{n-k}c(G,k)x^k$$ denote the Laplacian characteristic polynomial of $G$. Then if the size $|E(G)|$ is large compared to the maximum degree $\Delta(G)$, Laplacian…

We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…

Let $G$ be a graph and ${\mathcal{\tau}}: V(G)\rightarrow \Bbb{N}\cup \{0\}$ be an assignment of thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a dynamic monopoly corresponding to $(G, \tau)$ if the vertices of…

For every connected graph $G$ and surface $S$, we consider the well-known string of inequalities $\delta_S(G) \leq \mu_S(G) \leq \nu_S(G)$, where $\mu$ and $\nu$ denote skewness and crossing number and $\delta$ is the Euler-formula lower…

The "exact subgraph" approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization problems. Solving these relaxations is a computational…

Let $(V,\mu)$ be an infinite, connected, locally finite weighted graph. We study the problem of existence or non-existence of positive solutions to a semi-linear elliptic inequality \begin{equation*} \Delta u+u^{\sigma}\leq0\quad…

In graph signal processing, data samples are associated to vertices on a graph, while edge weights represent similarities between those samples. We propose a convex optimization problem to learn sparse well connected graphs from data. We…

For $D$ a bounded domain in $\mathbb R^d, d \ge 2,$ with smooth boundary $\partial D$, the non-linear inverse problem of recovering the unknown conductivity $\gamma$ determining solutions $u=u_{\gamma, f}$ of the partial differential…

The problem of continuation of a partially defined metric can be efficiently studied using graph theory. Let $G=G(V,E)$ be an undirected graph with the set of vertices $V$ and the set of edges $E$. A necessary and sufficient condition under…

Consider observations $y_1,\dots,y_n$ on nodes of a connected graph, where the $y_i$ independently come from $N(\theta_i, \sigma^2)$ distributions and an unknown partition divides the $n$ observations into blocks. One well-studied class of…

In this paper, we study the following $p$-Laplacian equation $$ -\Delta_{p} u+h(x)|u|^{p-2} u=\left(R_{\alpha} *F(u)\right)f(u) $$ on lattice graphs $\mathbb{Z}^N$, where $p\geq 2$, $\alpha \in(0,N)$ are constants and $R_{\alpha}$ is the…

Let $G=(V,E)$ be a connected graph. The distance between two vertices $u,v\in V$, denoted by $d(u, v)$, is the length of a shortest $u-v$ path in $G$. The distance between a vertex $v\in V$ and a subset $P\subset V$ is defined as $min\{d(v,…

Let $\Omega \subset \mathbb{R}^N$, $N \geq 2$, be a smooth bounded domain. For $s \in (1/2,1)$, we consider a problem of the form \[ \left\{\begin{aligned} (-\Delta)^s u & = \mu(x)\, \mathbb{D}_s^{2}(u) + \lambda f(x)\,, & \quad \mbox{in}…

We consider the following two algorithmic problems: given a graph $G$ and a subgraph $H\subseteq G$, decide whether $H$ is an isometric or a geodesically convex subgraph of $G$. It is relatively easy to see that the problems can be solved…

We say that a graph $G=(V,E)$ on $n$ vertices is a $\beta$-expander for some constant $\beta>0$ if every $U\subseteq V$ of cardinality $|U|\leq \frac{n}{2}$ satisfies $|N_G(U)|\geq \beta|U|$ where $N_G(U)$ denotes the neighborhood of $U$.…

We study the existence and the properties of the reduced measures for the parabolic equations $\partial_tu-\Delta u+g(u)=0$ in $\Omega\times (0,\infty)$ subject to the conditions ($P$): $u=0$ on $\partial\Omega\times (0,\infty)$,…

We investigate decompositions of a graph into a small number of low diameter subgraphs. Let P(n,\epsilon,d) be the smallest k such that every graph G=(V,E) on n vertices has an edge partition E=E_0 \cup E_1 \cup ... \cup E_k such that |E_0|…

Let $G=(V, E)$ be a connected finite graph, $h$ be a positive function on $V$ and $\lambda _{1}(V)$ be the first non-zero eigenvalue of $-\Delta$. For any given finite measure $\mu$ on $V$, define functionals \begin{eqnarray*} J_{ \beta…