Related papers: Edge Contractions and Simplicial Homology
Persistent homology is a popular data analysis technique that is used to capture the changing topology of a filtration associated with some simplicial complex $K$. These topological changes are summarized in persistence diagrams. We propose…
In this article, we investigate for some sufficient conditions for the existence and uniqueness of best proximity points for the topological $p$-proximal contractions and $p$-proximal contractive mappings on arbitrary topological spaces.…
Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…
Despite the vast literature on network dynamics, we still lack basic insights into dynamics on higher-order structures (e.g., edges, triangles, and more generally, $k$-dimensional "simplices") and how they are influenced through…
We consider persistent homology obtained by applying homology to the open Rips filtration of a compact metric space $(X,d)$. We show that each decrease in zero-dimensional persistence and each increase in one-dimensional persistence is…
We prove a general version of the homological perturbation lemma which works in the presence of curvature, and without the restriction to strong deformation retracts, building on work of Markl. A key observation is that the notion of strong…
While intersections of convex sets are convex, their unions have rather complicated behavior. Some natural contexts where they appear include duality arguments involving boundaries of convex sets and valuations, which have an Euler…
We investigate the computational complexity of edge-deletion and edge-contraction problems in fuzzy graphs. For any graph property {\Pi} that is hereditary under contractions (or deletions) and determined by 3-connected components, the…
We present a novel theoretical framework connecting k-component edge connectivity with spectral graph theory and homology theory to pro vide new insights into the resilience of real-world networks. By extending classical edge connectivity…
We prove that twisted correction terms in Heegaard Floer homology provide lower bounds on the Thurston norm of certain cohomology classes determined by the strong concordance class of a 2-component link $L$ in $S^3$. We then specialise this…
Using preservations of piecewise linear (PL) homeomorphism types under edge contractions (the link condition) as a topological proxy for flagness, we give a quantitative description of the effect flagness on on gamma positivity of…
An edge state is a time-harmonic solution of a conservative wave system, e.g. Schroedinger, Maxwell, which is propagating (plane-wave-like) parallel to, and localized transverse to, a line-defect or "edge". Topologically protected edge…
We prove that the homology of the mapping class group of any 3-manifold stabilizes under connected sum and boundary connected sum with an arbitrary 3-manifold when both manifolds are compact and orientable. The stabilization also holds for…
We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first…
High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the…
In a seminal paper, Erdos and Renyi identified the threshold for connectivity of the random graph G(n,p). In particular, they showed that if p >> log(n)/n then G(n,p) is almost always connected, and if p << log(n)/n then G(n,p) is almost…
It is a classical important problem of differential topology by Thom; for a homology class of a compact manifold, can we realize this by a closed submanifold with no boundary? This is true if the degree of the class is smaller or equal to…
Planar/flat configurations of fixed-angle chains and trees are well studied in the context of polymer science, molecular biology, and puzzles. In this paper, we focus on a simple type of fixed-angle linkage: every edge has unit length…
Arone and the second author showed that when the dimensions are in the stable range, the rational homology and homotopy of the high dimensional anologues of spaces of long knots can be calculated as the homology of a direct sum of finite…
We prove the following "linkage" theorem: two p-regular graphs of the same genus can be obtained from one another by a finite alternating sequence of one-edge-contractions; moreover this preserves 3-edge-connectivity. We use the linkage…