Related papers: Geometry of Similarity Comparisons
We derive upper bounds on the difference between the orthogonal projections of a smooth function $u$ onto two finite element spaces that are nearby, in the sense that the support of every shape function belonging to one but not both of the…
For real projective spaces, (a) the Euclidean immersion dimension, (b) the existence of axial maps, and (c) the topological complexity are known to be three facets of the same problem. But when it comes to embedding dimension, the classical…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
Street networks may be planned according to clear organizing principles or they may evolve organically through accretion, but their configurations and orientations help define a city's spatial logic and order. Measures of entropy reveal a…
This paper deals with different image theorems, i.e., Love's equivalence principle, the induction equivalence principle and the physical optics equivalence principle, in the spherical geometry. The deviation of image theorem approximation…
Measuring similarity between complex objects is a fundamental task in many scientific fields. When objects are represented as graphs, graph similarity/distance measures offer a powerful framework for quantifying structural resemblance.…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
It is hard to imagine curved spacetimes of General Relativity. A simple but powerful way how to achieve this is visualizing them via embedding diagrams of both ordinary geometry and optical reference geometry. They facilitate to gain an…
Optimal higher-order Sobolev type embeddings are shown to follow via isoperimetric inequalities. This establishes a higher-order analogue of a well-known link between first-order Sobolev embeddings and isoperimetric inequalities. Sobolev…
Timelike geodesics on a hyperplane orthogonal to the symmetry axis of the G\"odel spacetime appear to be elliptic-like if standard coordinates naturally adapted to the cylindrical symmetry are used. The orbit can then be suitably described…
Nontrivial isometric embeddings for flat metrics (i.e., those which are not just planes in the ambient space) can serve as useful tools in the description of gravity in the embedding gravity approach. Such embeddings can additionally be…
Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…
We extend the notion of the distance to a measure from Euclidean space to probability measures on general metric spaces as a way to do topological data analysis in a way that is robust to noise and outliers. We then give an efficient way to…
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…
We study sequences of conformal deformations of a smooth closed Riemannian manifold of dimension $n$, assuming uniform volume bounds and $L^{n/2}$ bounds on their scalar curvatures. Singularities may appear in the limit. Nevertheless, we…
Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance…
In the context of kernel methods, the similarity between data points is encoded by the kernel function which is often defined thanks to the Euclidean distance, a common example being the squared exponential kernel. Recently, other distances…
Conformal transformations of a Euclidean (complex) plane have some kind of completeness (sufficiency) for the solution of many mathematical and physical-mathematical problems formulated on this plane. There is no such completeness in the…
\emph{Scalable spaces} are simply connected compact manifolds or finite complexes whose real cohomology algebra embeds in their algebra of (flat) differential forms. This is a rational homotopy invariant property and all scalable spaces are…