In mathematics, a quasi-isometry is a function between two metric spaces that respects large-scale geometry of these spaces and ignores their small-scale details. Two metric spaces are quasi-isometric if there exists a quasi-isometry between them. The property of being quasi-isometric behaves like an equivalence relation on the class of metric spaces.
The concept of quasi-isometry is especially important in geometric group theory, following the work of Gromov.
Suppose that is a (not necessarily continuous) function from one metric space to a second metric space . Then is called a quasi-isometry from to if there exist constants , , and such that the following two properties both hold:
For every two points and in , the distance between their images is up to the additive constant within a factor of of their original distance. More formally:
Every point of is within the constant distance of an image point. More formally:
The two metric spaces and are called quasi-isometric if there exists a quasi-isometry from to .
A map is called a quasi-isometric embedding if it satisfies the first condition but not necessarily the second (i.e. it is coarsely Lipschitz but may fail to be coarsely surjective). In other words, if through the map, is quasi-isometric to a subspace of .
Two metric spaces M1 and M2 are said to be quasi-isometric, denoted , if there exists a quasi-isometry .
The map between the Euclidean plane and the plane with the Manhattan distance that sends every point to itself is a quasi-isometry: in it, distances are multiplied by a factor of at most . Note that there can be no isometry, since, for example, the points are of equal distance to each other in Manhattan distance, but in the Euclidean plane, there are no 4 points that are of equal distance to each other.
The map (both with the Euclidean metric) that sends every -tuple of integers to itself is a quasi-isometry: distances are preserved exactly, and every real tuple is within distance of an integer tuple.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ce cours entend exposer les fondements de la géométrie à un triple titre :
1/ de technique mathématique essentielle au processus de conception du projet,
2/ d'objet privilégié des logiciels de concept
Le cours vise l'acquisition de concepts et méthodes des Science and Technology Studies afin d'apprendre à décoder l'intrication des sciences et technologies dans la société en mobilisant ces éléments
In group theory, a word metric on a discrete group is a way to measure distance between any two elements of . As the name suggests, the word metric is a metric on , assigning to any two elements , of a distance that measures how efficiently their difference can be expressed as a word whose letters come from a generating set for the group. The word metric on G is very closely related to the Cayley graph of G: the word metric measures the length of the shortest path in the Cayley graph between two elements of G.
In Lie theory and related areas of mathematics, a lattice in a locally compact group is a discrete subgroup with the property that the quotient space has finite invariant measure. In the special case of subgroups of Rn, this amounts to the usual geometric notion of a lattice as a periodic subset of points, and both the algebraic structure of lattices and the geometry of the space of all lattices are relatively well understood. The theory is particularly rich for lattices in semisimple Lie groups or more generally in semisimple algebraic groups over local fields.
In group theory, more precisely in geometric group theory, a hyperbolic group, also known as a word hyperbolic group or Gromov hyperbolic group, is a finitely generated group equipped with a word metric satisfying certain properties abstracted from classical hyperbolic geometry. The notion of a hyperbolic group was introduced and developed by . The inspiration came from various existing mathematical theories: hyperbolic geometry but also low-dimensional topology (in particular the results of Max Dehn concerning the fundamental group of a hyperbolic Riemann surface, and more complex phenomena in three-dimensional topology), and combinatorial group theory.
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in Benjamini and Timar, using ...
In this work, we focus on the family of shell formulations referred to as "solid shells", where the simulation of shell-type structures is performed by means of a mesh of 3D solid elements, with typically only one element through the thickness. We propose ...
SPRINGER2020
In graph coarsening, one aims to produce a coarse graph of reduced size while preserving important graph properties. However, as there is no consensus on which specific graph properties should be preserved by coarse graphs, measuring the differences betwee ...