Related papers: Topological computing of arrangements with (co)cha…
A textile structure is a periodic arrangement of threads in the thickened plane. A topological classification of textile structures is harder than for classical knots and links that are non-periodic and restricted to a bounded region. The…
In computer vision and medical imaging, the problem of matching structures finds numerous applications from automatic annotation to data reconstruction. The data however, while corresponding to the same anatomy, are often very different in…
This is a brief introduction to the basic concepts of topology. It includes the basic constructions, discusses separation properties, metric and pseudometric spaces, and gives some applications arising from the use of topology in computing.
Topological data analysis is a relatively new branch of machine learning that excels in studying high dimensional data, and is theoretically known to be robust against noise. Meanwhile, data objects with mixed numeric and categorical…
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation when processing graphs on a parallel computer. When a topology of a distributed system is known an important task…
Here we investigate the connection between topological order and the geometric entanglement, as measured by the logarithm of the overlap between a given state and its closest product state of blocks. We do this for a variety of…
The concept of $typed$ $topology$ is introduced. In a typed topological space, some open sets are assigned "types", and topological concepts such as closure, connectedness can be defined using types. A finite data set in $R^2$ is a…
Directed Algebraic Topology studies spaces equipped with a form of direction, to include models of non-reversible processes. In the present extension we also want to cover critical processes, indecomposable and unstoppable. The previous…
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…
This paper introduces and demonstrates a computational pipeline for the statistical analysis of shape graph datasets, namely geometric networks embedded in 2D or 3D spaces. Unlike traditional abstract graphs, our purpose is not only to…
Topological methods have the potential of exploring data clouds without making assumptions on their the structure. Here we propose a hierarchical topological clustering algorithm that can be implemented with any distance choice. The…
Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks, as defined by the topology and edge weights, determines how efficiently the networks perform their function.…
This paper presents a mathematical framework for analyzing machine learning models through the geometry of their induced partitions. By representing partitions as Riemannian simplicial complexes, we capture not only adjacency relationships…
Topology, a mathematical concept, has recently become a popular and truly transdisciplinary topic encompassing condensed matter physics, solid state chemistry, and materials science. Since there is a direct connection between real space,…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
Many standard structural quantities, such as order parameters and correlation functions, exist for common condensed matter systems, such as spherical and rod-like particles. However, these structural quantities are often insufficient for…
Geometric computing with chain complexes allows for the computation of the whole chain of linear spaces and (co)boundary operators generated by a space decomposition into a cell complex. The space decomposition is stored and handled with…
In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as 1D and 2D interval and rectangle K-centers. All the…
We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell…
The study of topological information of spatial objects has for a long time been a focus of research in disciplines like computational geometry, spatial reasoning, cognitive science, and robotics. While the majority of these researches…