Related papers: Inductive construction of path homology chains
Consider a graph $G$ with a long path $P$. When is it the case that $G$ also contains a long induced path? This question has been investigated in general as well as within a number of different graph classes since the 80s. We have recently…
Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…
We consider additive spanners of unweighted undirected graphs. Let $G$ be a graph and $H$ a subgraph of $G$. The most na\"ive way to construct an additive $k$-spanner of $G$ is the following: As long as $H$ is not an additive $k$-spanner…
The graph structure is a commonly used data storage mode, and it turns out that the low-dimensional embedded representation of nodes in the graph is extremely useful in various typical tasks, such as node classification, link prediction ,…
We formulate path integrals on any Riemannian manifold which admits the action of a compact Lie group by isometric transformations. We consider a path integral on a Riemannian manifold M on which a Lie group G acts isometrically. Then we…
We give an approximate Menger-type theorem for when a graph $G$ contains two $X-Y$ paths $P_1$ and $P_2$ such that $P_1 \cup P_2$ is an induced subgraph of $G$. More generally, we prove that there exists a function $f(d) \in O(d)$, such…
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…
Given an arbitrary hypergraph $\mathcal{H}$, we may glue to $\mathcal{H}$ a family of hypergraphs to get a new hypergraph $\mathcal{H}'$ having $\mathcal{H}$ as an induced subhypergraph. In this paper, we introduce three gluing techniques…
Motivated by the question of how macromolecules assemble, the notion of an {\it assembly tree} of a graph is introduced. Given a graph $G$, the paper is concerned with enumerating the number of assembly trees of $G$, a problem that applies…
The efficiency of extracting topological information from point data depends largely on the complex that is built on top of the data points. From a computational viewpoint, the most favored complexes for this purpose have so far been…
Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensions due to high computational complexity. A recursive algorithm is proposed to compute…
This work is part of a series of papers focusing on multipath cohomology of directed graphs. Multipath cohomology is defined as the (poset) homology of the path poset -- i.e., the poset of disjoint simple paths in a graph -- with respect to…
We consider the problem of inferring the topology of a network using the measurements available at the end nodes, without cooperation from the internal nodes. To this end, we provide a simple method to obtain path interference which…
We give an explicit characterization for group extensions that correspond to elements of the symmetric cohomology $HS^2(G,A)$. We also give conditions for the map $HS^n(G,A)\to H^n(G,A)$ to be injective.
In this paper, we study long paths and Hamiltonian paths in inhomogenous random graphs. In the first part of the paper, we consider an inhomogenous Erd\H{o}s-R\'enyi random graph $G_E$ with average edge density $p_n.$ We prove that if…
On any closed symplectic manifold we construct a path-connected neighborhood of the identity in the Hamiltonian diffeomorphism group with the property that each Hamiltonian diffeomorphism in this neighborhood admits a Hofer and spectral…
We propose a topological framework for memory and inference grounded in the structure of spike-timing dynamics, persistent homology, and the Context-Content Uncertainty Principle (CCUP). Starting from the observation that polychronous…
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\to \mathcal{P}(X)-\{\emptyset\}$ defined…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…