Enrico Facca

Enrico Facca
University of Padova | UNIPD · Department of Mathematics

About

20
Publications
3,522
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
123
Citations

Publications

Publications (20)
Article
Full-text available
We introduce the transport energy functional E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {E}}$$\end{document} (a variant of the Bouchitté–Buttazzo–Seppec...
Preprint
Full-text available
Detecting communities in networks is important in various domains of applications. While a variety of methods exists to perform this task, recent efforts propose Optimal Transport (OT) principles combined with the geometric notion of Ollivier-Ricci curvature to classify nodes into groups by rigorously comparing the information encoded into nodes' n...
Article
In wet-lab experiments, the slime mold Physarum polycephalum has demonstrated its ability to tackle a variety of computing tasks, among them the computation of shortest paths and the design of efficient networks. For the shortest path problem, a mathematical model for the evolution of the slime is available and it has been shown in computer experim...
Preprint
Network routing approaches are widely used to study the evolution in time of self-adapting systems. However, few advances have been made for problems where adaptation is governed by time-dependent inputs. In this work, we study a dynamical systems where the edge conductivities -- capacities -- of a network are regulated by time-varying mass loads i...
Article
Full-text available
Recent advances in measuring and modeling root water uptake along with refined electrical petrophysical models may help fill the existing gap in hydrological root model parametrization. In this paper, we discuss the choices to be made to combine root-zone hydrology and geoelectrical data with the aim of characterizing the active root zone. For each...
Article
Full-text available
Designing and optimizing different flows in networks is a relevant problem in many contexts. While a number of methods have been proposed in the physics and optimal transport literature for the one-commodity case, we lack similar results for the multicommodity scenario. In this paper we present a model based on optimal transport theory for finding...
Article
Recently a Dynamic-Monge-Kantorovich formulation of the PDE-based -optimal transport problem was presented. The model considers a diffusion equation enforcing the balance of the transported masses with a time-varying conductivity that evolves proportionally to the transported flux. In this paper we present an extension of this model that considers...
Preprint
Full-text available
In this paper, we give a new characterization of the cut locus of a point on a compact Riemannian manifold as the zero set of the optimal transport density solution of the Monge-Kantorovich equations, a PDE formulation of the optimal transport problem with cost equal to the geodesic distance. Combining this result with an optimal transport numerica...
Preprint
Full-text available
In this article we study the numerical solution of the $L^1$-Optimal Transport Problem on 2D surfaces embedded in $R^3$, via the DMK formulation introduced in [FaccaCardinPutti:2018]. We extend from the Euclidean into the Riemannian setting the DMK model and conjecture the equivalence with the solution Monge-Kantorovich equations, a PDE-based formu...
Article
Full-text available
Routing optimization is a relevant problem in many contexts. Solving directly this type of optimization problem is often computationally intractable. Recent studies suggest that one can instead turn this problem into one of solving a dynamical system of equations, which can instead be solved efficiently using numerical methods. This results in enab...
Preprint
We present a model for finding optimal multi-commodity flows on networks based on optimal transport theory. The model relies on solving a dynamical system of equations. We prove that its stationary solution is equivalent to the solution of an optimization problem that generalizes the one-commodity framework. In particular, it generalizes previous r...
Preprint
In this paper, we address the numerical solution of the Optimal Transport Problem on undirected weighted graphs, taking the shortest path distance as transport cost. The optimal solution is obtained from the long-time limit of the gradient descent dynamics. Among different time stepping procedures for the discretization of this dynamics, a backward...
Preprint
Full-text available
In wet-lab experiments \cite{Nakagaki-Yamada-Toth,Tero-Takagi-etal}, the slime mold Physarum polycephalum has demonstrated its ability to solve shortest path problems and to design efficient networks, see Figure \ref{Wet-Lab Experiments} for illustrations. Physarum polycephalum is a slime mold in the Mycetozoa group. For the shortest path problem,...
Preprint
Routing optimization is a relevant problem in many contexts. Solving directly this type of optimization problem is often computationally unfeasible. Recent studies suggest that one can instead turn this problem into one of solving a dynamical system of equations, which can instead be solved efficiently using numerical methods. This results in enabl...
Article
Full-text available
We extend our previous work on a biologically inspired dynamic Monge–Kantorovich model (Facca et al. in SIAM J Appl Math 78:651–676, 2018) and propose it as an effective tool for the numerical solution of the \(L^{1}\)-PDE based optimal transportation model. We first introduce a new Lyapunov-candidate functional and show that its derivative along t...
Preprint
Full-text available
We study the connections between Physarum Dynamics and Dynamic Monge Kantorovich (DMK) Optimal Transport algorithms for the solution of Basis Pursuit problems. We show the equivalence between these two models and unveil their dynamic character by showing existence and uniqueness of the solution for all times and constructing a Lyapunov functional w...
Preprint
Full-text available
In this paper we present an extension of the Dynamic-Monge-Kantorovich model that considers a time derivative of the transport density that grows as a power law of the transport flux counterbalanced by a linear decay term that maintains the density bounded. A sub-linear growth penalizes the flux intensity (i.e. the transport density) and promotes d...
Article
Full-text available
We consider the efficient solution of sequences of linear systems arising in the numerical solution of a branched transport model whose long time solution for specific parameter settings is equivalent to the solution of the Monge-Kantorovich equations of optimal transport. Galerkin FEM discretization combined with explicit Euler time stepping yield...
Article
Full-text available
In this work we study and expand a model describing the dynamics of a unicellular slime mold, Physarum Polycephalum (PP), which was proposed to simulate the ability of PP to find the shortest path connecting two food sources in a maze. The original model describes the dynamics of the slime mold on a finite dimensional planar graph using a pipe-flow...