Searcharxiv⌕ Search

arXiv subjects

Jürgen Jost

Publications and source records attributed to Jürgen Jost.

At least 19 recordsLinked to original sources

Efficient Decomposition of Forman-Ricci Curvature on Vietoris-Rips Complexes and Data Applications

Discrete Forman-Ricci curvature (FRC) is an efficient tool that characterizes essential geometrical features and associated transitions of real-world networks, extending seamlessly to higher-dimensional computations in simplicial complexes. In this article, we provide two major advancements: First, we give a decomposition for FRC that inhently allows a local computations of FRC. Second, we construct a set-theoretical proof enabling an efficient algorithms for the local computation of FRC in Vietoris-Rips (VR) complexes. Our findings open new avenues for geometric computations in VR complexes and highlight an essential yet under-explored aspect of data analysis and visualisation: the geometry underpinning statistical patterns.

math.GT↗

Fuzzy simplicial sets and their application to geometric data analysis

In this article, we expand upon the concepts introduced by David Spivak about the relationship between the category $\mathbf{UM}$ of uber metric spaces and the category $\mathbf{sFuz}$ of fuzzy simplicial sets. We show that fuzzy simplicial sets can be regarded as natural combinatorial generalizations of metric relations. Furthermore, we take inspiration from UMAP to apply the theory to manifold learning, dimension reduction and data visualization, while refining some of their constructions. We generalize the adjunction between $\mathbf{UM}$ and $\mathbf{sFuz}$, derive an explicit description of colimits in $\mathbf{UM}$, and show that $\mathbf{UM}$ can be embedded into $\mathbf{sFuz}$. Furthermore, we prove analogous results for the category of extended-pseudo metric spaces $\mathbf{EPMet}$. We also provide rigorous definitions of functors that make it possible to recursively merge sets of fuzzy simplicial sets and provide a description of the adjunctions between the category of truncated fuzzy simplicial sets and $\mathbf{sFuz}$, which we relate to persistent homology. Combining those constructions, we can show a surprising connection between the well-known dimension reduction methods UMAP and Isomap and derive an alternative algorithm, which we call IsUMap, that combines some of the strengths of both methods (source code on github). Additionally, we developed a new embedding method that allows to preserve clusters detected in the original metric space that we construct from the data. The visualization of the optimization process gives the user information both about the inner-cluster distributions in the original metric space and their inter-cluster relations. We compare our new method with UMAP, Isomap and t-SNE on a series of low- and high-dimensional datasets, demonstrate how our method improves upon them and provide explanations for observed differences.

math.AT↗

Geometry and Dress groups with non-symmetric cost functions

A metric relation by definition is symmetric. Since many data sets are non-symmetric, in this paper we develop a systematic theory of non-symmetric cost functions. Betweenness relations play an important role. We also introduce the notion of a Dress group in the non-symmetric setting and indicate a notion of curvature.

math.MG↗

Cheeger inequalities on simplicial complexes

Cheeger-type inequalities in which the decomposability of a graph and the spectral gap of its Laplacian mutually control each other play an important role in graph theory and network analysis, in particular in the context of expander theory. The natural problem to extend such inequalities to simplicial complexes and their higher order Eckmann Laplacians has been open for a long time. Before proving any inequality, however, one needs to identify the right Cheeger-type constant for which such an inequality can hold. Here, we solve this problem. Our solution involves and combines constructions from simplicial topology, signed graphs, Gromov filling radii and an interpolation between the standard 2-Laplacians and the analytically more difficult 1-Laplacians, for which, however, the inequalities become equalities. It is then natural to develop a general theory for $p$-Laplacians on simplicial complexes and investigate the related Cheeger-type inequalities.

math.CO↗

Strong Lyapunov functions for rough systems

We extend the Lyapunov function technique, a fundamental tool for investigating asymptotic stability and existence of attractors for ordinary differential equations, by introducing the notion of a {\it strong Lyapunov function} for an autonomous drift under stochastic perturbation driven by general Hölder-continuous multiplicative noise, not necessarily Brownian. The mathematical setting within which our method proceeds consists of rough path calculus and the framework of random dynamical systems. We conclude that if such a function exists for the drift then the perturbed system admits a global random pullback attractor that is upper semi-continuous w.r.t. the noise intensity coefficient and the dyadic approximation of the noise. Moreover, in case the drift is globally Lipschitz continuous, then there exists a numerical attractor for the discretization which is upper semi-continuous w.r.t. the noise intensity and converges to the continuous attractor as the step size tends to zero. Several applications, including dissipative systems, the pendulum, the FitzHugh-Nagumo neuro-system and the Lorenz system, demonstrate the power of our approach. We also prove that strong Lyapunov functions can be approximated in practice by Lyapunov neural networks.

