Related papers: Homology groups for particles on one-connected gra…
We investigate the self-organization of point-particles with short-range interactions modeled via simple 1D and 2D Hubbard-like models. We show how various properties emerge such as, boson-like ordering leading to topological structures in…
The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…
In these lecture notes we discuss a body of work in which Morse theory is used to construct various homology and cohomology operations. In the classical setting of algebraic topology this is done by constructing a moduli space of graph…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…
We study clustering properties of networks of single integrator nodes over a directed graph, in which the nodes converge to steady-state values. These values define clustering groups of nodes, which depend on interaction topology, edge…
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…
Such modern applications of topology as data analysis and digital image analysis have to deal with noise and other uncertainty. In this environment, topological spaces often appear equipped with a real valued function. Persistence is a…
We introduce ordered and unordered configuration spaces of 'clusters' of points in an Euclidean space $\mathbb{R}^d$, where points in each cluster satisfy a 'verticality' condition, depending on a decomposition $d=p+q$. We compute the…
This paper develops a basic theory of H-groups. We introduce a special quotient of H-groups and extend some algebraic constructions of topological groups to the category of H-groups and H-maps. We use these constructions to prove some…
Given a finite graph G and a topological space Z, the graphical configuration space Conf(G, Z) is the space of functions V(G) -> Z so that adjacent vertices map to distinct points. We provide a homotopy decomposition of Conf(G, X x Y) in…
This paper is mainly a semi-tutorial introduction to elementary algebraic topology and its applications to Ising-type models of statistical physics, using graphical models of linear and group codes. It contains new material on systematic…
We continue our investigation of spaces of long embeddings (long embeddings are high-dimensional analogues of long knots). In previous work we showed that when the dimensions are in the stable range, the rational homology groups of these…
In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…
This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent…
We construct a spectral sequence converging to the Morava $E$-theory of unordered configuration spaces and identify its E$^2$-page as the homology of a Chevalley-Eilenberg-like complex for Hecke Lie algebras. Based on this, we compute the…
We give a concrete method to explicitly compute the rational cohomology of the unordered configuration spaces of connected, oriented, closed, even-dimensional manifolds of finite type which we have implemented in Sage [S+09]. As an…
We present an algorithm to compute path homology for simple digraphs, and use it to topologically analyze various small digraphs en route to an analysis of complex temporal networks which exhibit such digraphs as underlying motifs. The…
Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…