Related papers: Chain development of metric compacts
Important data mining problems such as nearest-neighbor search and clustering admit theoretical guarantees when restricted to objects embedded in a metric space. Graphs are ubiquitous, and clustering and classification over graphs arise in…
What is the dimension of a network? Here, we view it as the smallest dimension of Euclidean space into which nodes can be embedded so that pairwise distances accurately reflect the connectivity structure. We show that a recently proposed…
Diversities are a generalization of metric spaces, where instead of the non-negative function being defined on pairs of points, it is defined on arbitrary finite sets of points. Diversities have a well-developed theory. This includes the…
Guided by the theory of graph limits, we investigate a variant of the cut metric for limit objects of sequences of discrete probability distributions. Apart from establishing basic results, we introduce a natural operation called {\em…
The {\em metric dimension} of a graph $\Gamma$ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph…
We prove a generalisation of the $\epsilon$-property, namely that for any dimension and signature, a metric which is not characterised by its polynomial scalar curvature invariants, there is a frame such that the components of the curvature…
We give a metric characterization of snowflakes of Euclidean spaces. Namely, a metric space is isometric to $\mathbb R^n$ equipped with a distance $(d_{\rm E})^\epsilon$, for some $n\in \mathbb N_0$ and $\epsilon\in (0,1]$, where $d_{\rm…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…
We seek for lines of minimal distance to finitely many points in the plane. The distance between a line and a set of points is defined by the L^p-norm, 1\leq p\leq \infty, of the vector of vertical or orthogonal distances from the single…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. The…
We use persistent homology in order to define a family of fractal dimensions, denoted $\mathrm{dim}_{\mathrm{PH}}^i(\mu)$ for each homological dimension $i\ge 0$, assigned to a probability measure $\mu$ on a metric space. The case of…
We introduce the concept of entanglement width as measure of the spatial distribution of entanglement in multiparticle systems. We develop criteria to detect the width of entanglement using global observables such as energy and magnetic…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
In many interacting particle systems, relaxation to equilibrium is thought to occur via the growth of 'droplets', and it is a question of fundamental importance to determine the critical length at which such droplets appear. In this paper…
Consider an infinite collection of qubits arranged in a line, such that every pair of nearest neighbors is entangled: an "entangled chain." In this paper we consider entangled chains with translational invariance and ask how large one can…
We develop a general framework for reasoning about distances between transition systems with quantitative information. Taking as starting point an arbitrary distance on system traces, we show how this leads to natural definitions of a…
This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued…
My means of extensive Monte Carlo simulations the mean radius of gyration and the end-to-end distance are calculated for a single chain in a solvent over a broad range of volume fractions, pressures and temperatures. Our results indicate…
A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric, compute the cardinality of a sphere…