Related papers: On The Discrete Morse Functions for Hypergraphs
Building on previous work, this paper extends the modeling of political structures from simplicial complexes to hypergraphs. This allows the analysis of more complex political dynamics where agents who are willing to form coalitions contain…
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…
In studies of smooth maps with good differential topological conditions such as immersions, embeddings, Morse functions and their higher dimensional versions including fold maps and application to geometry, especially algebraic and…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
Hypergraph is a general way of representing high-order relations on a set of objects. It is a generalization of graph, in which only pairwise relations can be represented. It finds applications in various domains where relationships of more…
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…
Hypergraphs and simplical complexes both capture the higher-order interactions of complex systems, ranging from higher-order collaboration networks to brain networks. One open problem in the field is what should drive the choice of the…
The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…
This article arose from a series of three lectures given at the Banach Center, Warsaw, during period of 24 March to 13 April, 2003. Morse functions are useful tool in revealing the geometric formation of its domain manifolds $M$. They…
Theoretical development and applications of graph signal processing (GSP) have attracted much attention. In classical GSP, the underlying structures are restricted in terms of dimensionality. A graph is a combinatorial object that models…
The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of…
Analyzing embedded simplicial complexes, such as triangular meshes and graphs, is an important problem in many fields. We propose a new approach for analyzing embedded simplicial complexes in a subdivision-invariant and isometry-invariant…
We study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph to…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
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…
Many fundamental structures of Riemannian geometry have found discrete counterparts for graphs or combinatorial ones for simplicial complexes. These include those discussed in this survey, Hodge theory, Morse theory, the spectral theory of…
We present an algorithm which produces a decomposition of a regular cellular complex with a discrete Morse function analogous to the Morse-Smale decomposition of a smooth manifold with respect to a smooth Morse function. The advantage of…
A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. This random graph is a particular case of the soft random graph model introduced by Penrose, in…
In this paper, we introduce a new method to compute magnitude homology of general graphs. To each direct sum component of magnitude chain complexes, we assign a pair of simplicial complexes whose simplicial chain complex is isomorphic to…