Related papers: Shape Optimization Problems for Metric Graphs

We investigate the approximation of the Monge problem (minimizing \int\_$\Omega$ |T (x) -- x| d$\mu$(x) among the vector-valued maps T with prescribed image measure T \# $\mu$) by adding a vanishing Dirichlet energy, namely $\epsilon$…

A crucial problem in shape deformation analysis is to determine a deformation of a given shape into another one, which is optimal for a certain cost. It has a number of applications in particular in medical imaging. In this article we…

In this paper we prove that solutions to several shape optimization problems in the plane, with a convexity constraint on the admissible domains, are polygons. The main terms of the shape functionals we consider are either E f ($\Omega$),…

In this paper, we consider the well-known following shape optimization problem: $$\lambda_2(\Omega^*)=\min_{\stackrel{|\Omega|=V_0} {\Omega\textrm{ convex}}} \lambda_2(\Omega),$$ where $\lambda_2(\Om)$ denotes the second eigenvalue of the…

This paper focuses on the statistical analysis of shapes of data objects called shape graphs, a set of nodes connected by articulated curves with arbitrary shapes. A critical need here is a constrained registration of points (nodes to…

We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a neighbour in $S$. In a reconfiguration problem, the goal is…

We consider Cheeger-like shape optimization problems of the form $$\min\big\{|\Omega|^\alpha J(\Omega) : \Omega\subset D\big\}$$ where $D$ is a given bounded domain and $\alpha$ is above the natural scaling. We show the existence of a…

Let $\Gamma(E)$ be the family of all paths which meet a set $E$ in the metric measure space $X$. The set function $E \mapsto AM(\Gamma(E))$ defines the $AM$--modulus measure in $X$ where $AM$ refers to the approximation modulus. We compare…

A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…

For graphs $G$ and $H$, a mapping $f: V(G)\dom V(H)$ is a homomorphism of $G$ to $H$ if $uv\in E(G)$ implies $f(u)f(v)\in E(H).$ If, moreover, each vertex $u \in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of the…

We propose a method based on the combination of theoretical results on Blaschke--Santal\'o diagrams and numerical shape optimization techniques to obtain improved description of Blaschke--Santal\'o diagrams in the class of planar convex…

We carry on our study of the connection between two shape optimization problems with spectral cost. On the one hand, we consider the optimal design problem for the survival threshold of a population living in a heterogenous habitat…

This paper introduces a new extension of Riemannian elastic curve matching to a general class of geometric structures, which we call (weighted) shape graphs, that allows for shape registration with partial matching constraints and…

We consider approximating a measure by a parameterized curve subject to length penalization. That is for a given finite positive compactly supported measure $\mu$, for $p \geq 1$ and $\lambda>0$ we consider the functional \[ E(\gamma) =…

We consider a spectral optimal design problem involving the Neumann traces of the Dirichlet-Laplacian eigenfunctions on a smooth bounded open subset $\Omega$ of $\R^n$. The cost functional measures the amount of energy that Dirichlet…

For $\Omega$ varying among open bounded sets in ${\mathbb R} ^n$, we consider shape functionals $J (\Omega)$ defined as the infimum over a Sobolev space of an integral energy of the kind $\int _\Omega[ f (\nabla u) + g (u) ]$, under…

Our concern is the computation of optimal shapes in problems involving $\(-\Delta)^{1/2}$. We focus on the energy $J(\Omega)$ associated to the solution $u\_\Omega$ of the basic Dirichlet problem $(-\Delta)^{1/2} u\_\Omega = 1$ in $\Omega$,…

Let $G = (V,E)$ be an undirected graph with maximum degree $\Delta$ and vertex conductance $\Psi^*(G)$. We show that there exists a symmetric, stochastic matrix $P$, with off-diagonal entries supported on $E$, whose spectral gap…

For shape optimization problems, governed by elliptic equations with Dirichlet boundary condition and random coefficients, we utilize a penalization technique to get the approximate problem. We consider that uncertainties exists in the…

We study a shape optimization problem for the first eigenvalue of an elliptic operator in divergence form, with non constant coefficients, over a fixed domain $\Omega$. Dirichlet conditions are imposed along $\partial \Omega$ and, in…