Related papers: Chain development of metric compacts

Twisted permutation codes, introduced recently by the second and third authors, are frequency permutation arrays. They are similar to repetition permutation codes, in that they are obtained by a repetition construction applied to a smaller…

We prove a new inequality controlling the large deviations of the empirical measure of a Markov chain. This inequality is based on the martingale used by Donsker and Varadhan and the minimax theorem. It holds for convex sets and it requires…

When are two collider events similar? Despite the simplicity and generality of this question, there is no established notion of the distance between two events. To address this question, we develop a metric for the space of collider events…

A metric space $X$ is {\em injective} if every non-expanding map $f:B\to X$ defined on a subspace $B$ of a metric space $A$ can be extended to a non-expanding map $\bar f:A\to X$. We prove that a metric space $X$ is a Lipschitz image of an…

Understanding distance metrics in high-dimensional spaces is crucial for various fields such as data analysis, machine learning, and optimization. The Manhattan distance, a fundamental metric in multi-dimensional settings, measures the…

There is a natural intuition that, given a large $n$, the distributions of small segments of a randomly sampled polygonal chain and those of a randomly sampled closed polygonal chain (drawn from the subspace measure of course), should be…

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

The tight span, or injective envelope, is an elegant and useful construction that takes a metric space and returns the smallest hyperconvex space into which it can be embedded. The concept has stimulated a large body of theory and has…

In the context of (not necessarily minimal) actions, we consider the mean diameter and use it to characterize regular factor maps. Building on this characterization, we prove that an action is diam-mean equicontinuous if and only if it is a…

We investigate a relations of almost isometric embedding and almost isometry between metric spaces and prove that with respect to these relations: (1) There is a countable universal metric space. (2) There may exist fewer than continuum…

The shortest-path, commute time, and diffusion distances on undirected graphs have been widely employed in applications such as dimensionality reduction, link prediction, and trip planning. Increasingly, there is interest in using…

In this note, we describe some of the progress recently made on questions regarding the chemical distance in two-dimensional critical percolation by the author, J. Hanson, and P. Sosoe [6, 7]. It is expected that the distance between points…

The conventional definition of a topological metric over a space specifies properties that must be obeyed by any measure of "how separated" two points in that space are. Here it is shown how to extend that definition, and in particular the…

Biological systems can rely on collective formation of a metachronal wave in an ensemble of oscillators for locomotion and for fluid transport. We consider one-dimensional chains of phase oscillators with nearest neighbor interactions,…

A symmetry classification of possible interactions in a diatomic molecular chain is provided. For nonlinear interactions the group of Lie point transformations, leaving the lattice invariant and taking solutions into solutions, is at most…

It is a well known open problem if, in ZFC, each compact space with a small diagonal is metrizable. We explore properties of compact spaces with a small diagonal using elementary chains of submodels. We prove that ccc subspaces of such…

Let (X,d) be a finite metric space. This paper first discusses the spectrum of the p-distance matrix of a finite metric space of p-negative type and then gives upper and lower bounds for the so called gap of a finite metric space of strict…

A common way to quantify the ,,distance'' between measures is via their discrepancy, also known as maximum mean discrepancy (MMD). Discrepancies are related to Sinkhorn divergences $S_\varepsilon$ with appropriate cost functions as…

We are interested in a fragmentation process. We observe fragments frozen when their sizes are less than {\epsilon} ({\epsilon} > 0). It is known ([BM05]) that the empirical measure of these fragments converges in law, under some…

A distance measure is presented between two unitary propagators of quantum systems of differing dimensions along with a corresponding method of computation. A typical application is to compare the propagator of the actual (real) process…