math.DS↗

Probabilistic Foundations of Fuzzy Simplicial Sets for Nonlinear Dimensionality Reduction

Fuzzy simplicial sets have become an object of interest in dimensionality reduction and manifold learning, most prominently through their role in UMAP. However, their definition through tools from algebraic topology without a clear probabilistic interpretation detaches them from commonly used theoretical frameworks in those areas. In this work we introduce a framework that explains fuzzy simplicial sets as marginals of probability measures on simplicial sets. In particular, this perspective shows that the fuzzy weights of UMAP arise from a generative model that samples Vietoris-Rips filtrations at random scales, yielding cumulative distribution functions of pairwise distances. More generally, the framework connects fuzzy simplicial sets to probabilistic models on the face poset, clarifies the relation between Kullback-Leibler divergence and fuzzy cross-entropy in this setting, and recovers standard t-norms and t-conorms via Boolean operations on the underlying simplicial sets. We then show how new embedding methods may be derived from this framework and illustrate this on an example where we generalize UMAP using Čech filtrations with triplet sampling. In summary, this probabilistic viewpoint provides a unified probabilistic theoretical foundation for fuzzy simplicial sets, clarifies the role of UMAP within this framework, and enables the systematic derivation of new dimensionality reduction methods.

cs.LG↗

Curvature as a tool for evaluating dimensionality reduction and estimating intrinsic dimension

Utilizing recently developed abstract notions of sectional curvature, we introduce a method for constructing a curvature-based geometric profile of discrete metric spaces. The curvature concept that we use here captures the metric relations between triples of points and other points. More significantly, based on this curvature profile, we introduce a quantitative measure to evaluate the effectiveness of data representations, such as those produced by dimensionality reduction techniques. Furthermore, Our experiments demonstrate that this curvature-based analysis can be employed to estimate the intrinsic dimensionality of datasets. We use this to explore the large-scale geometry of empirical networks and to evaluate the effectiveness of dimensionality reduction techniques.

cs.CV↗

Non-coercive extortion in game theory

Commitments play a crucial role in game theory, shaping strategic interactions by either altering a player's own payoffs or influencing the incentives of others through outcome-contingent payments. While most research has focused on using commitments to achieve efficient equilibria, their potential applications beyond this goal remain largely unexplored. In this study, we introduce a non-coercive extortion mechanism that leverages commitments to outcome-contingent payments, demonstrating how a player or external agent can extract profit by offering rewards rather than threatening punishment. At the core of the mechanism is the introduction of sequentiality into a simultaneous-move game, fundamentally reshaping the strategic interaction. We derive the conditions under which extortion is successful, identify the class of games susceptible to this scheme, and determine both the maximum extractable profit and the minimum required payment. To illustrate the extortion mechanism, we apply it to 2x2 games, highlighting how even simple strategic settings can be vulnerable to this form of manipulation. Our results reveal strategic vulnerabilities in competitive settings, with significant implications for economic markets, diplomatic relations, and multi-agent systems operating in blockchain environments. This work broadens our understanding of commitments in game theory and raises critical questions about how to safeguard strategic interactions from exploitation through non-coercive extortion.

cs.GT↗

Merging Hazy Sets with m-Schemes: A Geometric Approach to Data Visualization

Many machine learning algorithms try to visualize high dimensional metric data in 2D in such a way that the essential geometric and topological features of the data are highlighted. In this paper, we introduce a framework for aggregating dissimilarity functions that arise from locally adjusting a metric through density-aware normalization, as employed in the IsUMap method. We formalize these approaches as m-schemes, a class of methods closely related to t-norms and t-conorms in probabilistic metrics, as well as to composition laws in information theory. These m-schemes provide a flexible and theoretically grounded approach to refining distance-based embeddings.

cs.LG↗

Uniqueness of Dirac-harmonic maps from a compact surface with boundary

As a commutative version of the supersymmetric nonlinear sigma model, Dirac-harmonic maps from Riemann surfaces were introduced fifteen years ago. They are critical points of an unbounded conformally invariant functional involving two fields, a map from a Riemann surface into a Riemannian manifold and a section of a Dirac bundle which is the usual spinor bundle twisted with the pull-back of the tangent bundle of the target by the map. As solutions to a coupled nonlinear elliptic system, the existence and regularity theory of Dirac-harmonic maps has already received much attention, while the general uniqueness theory has not been established yet. For uncoupled Dirac-harmonic maps, the map components are harmonic maps. Since the uniqueness theory of harmonic maps from a compact surface with boundary is known, it is sufficient to consider the uniqueness of the spinor components, which are solutions to the corresponding boundary value problems for a nonlinear Dirac equation. In particular, when the map components belong to $W^{1,p}$ with $p>2$, the spinor components are uniquely determined by boundary values and map components. For coupled Dirac-harmonic maps, the map components are not harmonic maps. So the uniqueness problem is more difficult to solve. In this paper, we study the uniqueness problem on a compact surface with boundary. More precisely, we prove the energy convexity for weakly Dirac-harmonic maps from the unit disk with small energy. This yields the first uniqueness result about Dirac-harmonic maps from a surface conformal to the unit disk with small energy and arbitrary boundary values.

