Related papers: Graphical Translators for Mean Curvature Flow
Total five different types of translation surfaces, based upon planarity of translating curves and the absolute figure, arise in a Galilean 3-space. Excepting the type in which both of translating curves are non-planar we obtain these…
Recently, transformer architectures for graphs emerged as an alternative to established techniques for machine learning with graphs, such as (message-passing) graph neural networks. So far, they have shown promising empirical results, e.g.,…
We complete the classification of semigraphical translators for mean curvature flow in $\mathbb{R}^3$ that was initiated by Hoffman-Mart\'in-White. Specifically, we show that there is no solution to the translator equation on the upper…
A translating soliton is a hypersurface $M$ in $\mathbb{R}^{n+1}$ such that the family $M_t= M- t \,\mathbf{e}_{n+1}$ is a mean curvature flow, i.e., such that normal component of the velocity at each point is equal to the mean curvature at…
Our aim is to study the Total Variation Flow in Metric Graphs. First, we define the functions of bounded variation in Metric Graphs and their total variation, we also give an integration by parts formula. We prove existence and uniqueness…
Graph generative model evaluation necessitates understanding differences between graphs on the distributional level. This entails being able to harness salient attributes of graphs in an efficient manner. Curvature constitutes one such…
A $\lambda$-translator is a surface in Euclidean space $\mathbb{R}^3$ whose Gauss curvature $K$ satisfies $K=\langle N, \vec{v} \rangle +\lambda$, where $N$ is the Gauss map, $\vec{v}$ is a fixed direction, and $\lambda \in \mathbb{R}$. In…
In this paper, we study the convexity, interior gradient estimate, Liouville type theorem and asymptotic behavior at infinity of translating solutions to mean curvature flow as well as the nonlinear flow by powers of the mean curvature.
In this paper, we study the mean curvature flow of graphs with Neumann boundary condition. The main aim is to use the maximum principle to get the boundary gradient estimate for solutions. In particular, we obtain the corresponding…
In this paper, we introduce a family of tetravalent graphs called propeller graphs, denoted by $Pr_{n}(b,c,d)$. We then produce three infinite subfamilies and one finite subfamily of arc-transitive propeller graphs, and show that all such…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
In the first part of the paper, we prove the existence of longtime solution to mean curvature flow starting from a graph of a continuous function defined over a slab. Then, we establish dynamical stability results for various types of…
We desingularise the union of $3$ Grim paraboloids along Costa-Hoffman-Meeks surfaces in order to obtain complete embedded translating solitons of the mean curvature flow with $3$ ends and arbitrary finite genus.
In this paper, we study the rigidity results of complete graphical translating hypersurfaces when the translating direction is not in the graphical direction. We proved that any entire graphical translating surface in the translating…
Transformers were originally proposed as a sequence-to-sequence model for text but have become vital for a wide range of modalities, including images, audio, video, and undirected graphs. However, transformers for directed graphs are a…
This paper presents a novel neural machine translation model which jointly learns translation and source-side latent graph representations of sentences. Unlike existing pipelined approaches using syntactic parsers, our end-to-end model…
Researchers have relegated natural language processing tasks to Transformer-type models, particularly generative models, because these models exhibit high versatility when performing generation and classification tasks. As the size of these…
Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…
Theoretical analyses for graph learning methods often assume a complete observation of the input graph. Such an assumption might not be useful for handling any-size graphs due to the scalability issues in practice. In this work, we develop…
In this short note we study Bernstein's type theorem of translating solitons whose images of their Gauss maps are contained in compact subsets in an open hemisphere of the standard $\mathbf{S}^n$ (see Theorem 1.1). As a special case we get…