Related papers: Kazdan-Warner equation on infinite graphs
We consider the problem of heat diffusion in branched systems and networks on the basis of a model described in terms of heat equation on metric graphs. Using the explicit analytical solutions of the latter, evolution of the temperature…
The Induced Graph Matching problem asks to find k disjoint induced subgraphs isomorphic to a given graph H in a given graph G such that there are no edges between vertices of different subgraphs. This problem generalizes the classical…
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…
In this work we investigate Cauchy problem and initial boundary value problem for time-fractional Airy equation on the graphs with infinite and finite bonds. We studied properties of potentials for this equation and using these properties…
We study the Dirichlet problem of the following discrete infinity Laplace equation on unbounded subgraphs \begin{equation*} \Delta_{\infty}u(x):=\inf_{y\sim x}u(y)+\sup_{y\sim x}u(y)-2u(x)=f(x). \end{equation*} For the homogeneous case…
We prove a variant of the Davies-Gaffney-Grigor'yan Lemma for the continuous time heat kernel on graphs. We use it together with the Li-Yau inequality to obtain strong heat kernel estimates for graphs satisfying the exponential curvature…
Recently, Bennett et al. introduced the vertex-induced weighted Tur\'an problem. In this paper, we consider their open Tur\'an problem under sum-edge-weight function and characterize the extremal structure of $K_{l}$-free graphs. Based on…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
We investigate the semilinear wave equation with potential on weighted graphs. We establish sufficient conditions for the nonexistence of global-in-time solutions. Both nonnegative and sign-changing solutions are considered. In particular,…
Assume $\alpha\geq p>1$. Consider the following $p$-th Yamabe equation on a connected finite graph $G$: $$\Delta_p\varphi+h\varphi^{p-1}=\lambda f\varphi^{\alpha-1},$$ where $\Delta_p$ is the discrete $p$-Laplacian, $h$ and $f>0$ are fixed…
The present note concerns the "graph of graphs" that has cubic graphs as vertices connected by edges represented by the so-called Whitehead moves. Here, we prove that the outer-conductance of the graph of graphs tends to zero as the number…
The goal of this work is to identify steady-state solutions to dynamical systems defined on large, random families of networks. We do so by passing to a continuum limit where the adjacency matrix is replaced by a non-local operator with…
A rich $k$-flow is a nowhere-zero $k$-flow $\phi$ such that, for every pair of adjacent edges $e$ and $f$, $|\phi(e)| \neq |\phi(f)|$. A graph is rich flow admissible if it admits a rich $k$-flow for some integer $k$. In this paper, we…
Wasserstein gradient flows on probability measures have found a host of applications in various optimization problems. They typically arise as the continuum limit of exchangeable particle systems evolving by some mean-field interaction…
In this paper we study a convection-diffusion equation on a star-shaped graph composed by $n$ incoming edges and $m$ outgoing edges with a nonlinearity $f\in C^1(\rr)$ satisfying some additional general conditions. First, we prove the…
We present a graph-based numerical method for solving hyperbolic systems of conservation laws using discontinuous finite elements. This work fills important gaps in the theory as well as practice of graph-based schemes. In particular, four…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
Given a simple undirected graph $G$ and a positive integer $k$, the $k$-forcing number of $G$, denoted $F_k(G)$, is the minimum number of vertices that need to be initially colored so that all vertices eventually become colored during the…
We introduce a divisibility-type condition for directed graphs that is necessary for $\mathcal{Z}$-stability of the corresponding graph $C^*$-algebra. We prove that this condition is sufficient if either the graph $E$ has no cycles or the…
Let $(\Sigma,g)$ be a compact Riemannian surface without boundary and $\lambda_1(\Sigma)$ be the first eigenvalue of the Laplace-Beltrami operator $\Delta_g$. Let $h$ be a positive smooth function on $\Sigma$. Define a functional…