math.AP↗

Dirac-harmonic maps with trivial index

For a homotopy class $[u]$ of maps between a closed Riemannian manifold $M$ and a general manifold $N$, we want to find a Dirac-harmonic map with the map component in the given homotopy class. Most known results require the index to be nontrivial. When the index is trivial, the few known results are all constructive and produce uncoupled solutions. In this paper, we define a new quantity. As a byproduct of proving the homotopy invariance of this new quantity, we find a new simple proof for the fact that all Dirac-harmonic spheres in surfaces are uncoupled. More importantly, by using the homotopy invariance of this new quantity, we prove the existence of Dirac-harmonic maps from manifolds in the trivial index case. In particular, when the domain is a closed Riemann surface, we prove the short-time existence of the $α$-Dirac-harmonic map flow in the trivial index case. Together with the density of the minimal kernel, we get an existence result for Dirac-harmonic maps from closed Riemann surfaces to Kähler manifolds, which extends the previous result of the first and third authors. This establishes a general existence theory for Dirac-harmonic maps in the context of trivial index.

math.DG↗

Floer Homology: From Generalized Morse-Smale Dynamical Systems to Forman's Combinatorial Vector Fields

We construct a Floer type boundary operator for generalised Morse-Smale dynamical systems on compact smooth manifolds by counting the number of suitable flow lines between closed (both homoclinic and periodic) orbits and isolated critical points. The same principle works for the discrete situation of general combinatorial vector fields, defined by Forman, on CW complexes. We can thus recover the $\mathbb{Z}_2$ homology of both smooth and discrete structures directly from the flow lines (V-paths) of our vector field.

math.DS↗

A mathematical model for cognitive structures and processes underlying innovations

Business innovations are often arising from new combinations of pre-existing systems into new ones, coherently assembling features from their sources. We propose an abstract mathematical concept from category theory, the presheaf, to efficiently represent such coherent feature combinations. Moreover, operations on presheaves will allow us to formally describe and analyze business innovations that arise from novel mergings of systems from different domains. Equipped with such tools we provide an example by analyzing a successful case of such type of recombinant innovation, the digital hub concept proposed by Steve Jobs. The example shows how our framework can be used to bring formal rigor while preserving a fundamentally qualitative reasoning style.

econ.GN↗

Exploring the space of graphs with fixed discrete curvatures

Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks across a wide range of domains. In this work, we consider the problem of constructing graphs with a prescribed set of discrete edge curvatures, and explore the space of such graphs. We address this problem in two ways: first, we develop an evolutionary algorithm to sample graphs with discrete curvatures close to a given set. We use this algorithm to explore how other network statistics vary when constrained by the discrete curvatures in the network. Second, we solve the exact reconstruction problem for the specific case of Forman-Ricci curvature. By leveraging the theory of Markov bases, we obtain a finite set of rewiring moves that connects the space of all graphs with a fixed discrete curvature.

physics.soc-ph↗

IsUMap: Manifold Learning and Data Visualization leveraging Vietoris-Rips filtrations

This work introduces IsUMap, a novel manifold learning technique that enhances data representation by integrating aspects of UMAP and Isomap with Vietoris-Rips filtrations. We present a systematic and detailed construction of a metric representation for locally distorted metric spaces that captures complex data structures more accurately than the previous schemes. Our approach addresses limitations in existing methods by accommodating non-uniform data distributions and intricate local geometries. We validate its performance through extensive experiments on examples of various geometric objects and benchmark real-world datasets, demonstrating significant improvements in representation quality.

cs.LG↗

Cohomological field theories and generalized Seiberg-Witten equations

We introduce a formalism for constructing cohomological field theories (CohFT) out of nonlinear PDEs based on the first author's previous work (arXiv:2202.12425). We apply the formalism to the generalized Seiberg-Witten equations and show that the obtained CohFT functionals agree with the existing ones proposed by physicists. This leads to a unified perspective from which to view the full supersymmetric functionals of the Donaldson-Witten, Seiberg-Witten, and Kapustin-Witten theories and understand the relations between them. We also outline a quantization program for our framework and discuss its potential to produce manifold invariants and quantum cohomologies.

math-ph↗