Study geometric flows with varying parameters and prove continuous dependence.
problem Continuous dependence of flows on parameters in geometric settings.
method Derived suitable topologies for vector fields and flows, proved new continuous dependence.
result Proved continuous dependence of flows on parameters in a general topological space.
Topological data analysis and its main method, persistent homology, provide a toolkit for computing topological information of high-dimensional and noisy data sets. Kernels for one-parameter persistent homology have been established to connect persistent homology with machine learning techniques. We contribute a kernel…
TopoFisher learns topological summaries by maximizing Fisher information, improving parameter efficiency and inference quality.
problem Simulation-based inference misses key information in low-order statistics, especially for non-Gaussian fields.
method TopoFisher uses a differentiable persistent-homology pipeline that learns topological summaries by maximizing local Gaussian Fisher information.
result TopoFisher recovers much of the available information and outperforms fixed topological vectorizations in weak gravitational lensing.
The paper explores the geometry and topology of DNN decision boundaries.
problem Understanding the geometric and topological properties of DNN decision boundaries.
method Differential geometry and the Gauss-Bonnet-Chern theorem.
result Computed the Euler characteristics of compact decision boundaries.
New research shows sparse topologies can lead to faster convergence in distributed optimization.
problem The impact of worker communication topology on convergence speed in distributed optimization.
method Consensus-based distributed optimization methods with local averaging and correction based on local data.
result Sparse topologies can lead to faster convergence in distributed optimization without communication delays.
Algorithm calculates quantum invariants of 3-manifolds with polynomial time complexity.
problem Computing quantum invariants from Tambara-Yamagami categories is #P-hard.
method Fixed-parameter tractable algorithm with first Betti number as parameter.
result Existence of FPT algorithm for Tambara-Yamagami invariants.
Generically, topological insulators have conical points leading to Dirac-like currents.
problem Understanding the conical structure of degeneracies in topological phases of matter.
method Analyzing Hermitian matrices with three parameters to show conical points.
result Adiabatic deformations of topological insulators result in Dirac-like currents whose total conductivity equals the chiral number of conical points.
Paper uses diffusion models to design electric aircraft quickly.
problem Designing electric aircraft efficiently and accurately.
method Simulation-based inference with hierarchical diffusion models.
result Rediscovers known aircraft design trends and laws.
A novel decentralized deep learning algorithm using gradient-based optimization.
problem Decentralized deep learning in networked systems without a central server.
method Heavy-ball acceleration method and consensus protocol for model and gradient-momentum sharing.
result The proposed algorithm outperforms competing methods in various communication topologies.
While a wide range of interpretable generative procedures for graphs exist, matching observed graph topologies with such procedures and choices for its parameters remains an open problem. Devising generative models that closely reproduce real-world graphs requires domain knowledge and time-consuming simulation. While e…
We study the volume growth of hyperkaehler manifolds of type A∞ constructed by Anderson-Kronheimer-LeBrun and Goto. These are noncompact complete 4-dimensional hyperkaehler manifolds of infinite topological type. These manifolds have the same topology but the hyperkaehler metrics are depends on the choice of …
Enhanced binary classifier uses Urysohn's Lemma of Topology.
problem Binary classification challenges.
method Utilizes Urysohn's Lemma of Topology to construct separating functions.
result Exceptional performance in numerical experiments (95% to 100%).
We claim that HOMFLY polynomials for virtual knots, defined with the help of the matrix-model recursion relations, contain more parameters, than just the usual q and A=qN. These parameters preserve topological invariance and do not show up in the case of ordinary (non-virtual) knots and links. They are most conv…
We introduce Graphical TREX (GTREX), a novel method for graph estimation in high-dimensional Gaussian graphical models. By conducting neighborhood selection with TREX, GTREX avoids tuning parameters and is adaptive to the graph topology. We compare GTREX with standard methods on a new simulation set-up that is designed…
Paper introduces stable vectorization for multiparameter PH using signed barcodes.
problem Lack of stable vectorization methods for multiparameter persistent homology.
method Signed barcodes as measures for stable vectorization of MPH.
result Stable feature vectors from signed barcodes improve performance in data science.
A new Mapper algorithm optimizes data visualization through automatic parameter tuning.
problem Manual parameter tuning and fixed intervals limit the performance of the standard Mapper algorithm.
method Introduces a soft Mapper framework based on Gaussian mixture models for automatic interval construction and optimization via stochastic gradient descent.
result Demonstrates effectiveness in capturing underlying topological structures and identifying distinct subgroups.
Quantum phase diagrams for Chern topological insulators show jumps at critical loci.
problem Understanding phase transitions in Chern topological insulators.
method Mathematical formulation and explicit families of physical systems.
result Synthetic design of arbitrary Chern jumps in topological phases.
Study topological invariants of complexes for Riemannian manifolds.
problem Understanding topological properties of Riemannian manifolds.
method Analyzing Betti numbers and Euler characteristic of Vietoris-Rips and Čech complexes.
result Betti curve converges to manifold's Betti number within a scale parameter interval.
A new method for optimal filtration learning in time-series data analysis.
problem Finding an optimal filtration for analyzing topological properties of discrete data.
method Formulated an optimization problem and proposed an algorithm for solving it.
result Derivation of the exact formula of the gradient of the loss function with respect to filtration parameters.
A new approach uses circuit topology to study complex polymer interactions.
problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.
Bounding shears in ideal triangulations on hyperbolic surfaces.
problem Bounding shears in ideal triangulations on hyperbolic surfaces.
method Showing an ideal triangulation with bounded shear parameters on hyperbolic surfaces.
result An upper bound on shear parameters depends logarithmically on the surface's topology.
In this article, we introduce a fixed parameter tractable algorithm for computing the Turaev-Viro invariants TV(4,q), using the dimension of the first homology group of the manifold as parameter. This is, to our knowledge, the first parameterised algorithm in computational 3-manifold topology using a topological parame…
RCLA reduces noise in topological data analysis, preserving essential structure.
problem Noise in large datasets obscures topological features in persistent homology.
method Grid-based RCLA integrates data reduction and denoising with a threshold parameter.
result RCLA provides a theoretical guarantee and automatic parameter selection.
The paper characterizes the geometry and topology of spin random fields.
problem Understanding the expected geometry and topology of spin random fields.
method Investigating the asymptotic behavior of geometric and topological functionals for spin random fields under scaling assumptions.
result Explicit results for monochromatic fields, showing non-universal asymptotic behavior and new generalized models.
In this paper, we study two classes of planar self-similar fractals Tε with a shifting parameter ε. The first one is a class of self-similar tiles by shifting x-coordinates of some digits. We give a detailed discussion on the disk-likeness ({\it i.e., the property of being a topological disk}…
AuToMATo clusters data without tuning parameters, outperforming others.
problem Clustering data efficiently and without manual tuning.
method Combines ToMATo with bootstrapping for density estimation.
result Performs well across various clustering algorithms and applications.
We address the issue of estimating the topology and dynamics of sparse linear dynamic networks in a hyperparameter-free setting. We propose a method to estimate the network dynamics in a computationally efficient and parameter tuning-free iterative framework known as SPICE (Sparse Iterative Covariance Estimation). The …
Recently the first author studied the bifurcation of critical points of families of functionals on a Hilbert space, which are parametrised by a compact and orientable manifold having a non-vanishing first integral cohomology group. We improve this result in two directions: topologically and analytically. From the analy…
Study volumes of Klein surfaces, extending Mirzakhani's recursion.
problem Volumes of moduli spaces of bordered Klein surfaces.
method Generalization of Mirzakhani's recursion, integration over regularised moduli space.
result Explicit formula for Klein bottle moduli space volumes, recursion for arbitrary topologies.
The abstract discusses fiber sum formulas for 4-manifolds using topological modular forms.
problem Understanding fiber sum formulas for 4-manifolds.
method Using the connection between 4-manifolds and topological modular forms from 6d (1,0) SCFTs.
result Even free theories exhibit nontrivial fiber sum formulas, sensitive to individual theories and parameters.
Develops 2-categorical methods for multi-parameter persistence.
problem Fundamental limitations of traditional persistence modules.
method 2-categorical structures to capture hierarchical interactions.
result New invariants effectively characterize multidimensional topological features.
New framework distinguishes lung cancer subtypes using MALDI mass spectrometry.
problem Distinguishing between adenocarcinoma and squamous cell carcinoma subtypes in lung cancer.
method Supervised topological data analysis on MALDI mass spectrometry imaging data.
result The proposed framework successfully classifies lung cancer subtypes with competitive results.
Study cohomogeneity one expanding Ricci solitons on specific topologies.
problem Characterize and analyze cohomogeneity one expanding Ricci solitons.
method Analyze ODEs, define expander degree, calculate cohomogeneity one expander degree.
result Reconstruct and calculate cohomogeneity one expander degree for specific topologies.
Enhanced neural network framework improves constraint satisfaction with topological conditioning.
problem Maintaining semantic coherence while satisfying physical and logical constraints in neuro-symbolic reasoning.
method Integrates topological conditioning with gradient stabilization mechanisms using Forman-Ricci curvature, Deep Delta Learning, and Covariance Matrix Adaptation Evolution Strategy.
result Achieves mean energy reduction to 1.15 compared to baseline values of 11.68, with 95 percent success rate.
Paper improves tree probability estimation using stochastic optimization and variance reduction.
problem Improving tree probability estimation in phylogenetic inference.
method Introduces computationally efficient methods for training SBNs and variance reduction for optimization.
result Methods outperform previous baseline methods in tree topology probability estimation and Bayesian phylogenetic inference.
Topological method detects Hopf bifurcations from time series.
problem Detecting Hopf bifurcations in nonlinear systems from time series data.
method Persistent homology applied to Takens embedding for phase space reconstructions.
result A simple scalar topological functional identifies critical bifurcation points.
In recent years there has been noticeable interest in the study of the "shape of data". Among the many ways a "shape" could be defined, topology is the most general one, as it describes an object in terms of its connectivity structure: connected components (topological features of dimension 0), cycles (features of dime…
Finding an optimal parameter of a black-box function is important for searching stable material structures and finding optimal neural network structures, and Bayesian optimization algorithms are widely used for the purpose. However, most of existing Bayesian optimization algorithms can only handle vector data and canno…
Bayesian networks are typically faithful, with implications for causal inference.
problem Determining the typicality of faithfulness in Bayesian networks.
method Analysis of Bayesian networks over a given DAG, parametrized by conditional exponential families, and nonparametric conditional densities.
result The faithful Bayesian networks are dense and open with respect to the total variation metric, extending existing results for specific classes of Bayesian networks.
In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of thin position for 3-manifolds, play an important role when studying algorithmic …
We study symmetric minimal surfaces in the three-dimensional Heisenberg group Nil3 using the generalized Weierstrass type representation, the so-called loop group method. In particular, we will discuss how to construct minimal surfaces in Nil3 with non-trivial topology. Moreover, we will classif…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an exponential-time enumeration. However, asymptotically most graphs do not result in …
The paper examines compactifications of Poincaré-Einstein manifolds and their convergence properties.
problem Compactification of conformally compact Poincaré-Einstein manifolds.
method Analyzes two types of compactifications and proves convergence in specific topologies.
result Compactness of compactifications is determined by scalar curvature and topological parameters.
Improves decentralized learning by teleporting active nodes for better convergence.
problem Decentralized learning's convergence rate degrades with large node numbers.
method Activates a subset of nodes, fetches parameters from previous active nodes, updates, and performs gossip averaging on a small topology.
result Teleportation completely alleviates convergence rate degradation with proper node activation.
We discuss the concept of the shadow boundary of a centrally symmetric convex ball K (actually being the unit ball of a Minkowski normed space) with respect to a direction x of the Euclidean n-space Rn. We introduce the concept of general parameter spheres of K corresponding to this direction and prove t…
We describe how to compute topological objects associated to a polynomial map of several complex variables with isolated singularities. These objects are: the affine critical values, the affine Milnor numbers for all irregular fibers, the critical values at infinity, and the Milnor numbers at infinity for all irregular…
Paper constructs hyperbolic metrics using circle packings and curvature parameters.
problem Creating polyhedral metrics for surfaces of various topologies.
method Using circle packings and curvature parameters, the paper constructs hyperbolic polyhedral metrics.
result Unified approach to producing polyhedral metrics for surfaces of broader topological types.
This paper introduces a new metric for deep learning networks based on their classification performance.
problem The mystery and black-box nature of deep learning networks.
method Proposes a new distance measure based on the probabilistic performance of deep learning networks.
result The proposed metric space is compact and coincides with the quotient topological space.