We introduce the continuum self-similar tree (CSST) and characterize it topologically. We apply this to answer a question of Curien about the topology of the continuum random tree (CRT). We also give a topological characterization of other trees with branch points of finite or infinite valences.
On-device research index
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.
168,742 papers · 148 categories
Trend · papers per month
48 results for “topological similarity”
Topological parallax assesses AI models' geometric similarity to datasets for safety.
problem Ensuring AI models' robustness and safety in deep learning applications.
method Topological parallax compares a trained model to a reference dataset using Rips complexes and geodesic distortions.
result Topological parallax indicates whether a model shares similar multiscale geometric features with the dataset.
GNNs may be limited by graph topology, affecting their learning outcomes.
problem Understanding how graph topology influences GNN behavior and performance.
method Investigating the interaction between local topological features and GNN message-passing schemes.
result Locally similar neighborhoods can lead to consistent node representations, affecting GNN performance.
New algebraic structures for topological pairs.
problem No specific problem stated; generalization of knot quandles.
method Introducing multi-quandles for topological pairs.
result New algebraic structures for topological pairs.
Novel tRSA combines geometry and topology for brain and model analysis.
problem Traditional RSA overlooks topological information in neural representations.
method Topological RSA (tRSA) using nonlinear monotonic transforms.
result Robust model comparisons and novel insights into neural computation.
The two main theorems of this paper provide a characterization of hyperbolic affine iterated function systems defined on Rm. Atsushi Kameyama (Distances on Topological Self-Similar Sets, Proceedings of Symposia in Pure Mathematics, Volume 72.1, 2004) asked the following fundamental question: given a topological self-si…
This paper formalizes state similarity metrics for reinforcement learning.
problem Leveraging state similarity for reinforcement learning in continuous-state systems.
method Introducing a unified formalism for defining topologies through metrics.
result Established a hierarchy of metrics and demonstrated their theoretical implications.
In this paper, we study two classes of planar self-similar fractals with a shifting parameter . The first one is a class of self-similar tiles by shifting -coordinates of some digits. We give a detailed discussion on the disk-likeness ({\it i.e., the property of being a topological disk}…
To every oriented link , we associate a topologically defined biquandle , which we call the topological biquandle of . The construction of is similar to the topological description of the fundamental quandle given by Matveev. We find a presentation of the top…
Paper defines topology automaton for Barański carpets and proves Hölder equivalence conditions.
problem Tackles Hölder equivalence of Barański carpets.
method Defines topology automaton and applies method from previous studies.
result Obtains sufficient condition for Hölder equivalence of Barański carpets.
Unified toolkit for comparing neural representations using SRTD and NTS.
problem Heuristic asymmetry and unbounded scores in existing divergences.
method Developed SRTD and NTS to address these issues.
result Unified, robust, and scale-invariant metric for comparing neural representations.
We obtain two in a sense dual to each other results: First, that the capacity dimension of every compact, locally self-similar metric space coincides with the topological dimension, and second, that the asymptotic dimension of a metric space, which is asymptotically similar to its compact subspace coincides with the to…
Method quantifies disentanglement of generative models using manifold topology.
problem Challenging and inconsistent measurement of disentanglement in generative models.
method Measures topological similarity of conditional submanifolds in learned representation.
result Method ranks models similarly to existing methods across multiple datasets.
On the Learnability of Knot Invariants: Representation, Predictability, and Neural Similaritymath.GT
The study analyzes neural network predictions of knot invariants and finds that braid representations work best.
problem Understanding and predicting knot invariants using neural networks.
method Investigated different knot representations and invariants, proposed a cosine similarity score.
result Braid representations are best for predicting knot invariants, and some invariants are easier to learn than others.
A groupoid is a small category in which each morphism has an inverse. A topological groupoid is a groupoid in which both sets of objects and morphisms have topologies such that all groupoid structure maps are continuous. The notion of monodromy groupoid of a topological groupoid generalises those of fundamental groupoi…
Reproduces IVFS for high-dimensional data structure preservation.
problem Preserving high-dimensional data structure in unsupervised feature selection.
method Inspired by random subset method, IVFS maintains data similarity through topological structure.
result IVFS outperforms SPEC and MCFS on most datasets.
Topological normal generation proved for mapping class groups of certain surfaces.
problem Proving topological normal generation for mapping class groups of surfaces.
method Analyzing the end space of surfaces and using topological normal closure properties.
result Topological normal generation is equivalent to uniquely self-similar for surfaces with countable end space.
CantorNet tests geometric and topological complexity in neural networks.
problem Understanding self-similar patterns in neural networks.
method Inspired by Cantor set, CantorNet introduces novel complexity measures.
result CantorNet's decision boundaries are analytically known and can be arbitrarily ragged.
In the two parts of this paper we solve a problem of De Rham, proving that Reidemeister torsion invariants determine topological equivalence of linear G-representations, for G a finite cyclic group. Methods in controlled K-theory and surgery theory are developed to establish, and effectively calculate, a necessary and …
IVFS simplifies feature selection for high-dimensional data preservation.
problem Maintaining structure and pairwise distances in high-dimensional data.
method IVFS framework based on persistent diagrams from computational topology.
result IVFS well preserves pairwise distances and topological patterns of full data.
New method reduces clustering time and improves accuracy.
problem High time and space complexity in spectral clustering.
method Approximate spectral clustering using GNG network topology.
result Equal or better clustering performance than traditional SC.
A new topology design improves zero-shot classification performance in contrastive learning.
problem Improving zero-shot classification performance in contrastive visual-textual alignment.
method Proposed an alternative topology design using multiple class tokens and an oblique manifold with negative inner product.
result Improves zero-shot classification performance by an average of 6.1%.
We use a semisupervised learning algorithm based on a topological data analysis approach to assign functional categories to yeast proteins using similarity graphs. This new approach to analyzing biological networks yields results that are as good as or better than state of the art existing approaches.
The premier exhibition of the following phenomenon: The fundamental group of any Peano continuum constructed in similar fashion to the Hawaiian earring admits two natural distinct topological group structures. However despite being uncountable and regular, neither group is a Baire space and hence neither group admits a…
Understanding and Improving UMAP with Geometric and Topological Priors: The JORC-UMAP Algorithmcs.LG
JORC-UMAP improves UMAP by incorporating geometric and topological priors.
problem UMAP's local Euclidean distance assumption fails to capture intrinsic manifold geometry, leading to topological tearing and structural collapse.
method JORC-UMAP introduces Ollivier-Ricci curvature as a geometric prior and Jaccard similarity as a topological prior to reinforce edges and reduce redundant links.
result JORC-UMAP reduces tearing and collapse more effectively than standard UMAP and other DR methods, as measured by SVM accuracy and triplet preservation scores.
Let C_T be the subgroup of the smooth knot concordance group generated by topologically slice knots and let C_D be the subgroup generated by knots with trivial Alexander polynomial. We prove the quotient C_T/C_D is infinitely generated, and uncover similar structure in the 3-dimensional rational spin bordism group. Our…
In this paper, we propose a family of graph partition similarity measures that take the topology of the graph into account. These graph-aware measures are alternatives to using set partition similarity measures that are not specifically designed for graph partitions. The two types of measures, graph-aware and set parti…
Study evaluates synthetic data augmentation for small datasets, highlighting inconsistencies in traditional metrics.
problem Inconsistent validation of synthetic data generated for small sample sizes.
method Proposes a normalized Bottleneck distance metric to evaluate synthetic tabular data.
result Common metrics like propensity scoring and MMD fail for small datasets, showing instability and high variability.
We construct an explicit topological model (similar to the topological Springer fibers appearing in work of Khovanov and Russell) for every two-row Springer fiber associated with the even orthogonal group and prove that the respective topological model is homeomorphic to its corresponding Springer fiber. This confirms …
The topological complexity TC(X) is a numerical homotopy invariant of a topological space X which is motivated by robotics and is similar in spirit to the classical Lusternik-Schnirelmann category of X. Given a mechanical system with configuration space X, the invariant TC(X) measures the complexity of all possible mot…
New examples of degenerating metrics on R^4 found.
problem Degenerating Poincaré-Einstein metrics on R^4.
method Riemannian ansatz of Debever and Deimaniański, constructing families.
result Continuous families of metrics with cusps and unexpected degenerations.
Topologically Directed Simulations Reveal the Impact of Geometric Constraints on Knotted Proteinsmath.GT
Method optimizes knotting pathways in constrained polymers.
problem Understanding how geometric constraints affect knot formation in polymers.
method Topological steering using knotoid spectrum and mean unravelling number.
result Geometric constraints increase the frequency of twist knots in polymers.
Despite the obvious similarities between the metrics used in topological data analysis and those of optimal transport, an optimal-transport based formalism to study persistence diagrams and similar topological descriptors has yet to come. In this article, by considering the space of persistence diagrams as a space of d…
Recently, in the paper "Weight Agnostic Neural Networks" Gaier & Ha utilized architecture search to find networks where the topology completely encodes the knowledge. However, architecture search in topology space is expensive. We use the existing framework of binarized networks to find performant topologies by constra…
New algorithm detects community labels in networks using unlabeled data.
problem Detect community labels in networks with partially labeled data.
method Proposes an algorithm using structural similarity metrics.
result Theoretical guarantees for misclassification error.
We study the geometry and topology of Riemannian 3-orbifolds which are locally volume collapsed with respect to a curvature scale. We show that a sufficiently collapsed closed 3-orbifold without bad 2-suborbifolds either admits a metric of nonnegative sectional curvature or satisfies Thurston's Geometrization Conjectur…
This study examined how the correlation and network structure of 30 global indices and 145 local Korean indices belonging to the KOSPI 200 have changed during the 13-year period, 2000-2012. The correlations among the indices were calculated. The results showed that although the average correlations of the global indice…
A new method clusters complex networks using topological and geometric structure.
problem Clustering complex networks with intricate topology.
method Centroid-based clustering strategy using Wasserstein distance and barycenter for persistence barcodes.
result Demonstrated effectiveness on simulated and real-world networks.
New method uses cohomology to quantify molecular similarity.
problem Quantifying structural dissimilarity in molecular data.
method Gromov-Hausdorff ultrametric based on simplicial complexes and cohomology.
result Demonstrates effectiveness in clustering organic-inorganic halide perovskite structures.
ARTree uses deep learning to infer tree topologies efficiently.
problem Efficient phylogenetic inference from tree topologies.
method Deep autoregressive model based on graph neural networks (GNNs).
result ARTree provides a flexible family of distributions over tree topologies.
Paper improves SOMs for non-Euclidean data modeling.
problem Traditional SOMs assume Euclidean data, limiting their applicability.
method Introduces topology-related extensions to traditional SOM algorithm.
result Improves SOMs for non-Euclidean data, enhancing data modeling.
New integration theory on topological spaces, including fractals.
problem Developing a universal integration theory for arbitrary topological spaces.
method Introducing a new integration framework using unital magma valued functions and measures.
result Integration, differentiation, and orientation defined for arbitrary topological spaces.
This work generalizes a formula linking Seiberg-Witten prepotential and topological recursion.
problem Analyzing the relationship between Seiberg-Witten curves and topological recursion.
method Analytical approach using Seiberg-Witten family of curves.
result A generalized formula relating Seiberg-Witten prepotential to the genus zero part of topological recursion on a Seiberg-Witten curve.
It is known that all but finitely many leaves of a measured foliated 2-complex of thin type are quasi-isometric to an infinite tree with at most two topological ends. We show that if the foliation is cooriented, and the associated R-tree is self-similar, then a typical leaf has exactly one topological end. We also cons…
Study approximates top Lyapunov exponents for surface mapping classes.
problem Approximating topological Lyapunov exponents for surface mapping classes.
method Periodic approximation and joint spectral radius extension.
result Top Lyapunov exponents can be approximated by periodic orbits.
Given an integer and a digit set , there is a self-similar set satisfying the set equation: . We call such a fractal square. By studying a periodic extension , we classify into three types accordi…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a distance or similarity metric on the points, then look for highly connected subgra…
The paper studies Morse flows on 3-manifold boundaries with fixed points.
problem Classifying Morse flows on 3-manifold boundaries.
method Constructing a Pr-diagram as a topological invariant.
result A complete topological invariant of Morse flows on 3-manifold boundaries.