Related papers: Chain development of metric compacts
In this paper, we propose a metric on the space of finite sets of trajectories for assessing multi-target tracking algorithms in a mathematically sound way. The main use of the metric is to compare estimates of trajectories from different…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…
We introduce the notion of dynamical metric order of a continuous map on a compact metric space, study its basic properties, and compute it for several classes of maps. This concept which is a counterpart of the metric mean dimension with…
What distributions arise as the distribution of the distance between two typical points in some measured metric space? This seems to be a surprisingly subtle problem. We conjecture that every distribution with a density function whose…
An expander code is a binary linear code whose parity-check matrix is the bi-adjacency matrix of a bipartite expander graph. We provide a new formula for the minimum distance of such codes. We also provide a new proof of the result that…
Material microstructures are traditionally compared using sets of statistical measures that are incomplete, e.g., two visually distinct microstructures can have identical grain size distributions and phase fractions. While this is not a…
We study the dynamics of the metrics generated by measure preserving transformations. We consider a sequence of average metrics and define the corresponding sequence of $\epsilon$-entropies ({\it scaling sequence}) of the measure with…
The continuous limit of large systems of particles of finite size on the line is described. The particles are assumed to move freely and stick under collision, to form compound particles whose mass and size is the sum of the masses and…
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…
Measuring device is proposed for determining a linear dimension. The device comprises three associated longitudinally moving parts one of which is a scale. The integer part of the device reading is being taken from the standard millimeter…
We first prove that for every metrizable space $X$, for every closed subset $F$ whose complement is zero-dimensional, the space $X$ can be embedded into a product space of the closed subset $F$ and a metrizable zero-dimensional space as a…
Motivated by Leinster-Cobbold measures of biodiversity, the notion of the spread of a finite metric space is introduced. This is related to Leinster's magnitude of a metric space. Spread is generalized to infinite metric spaces equipped…
A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…
Selection of descent direction at a point plays an important role in numerical optimization for minimizing a real valued function. In this article, a descent sequence is generated for the functions with bounded parameters to obtain a…
We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of…
We map the conformation space of a simple lattice polymer chain to a network, where (i) the vertices of the network have a one-to-one correspondence to the conformations of the chain, and (ii) a link between two vertices indicates the…
We consider finite point subsets (distributions) in compact metric spaces. Non-trivial bounds for sums of distances between points of distributions and for discrepancies of distributions in metric balls are given in the case of general…
We recall the definition of an r-maximal set in a metric space as a maximal subset of diameter r. In the special case when the metric space is Euclidean such a set is exactly a solid of constant diameter r. In the process of reviewing the…
The paper studies a general scheme for constructing metrics on a product of metric spaces by means of a family of continuous convex functions. This construction includes the conventional $p$-metrics and generates metrics that are…
A compact metric space $(X, \rho)$ is given. Let $\mu$ be a Borel measure on $X$. By $r$-cluster we mean a measurable subset of $X$ with diameter at most $r$. A family of $k$ $2r$-clusters is called a $r$-cluster structure of order $k$ if…