This article is the sequel to our previous paper [LS] dealing with the near-equality case of the Positive Mass Theorem. We study the near-equality case of the Penrose Inequality for the class of complete asymptotically flat rotationally symmetric Riemannian manifolds with nonnegative scalar curvature whose boundaries a…
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
New method relaxes TV distance for two-sample testing without distributional assumptions.
Study shows singular set of distance functions is delta-convex.
Research shows that certain metric spaces cannot contain rigid structures and provides evidence for loose embeddings into Euclidean spaces.
Define the 1-handle stabilization distance between two surfaces properly embedded in a fixed 4-dimensional manifold to be the minimal number of 1-handle stabilizations necessary for the surfaces to become ambiently isotopic. For every nonnegative integer we find a pair of 2-knots in the 4-sphere whose stabilization…
Lower bounds on Gordian distance using Blanchfield pairings.
Study proves inequality for hypersurfaces and shows almost extremals are close to Wulff shape.
We calculate the bridge distance for -bridge knots/links in the -sphere with sufficiently complicated -plat projections. In particular we show that if the underlying braid of the plat has rows of twists and all its exponents have absolute value greater than or equal to three then the distance of the b…
Boundary distances determine conformal metrics
A knot K in 1-bridge position with respect to a genus-g Heegaard surface in a 3-manifold can be moved by isotopy through knots in 1-bridge position until it lies in a union of n parallel genus-g surfaces tubed together by n-1 straight tubes, with K intersecting each tube in two arcs connecting the ends. We prove that t…
This work examines the sensitivity of energy distance to mean differences compared to covariance differences.
Logit distance bounds representational similarity of models.
New bounds for average graph distance using curvature and centrality.
We propose a new setting for testing properties of distributions while receiving samples from several distributions, but few samples per distribution. Given samples from distributions, , we design testers for the following problems: (1) Uniformity Testing: Testing whether all the 's are …
For time series comparisons, it has often been observed that z-score normalized Euclidean distances far outperform the unnormalized variant. In this paper we show that a z-score normalized, squared Euclidean Distance is, in fact, equal to a distance based on Pearson Correlation. This has profound impact on many distanc…
The paper introduces a new Wasserstein distance for approximating posteriors in inverse problems.
A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.
In this paper, we define a reduced distance function based at a point at the singular time of a Ricci flow. We also show the monotonicity of the corresponding reduced volume based at time T, with equality iff the Ricci flow is a gradient shrinking soliton. Our curvature bound assumption is more general than …
The concept of natural pseudo-distance has proven to be a powerful tool for measuring the dissimilarity between topological spaces endowed with continuous real-valued functions. Roughly speaking, the natural pseudo-distance is defined as the infimum of the change of the functions' values, when moving from one space to …
The paper presents new metrics to quantify and test for (i) the equality of distributions and (ii) the independence between two high-dimensional random vectors. We show that the energy distance based on the usual Euclidean distance cannot completely characterize the homogeneity of two high-dimensional distributions in …
On a complete, connected, locally compact, non-compact geodesic space , we assign each compact set a distance-like function. With the help of these functions, we obtain a pseudo-metric on the space of (non-empty) compact subsets of which is less than the Hausdorff distance. The quotient metric space is close…
New distances defined between space-times, proving some definite.
Let X, Y be the universal covers of two compact Riemannian manifolds (with dimension not equal to 4) with negative sectional curvature. Then every quasiisometry between them lies at a finite distance from a bilipschitz homeomorphism.
The main subject of this expository paper is a connection between Gromov's filling volumes and a boundary rigidity problem of determining a Riemannian metric in a compact domain by its boundary distance function. A fruitful approach is to represent Riemannian metrics by minimal surfaces in a Banach space and to prove r…
Exact 1-Wasserstein distance between location-scale distributions derived, with privacy effects studied.
In this paper we discuss some affine properties of convex equal-area polygons, which are convex polygons such that all triangles formed by three consecutive vertices have the same area. Besides being able to approximate closed convex smooth curves almost uniformly with respect to affine length, convex equal-area polygo…
Maps preserving Carathéodory distance between symmetric domains are rigid.
We show that the volume of a simple Riemannian metric on is locally monotone with respect to its boundary distance function. Namely if is a simple metric on and is sufficiently close to and induces boundary distances greater or equal to those of , then . Furthermor…
A new method using energy distance for ensemble and scenario reduction.
MultiDendrograms is a Java-written application that computes agglomerative hierarchical clusterings of data. Starting from a distances (or weights) matrix, MultiDendrograms is able to calculate its dendrograms using the most common agglomerative hierarchical clustering methods. The application implements a variable-gro…
The complex wave representation (CWR) converts unsigned 2D distance transforms into their corresponding wave functions. Here, the distance transform S(X) appears as the phase of the wave function φ(X)---specifically, φ(X)=exp(iS(X)/τwhere τis a free parameter. In this work, we prove a novel result using the higher-orde…
Completes the space of vector-valued one-forms on manifolds.
New unsupervised feature selection method for imbalanced datasets.
Solves curvature prescription on rotational surfaces.
Let be a compact Riemannian manifold with boundary. We show that is Gromov-Hausdorff close to a convex Euclidean region of the same dimension if the boundary distance function of is -close to that of . More generally, we prove the same result under the assumptions that the boundary distance func…
The distance of an almost constant mean curvature boundary from a finite family of disjoint tangent balls with equal radii is quantitatively controlled in terms of the oscillation of the scalar mean curvature. This result allows one to quantitatively describe the geometry of volume-constrained stationary sets in capill…
We investigate the use of Minimax distances to extract in a nonparametric way the features that capture the unknown underlying patterns and structures in the data. We develop a general-purpose and computationally efficient framework to employ Minimax distances with many machine learning methods that perform on numerica…
Nearest Neighbors Algorithm is a Lazy Learning Algorithm, in which the algorithm tries to approximate the predictions with the help of similar existing vectors in the training dataset. The predictions made by the K-Nearest Neighbors algorithm is based on averaging the target values of the spatial neighbors. The selecti…
Let and be simple Lie groups of equal real rank and real rank at least . Let and be non-uniform lattices. We prove a theorem that often implies that any quasi-isometric embedding of into is at bounded distance from a homomorphism. For example, any quasi-isometric embedding of $SL(n,\ma…
New measures generalize existing ones, linking information and risk.
Unified understanding of neural representation similarity measures.
To a closed Riemannian manifold, we associate a set of (special values of) a family of Dirichlet series, indexed by functions on the manifold. We study the meaning of equality of two such families of spectral Dirichlet series under pullback along a map. This allows us to give a spectral characterization of when a smoot…
Study on the cobordism distance between knots and their reverses.
Adding an unknot to any link equals its bridge number and meridional rank.
Causal KL improves on existing metrics for evaluating causal models.
Under the definition of Ricci curvature bounded below for Alexandrov spaces introduced by Zhang-Zhu, we generalize a result by Colding that an n dimentional manifold with Ricci curvature greater or equal to n minus 1 and volume close to that of the unit n sphere is close (in the Gromov-Hausdorff distance) to the sphere…
OLLA framework efficiently samples from constrained distributions with nonconvex constraints.
We study the pricing and hedging of derivative securities with uncertainty about the volatility of the underlying asset. Rather than taking all models from a prespecified class equally seriously, we penalise less plausible ones based on their "distance" to a reference local volatility model. In the limit for small unce…