Related papers: Shape Optimization Problems for Metric Graphs

This paper proves a $\Gamma$-convergence result for the discrete energy (to the continuous one) of the matching problem for signals defined on surfaces. In particular, we highlight some geometric properties that must be guaranteed in the…

Let $\Gamma$ be a graph with diameter at least two. Then $\Gamma$ is said to be $1$-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices $x$ and $y$ in $\Gamma$, the distance partition of the vertex set of…

We prove the convergence of the fixed-point (also called thresholding) algorithm in three optimal control problems under large volume constraints. This algorithm was introduced by C\'ea, Gioan and Michel, and is of constant use in the…

For a graph $H$, a graph $G$ is an $H$-graph if it is an intersection graph of connected subgraphs of some subdivision of $H$. $H$-graphs naturally generalize several important graph classes like interval or circular-arc graph. This class…

We introduce a graph $\Gamma$ which is roughly isometric to the hyperbolic plane and we study the Steklov eigenvalues of a subgraph with boundary $\Omega$ of $\Gamma$. For $(\Omega_l)_{l\geq 1}$ a sequence of subraphs of $\Gamma$ such that…

In this note we announce some results that will appear in [6] (joint work with also Matteo Novaga) on the minimization of the functional $F(\Gamma)=\int_\Gamma k^2+1\,\mathrm{d}s$, where $\Gamma$ is a network of three curves with fixed…

We consider general shape optimization problems governed by Dirichlet boundary value problems. The proposed approach may be extended to other boundary conditions as well. It is based on a recent representation result for implicitly defined…

In this article, we consider parabolic equations on a bounded open connected subset $\Omega$ of $\R^n$. We model and investigate the problem of optimal shape and location of the observation domain having a prescribed measure. This problem…

This investigation is motivated by the problem of optimal design of cooling elements in modern battery systems. We consider a simple model of two-dimensional steady-state heat conduction described by elliptic partial differential equations…

We show optimal Lipschitz regularity for very weak solutions of the (measure-valued) elliptic PDE $-\mathrm{div}(A(x) \nabla u) = Q \; \mathcal{H}^{n-1} \llcorner \Gamma$ in a smooth domain $\Omega \subset \mathbb{R}^n$. Here $\Gamma$ is a…

In this paper, we propose and analyze a finite element discretization for the computation of fractional minimal graphs of order~$s \in (0,1/2)$ on a bounded domain $\Omega$. Such a Plateau problem of order $s$ can be reinterpreted as a…

Let $m$ be a bounded function and $\alpha$ a nonnegative parameter. This article is concerned with the first eigenvalue $\lambda\_\alpha(m)$ of the drifted Laplacian type operator $\mathcal L\_m$ given by $\mathcal L\_m(u)=…

This work deals with shape optimization for contact mechanics. More specifically, the linear elasticity model is considered under the small deformations hypothesis, and the elastic body is assumed to be in contact (sliding or with Tresca…

In this paper, we show that for a minimal pose-graph problem, even in the ideal case of perfect measurements and spherical covariance, using the so-called "wrap function" when comparing angles results in multiple suboptimal local minima. We…

Let $\Gamma(\cdot,\lambda)$ be smooth, i.e.\, $\mathcal C^\infty$, embeddings from $\bar{\Omega}$ onto $\bar{\Omega^{\lambda}}$, where $\Omega$ and $\Omega^\lambda$ are bounded domains with smooth boundary in the complex plane and $\lambda$…

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the…

We study $\Gamma$-convergence of graph Dirichlet energies and spectral convergence of graph Laplacians on unions of intersecting manifolds of potentially different dimensions. Our investigation is motivated by problems of machine learning,…

In this paper, we prove a problem proposed by Bre\v{s}ar: for any graphs $G$ and $H$, $\Gamma(G\square H)\ge\Gamma(G)\Gamma(H)+ \min\{|V(G)|-\Gamma(G),|V(H)|-\Gamma(H)\}$, where $\Gamma(G)$ denotes the upper domination number of $G$.

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension $\mu(\Gamma)$ is the smallest size…

We develop criteria based on a calibration argument via discrete PDE and semidiscrete optimal transport, for finding sharp isoperimetric inequalities of the form $(\sharp \Omega)^{d-1} \le C (\sharp \overrightarrow{\partial\Omega})^d$ where…