Publications related to Intrinsic metric

Efficient and insightful descriptors for representing molecular and material space

Data-driven approaches have been applied to reduce the cost of accurate computational studies on materials, by using only a small number of expensive reference electronic structure calculations for a representative subset of the materials space, and using ...

EPFL2024

Spatiotemporal energy‐density distribution of time‐reversed electromagnetic fields

Farhad Rachidi-Haeri, Marcos Rubinstein, Hamidreza Karami, Elias Per Joachim Le Boudec, Nicolas Mora Parra

Time reversal exploits the invariance of electromagnetic wave propagation in reciprocal and lossless media to localize radiating sources. Time-reversed measurements are back-propagated in a simulated domain and converge to the unknown source location. The ...

2024

Fairness and Explainability in Clustering Problems

Xinrui Jia

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

EPFL2023

Tangent functional connectomes uncover more unique phenotypic traits

Enrico Amico, Mingkui Wang

Functional connectomes (FCs) containing pairwise estimations of functional couplings between pairs of brain regions are commonly represented by correlation matrices. As symmetric positive definite matrices, FCs can be transformed via tangent space projecti ...

CELL PRESS2023

Linear Lipschitz and C-1 extension operators through random projection

Federico Stra

We construct a regular random projection of a metric space onto a closed doubling subset and use it to linearly extend Lipschitz and C-1 functions. This way we prove more directly a result by Lee and Naor [5] and we generalize the C-l extension theorem by ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2021

Fair colorful k-center clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius rho such that there exist balls of radius rho aro ...

SPRINGER HEIDELBERG2022

Data-Driven Convergence Prediction of Astrobots Swarms

Denis Gillet, Jean-Paul Richard Kneib, Matin Macktoobian, Francesco Basciani

Astrobots are robotic artifacts whose swarms are used in astrophysical studies to generate the map of the observable universe. These swarms have to be coordinated with respect to various desired observations. Such coordination\footnote{\z{A coordination sa ...

2022

Fair Colorful k-Center Clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius ρ such that there exist balls of radius ρ around ...

Springer2020

Structural Properties Of Dendrite Groups

Nicolas Monod

Let G be the homeomorphism group of a dendrite. We study the normal subgroups of G. For instance, there are uncountably many nonisomorphic such groups G that are simple groups. Moreover, these groups can be chosen so that any isometric G-action on any metr ...

AMER MATHEMATICAL SOC2019

The (h, k)-Server Problem on Bounded Depth Trees

Marek Elias

We study the k-server problem in the resource augmentation setting, i.e., when the performance of the online algorithm with k servers is compared to the offline optimal solution with h

ASSOC COMPUTING MACHINERY2019

Approximating Steiner trees and forests with minimum number of Steiner points

Nachshon Cohen

Let R be a finite set of terminals in a convex metric space (M, d). We give approximation algorithms for problems of finding a minimum size set S subset of M of additional points such that the unit-disc graph G[R boolean OR S] of R boolean OR S satisfies s ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2018

Dynamic Facility Location via Exponential Clocks

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Hyung Chan An

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Association for Computing Machinery2017

The Myers-Steenrod Theorem For Finsler Manifolds Of Low Regularity

Marc Troyanov

We prove a version of Myers-Steenrod's theorem for Finsler manifolds under the minimal regularity hypothesis. In particular we show that an isometry between C-k,C-alpha-smooth (or partially smooth) Finsler metrics, with k + alpha > 0, k is an element of N ...

Amer Mathematical Soc2017

Delineating policies: governing spaces with no coextensive institutions : metropolitan areas and disadvantaged communities in the United States

Thomas Charles Marie Pierre Favre-Bulle

Many policies are spatially targeted: they attempt to foster or incent policy actions in areas meeting specific criteria. The identification and delineation of the spatial reality of interest is a major challenge to spatially targeted policies. In many cas ...

EPFL2017

Evaluation of control strategies for fixed-wing drones following slow-moving ground agents

Dario Floreano, Jean-Christophe Zufferey, Grégoire Hilaire Marie Heitz, Maja Varga

There are many situations where fixed-wing drones may be required to track ground moving agents, such as humans or cars, which are typically slower than drones. Some control strategies have been proposed and validated in simulations using the average dista ...

Elsevier2015

Principal Polynomial Analysis

Devis Tuia

This paper presents a new framework for manifold learning based on a sequence of principal polynomials that capture the possibly nonlinear nature of the data. The proposed Principal Polynomial Analysis (PPA) generalizes PCA by modeling the directions of ma ...

World Scientific Publ Co Pte Ltd2014

Overview of the Geometries of Shape Spaces and Diffeomorphism Groups

Martins Bruveris, Martin Bauer

This article provides an overview of various notions of shape spaces, including the space of parametrized and unparametrized curves, the space of immersions, the diffeomorphism group and the space of Riemannian metrics. We discuss the Riemannian metrics th ...

Springer Verlag2014

Actions of amenable equivalence relations on CAT(0) fields

Martin Anderegg, Philippe Paul Antoine Henry

We present the general notion of Borel fields of metric spaces and show some properties of such fields. Then we make the study specific to the Borel fields of proper CAT(0) spaces and we show that the standard tools we need behave in a Borel way. We also i ...

Cambridge University Press2014

Constructing reparameterization invariant metrics on spaces of plane curves

Martins Bruveris, Martin Bauer

Metrics on shape spaces are used to describe deformations that take one shape to another, and to define a distance between shapes. We study a family of metrics on the space of curves, which includes several recently proposed metrics, for which the metrics ...

Elsevier2014

Two and a half billion years of distance research

János Pach, Filip Moric

In a seminal paper published in 1946, Erd ̋os initiated the investigation of the distribution of distances generated by point sets in metric spaces. In spite of some spectacular par- tial successes and persistent attacks by generations of mathe- maticians, ...

2013