Related papers: On tension-continuous mapings
Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…
Interconnected networks of rigid struts are critical for application in lightweight, load-bearing structures. However, accurately modeling stress distribution in these strut lattices poses significant computational challenges due to its…
Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…
In [S. Basu, A. Gabrielov, N. Vorobjov, Semi-monotone sets. arXiv:1004.5047v2 (2011)] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals, and having connected intersections with all…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
End-periodic homotopy equivalences of infinite, locally finite graphs serve as dimension-one analogs of the end-periodic automorphisms traditionally defined on infinite-type surfaces. We demonstrate that if $\Gamma$ is an infinite graph…
Persistent Homology is a powerful tool in Topological Data Analysis (TDA) to capture topological properties of data succinctly at different spatial resolutions. For graphical data, shape, and structure of the neighborhood of individual data…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…
In this paper, we extend the definition of cohomology associated to monotone graph properties, to encompass twisted functor coefficients. We introduce oriented matchings on graphs, and focus on their (twisted) cohomology groups. We…
We define and develop a homotopy invariant notion for the topological complexity of a map $f:X \to Y$, denoted TC($f$), that interacts with TC($X$) and TC($Y$) in the same way cat($f$) interacts with cat($X$) and cat($Y$). Furthermore,…
Normal maps between discrete groups $N\rightarrow G$ were characterized [FS] as those which induce a compatible topological group structure on the homotopy quotient $EN\times_N G$. Here we deal with topological group (or loop) maps…
A monotone drawing of a planar graph $G$ is a planar straight-line drawing of $G$ where a monotone path exists between every pair of vertices of $G$ in some direction. Recently monotone drawings of planar graphs have been proposed as a new…
TDA (topological data analysis) is a relatively new area of research related to importing classical ideas from topology into the realm of data analysis. Under the umbrella term TDA, there falls, in particular, the notion of persistent…
In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct applications in the…
Homophily is a graph property describing the tendency of edges to connect similar nodes; the opposite is called heterophily. It is often believed that heterophilous graphs are challenging for standard message-passing graph neural networks…