Related papers: The anisotropic Bernstein problem
The Multimarginal Schr\"odinger Bridge (MSB) finds the optimal coupling among a collection of random vectors with known statistics and a known correlation structure. In the MSB formulation, this correlation structure is specified \emph{a…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
We prove a compactness principle for the anisotropic formulation of the Plateau problem in any codimension, in the same spirit of the previous works of the authors \cite{DelGhiMag,DePDeRGhi,DeLDeRGhi16}. In particular, we perform a new…
We investigate the Minimum Eccentricity Shortest Path problem in some structured graph classes. It asks for a given graph to find a shortest path with minimum eccentricity. Although it is NP-hard in general graphs, we demonstrate that a…
This article is the second of two in which we develop a geometric framework for analysing silent and anisotropic big bang singularities. In the present article, we record geometric conclusions obtained by combining the geometric framework…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
We study minimal graphs in the homogeneous Riemannian 3-manifold $\widetilde{PSL_2(\mathbb{R})}$ and we give examples of invariant surfaces. We derive a gradient estimate for solutions of the minimal surface equation in this space and…
Many well-studied problems in extremal combinatorics deal with the maximum possible size of a family of objects in which every pair of objects satisfies a given restriction. One problem of this type was recently raised by Alon, Gujgiczer,…
The edge isoperimetric problem for a graph $G$ is to determine, for each $n$, the minimum number of edges leaving any set of $n$ vertices. In general this problem is NP-hard, but exact solutions are known in some special cases, for example…
Modeling and generating graphs is fundamental for studying networks in biology, engineering, and social sciences. However, modeling complex distributions over graphs and then efficiently sampling from these distributions is challenging due…
We use gravitational decoupling to establish a connection between the minimal geometric deformation approach and the standard method for obtaining anisotropic fluid solutions. Motivated by the relations that appear in the framework of…
A subgraph is constructed by using a subset of vertices and edges of a given graph. There exist many graph properties that are hereditary for subgraphs. Hence, researchers from different communities have paid a great deal of attention in…
We extend the monotonicity method for direct exact reconstruction of inclusions in the partial data Calder\'on problem, to the case of general anisotropic conductivities in any spatial dimension $d\geq 2$. From a local Neumann-to-Dirichlet…
We study the Dirichlet problem for minimal surface systems in arbitrary dimension and codimension via mean curvature flow, and obtain the existence of minimal graphs over arbitrary mean convex bounded $C^2$ domains for a large class of…
We consider a nonlinear parametric Neumann problem driven by the anisotropic $(p,q)$-Laplacian and a reaction which exhibits the combined effects of a singular term and of a parametric superlinear perturbation. We are looking for positive…
Self-shrinkers are important geometric objects in the study of mean curvature flows, while the Bernstein Theorem is one of the most profound results in minimal surface theory. We prove a Bernstein type result for graphical self-shrinker…
We propose two efficient algorithms for generating uniform random directed acyclic graphs, including an asymptotically optimal exact-size sampler that performs $\frac{n^2}{2} + o(n^2)$ operations and requests to a random generator. This was…
We develop a functional analytic approach for the study of nonlocal minimal graphs. Through this, we establish existence and uniqueness results, a priori estimates, comparison principles, rearrangement inequalities, and the equivalence of…
We give existence and regularity results for solutions of some nonlinear elliptic problems. The equations we deal with are modeled on a problem which involves in its principal part an anisotropic operator, a Hardy-type potential, and a…
We discuss the problem of extending data mining approaches to cases in which data points arise in the form of individual graphs. Being able to find the intrinsic low-dimensionality in ensembles of graphs can be useful in a variety of…