Related papers: Kazdan-Warner equation on graph

This paper gives a framework to study a continuum limit of a gradient flow on a graph where the number of vertices increases in an appropriate way. As examples we prove the convergence of a discrete total variation flow and a discrete…

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…

We prove that for all $\mu>0, t\in (0,1)$ and sufficiently large $n\in 4\mathbb{N}$, if $G$ is an edge-weighted complete graph on $n$ vertices with a weight function $w: E(G)\rightarrow [0,1]$ and the minimum weighted degree…

We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…

A picture P of a graph G = (V,E) consists of a point P(v) for each vertex v in V and a line P(e) for each edge e in E, all lying in the projective plane over a field k and subject to containment conditions corresponding to incidence in G. A…

For any undirected and simple graph G = (V;E), where V denotes the vertex set and E the edge set of G. G is called hamiltonian if it contains a cycle that visits each vertex of G exactly once. Ore (1960) proved that G is hamiltonian if…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

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…

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

We consider solutions of Lagrangian variational problems with linear constraints on the derivative. These solutions are given by curves $\gamma$ in a differentiable manifold $M$ that are everywhere tangent to a smooth distribution $\mathcal…

In this paper we consider the discrete Allen-Cahn equation posed on a two-dimensional rectangular lattice. We analyze the large-time behaviour of solutions that start as bounded perturbations to the well-known planar front solution that…

This paper investigates a boundary-value problem for the Korteweg-de Vries (KdV) equation on a star-graph structure. We develop a unified framework introducing the notion of $s$-compatibility, which generalizes classical compatibility…

Let $G$ be a graph, and $H\colon V(G)\to 2^\mathbb{N}$ a set function associated with $G$. A spanning subgraph $F$ of $G$ is called an $H$-factor if the degree of any vertex $v$ in $F$ belongs to the set $H(v)$. This paper contains two…

It is proved that vertical graphs and radial graphs are strongly stable for a certain type of densities in Euclidean space ${\mathbb R}^{n+1}$. Particular cases of these densities include translators, expanders and singular minimal…

This paper deals with an initial and boundary value problem for a system coupling equation and boundary condition both of Cahn-Hilliard type; an additional convective term with a forced velocity field, which could act as a control on the…

Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…

Here we consider the following fractional Hamiltonian system \begin{equation*} \begin{cases} \begin{aligned} (-\Delta)^{s} u&=H_v(u,v) \;\;&&\text{in}~\Omega,\\ (-\Delta)^{s} v&=H_u(u,v) &&\text{in}~\Omega,\\ u &= v = 0 &&\text{in} ~…

From the paper of the first author it follows that upper and lower bounds for $\gamma$-vector of a simple polytope imply the bounds for its $g$-,$h$- and $f$-vectors. In the paper of the second author it was obtained unimprovable upper and…

We provide an upper bound to the number of graph homomorphisms from $G$ to $H$, where $H$ is a fixed graph with certain properties, and $G$ varies over all $N$-vertex, $d$-regular graphs. This result generalizes a recently resolved…

In this paper, we study the following Kazdan-Warner equation with sign-changing prescribed function $h$ \begin{align*} -\Delta u=8\pi\left(\frac{he^{u}}{\int_{\Sigma}he^{u}}-1\right) \end{align*} on a closed Riemann surface whose area is…