Related papers: Nonlocal minimal graphs in the plane are generical…
We prove that the boundary of a (not necessarily connected) bounded smooth set with constant nonlocal mean curvature is a sphere. More generally, and in contrast with what happens in the classical case, we show that the Lipschitz constant…
We prove an inequality for the curvature of level sets of minimal graphs having vanishing boundary values and show that if the boundary is concave, then all the level sets are concave.
Nonlocal (spatial-dispersion) effects in multilayered metamaterials composed of periodic stacks of alternating, deeply subwavelength dielectric layers are known to be negligibly weak. Counterintuitively, under certain critical conditions,…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
We consider the geometric evolution problem of entire graphs moving by fractional mean curvature. For this, we study the associated nonlocal quasilinear evolution equation satisfied by the family of graph functions. We establish, using an…
The purpose of this paper is to prove some results on the absence of bound states for certain nonlinear Schr\"odinger equations on noncompact metric graphs with localized nonlinearity. In particular, we show how the topological and metric…
Local Irregularity Conjecture states that every simple connected graph, except special cacti, can be decomposed into at most three locally irregular graphs, i.e., graphs in which adjacent vertices have different degrees. The connected…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
We study the variational behavior of the total inverse mean curvature of curves with prescribed boundary in the half-plane. We characterize the existence of critical points with prescribed area. We show that such critical points are…
A graph is $1$-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges…
A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.…
We establish the well-posedness of the nonlocal mean curvature flow of order ${\alpha\in(0,1)}$ for periodic graphs on $\mathbb{R}^n$ in all subcritical little H\"older spaces ${\rm h}^{1+\beta}(\mathbb{T}^n)$ with $\beta\in(0,1)$.…
On a compact manifold with boundary, the map consisting of the scalar curvature in the interior and the mean curvature on the boundary is a local surjection at generic metrics. Moreover, this result may be localized to compact subdomains in…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
Discontinuities in spatial derivatives appear in a wide range of physical systems, from creased thin sheets to materials with sharp stiffness transitions. Accurately modeling these features is essential for simulation but remains…
We study overdamped stochastic dynamics confined by hard reflecting boundaries and show that the combination of boundary geometry and an anisotropic diffusion tensor generically generates directed motion. At the level of individual…
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding durable patterns, such as triangles and paths, which persist…
Graph neural networks are experiencing a surge of popularity within the machine learning community due to their ability to adapt to non-Euclidean domains and instil inductive biases. Despite this, their stability, i.e., their robustness to…
The interaction between local traits and global frameworks of mathematical objects has long endured as a central theme in various mathematical domains. A graph \(G\) is referred to as locally linear provided that the subgraph induced by the…