Related papers: Nonlocal minimal graphs in the plane are generical…
The goal of local certification is to locally convince the vertices of a graph $G$ that $G$ satisfies a given property. A prover assigns short certificates to the vertices of the graph, then the vertices are allowed to check their…
A property of finite graphs is called nondeterministically testable if it has a "certificate" such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that…
We prove a "gluing" theorem for monotone homotopies; a monotone homotopy is a homotopy through simple contractible closed curves which themselves are pairwise disjoint. We show that two monotone homotopies which have appropriate overlap can…
We study weak solutions for a class of free boundary problems which includes as a special case the classical problem of traveling waves on water of finite depth. We show that such problems are equivalent to problems in fixed domains and…
We consider the asymptotic behavior of properly embedded minimal surfaces in the product of the hyperbolic plane with the line, taking into account the fact that there is more than one natural compactification of this space. This provides a…
We study asymptotic behaviors of solutions $f$ to the Dirichlet problem for minimal graphs in the hyperbolic space with singular asymptotic boundaries under the assumption that the boundaries are piecewise regular with positive curvatures.…
We consider point clouds obtained as random samples of a measure on a Euclidean domain. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. Our goal is to…
Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…
Strict outerconfluent drawing is a style of graph drawing in which vertices are drawn on the boundary of a disk, adjacencies are indicated by the existence of smooth curves through a system of tracks within the disk, and no two adjacent…
Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…
The analysis of non-local regularisations of scalar conservation laws is an active research program. Applications of such equations are found in the modelling of physical phenomena such as traffic flow. In this paper, we propose a novel…
In low dimensions, conformal anomaly has profound influence on the critical behavior of random surfaces with extrinsic curvature rigidity $1/\a$. We illustrate this by making a small $D$ expansion of rigid random surfaces, where a…
We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…
Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…
Localized planar patterns in spatially extended bistable systems are known to exist along intricate bifurcation diagrams, which are commonly referred to as snaking curves. Their analysis is challenging as techniques such as spatial dynamics…
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…
We show that the image of a nonconstant conformal harmonic map $\mathbb C\to \mathbb R^3$, not necessarily proper and possibly with branch points, intersects every properly embedded nonflat minimal surface of bounded curvature in $\mathbb…
We study the Dirichlet problem for least gradient functions for domains in metric spaces equipped with a doubling measure and supporting a (1,1)-Poincar\'e inequality when the boundary of the domain satisfies a positive mean curvature…
A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…
We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. This is a natural extension of the study of regular graphs, and of the study of graphs of…